./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-6b4ec56 [2022-11-20 11:23:20,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:23:20,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:23:20,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:23:20,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:23:20,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:23:20,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:23:20,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:23:20,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:23:20,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:23:20,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:23:20,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:23:20,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:23:20,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:23:20,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:23:20,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:23:20,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:23:20,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:23:20,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:23:20,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:23:20,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:23:20,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:23:20,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:23:20,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:23:20,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:23:20,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:23:20,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:23:20,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:23:20,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:23:20,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:23:20,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:23:20,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:23:20,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:23:20,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:23:20,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:23:20,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:23:20,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:23:20,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:23:20,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:23:20,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:23:20,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:23:20,505 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 11:23:20,548 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:23:20,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:23:20,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:23:20,552 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:23:20,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:23:20,553 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:23:20,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:23:20,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:23:20,555 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:23:20,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:23:20,557 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:23:20,557 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:23:20,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:23:20,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:23:20,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:23:20,558 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:23:20,559 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:23:20,559 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:23:20,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:23:20,559 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:23:20,560 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:23:20,560 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:23:20,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:23:20,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:23:20,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:23:20,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:23:20,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:23:20,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:23:20,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:23:20,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:23:20,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2022-11-20 11:23:20,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:23:20,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:23:20,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:23:20,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:23:20,972 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:23:20,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-20 11:23:24,233 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:23:24,506 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:23:24,506 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-20 11:23:24,522 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/data/347af9822/394cb9e17fe44cb6b011914e7e578a3f/FLAG297b5ccde [2022-11-20 11:23:24,540 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/data/347af9822/394cb9e17fe44cb6b011914e7e578a3f [2022-11-20 11:23:24,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:23:24,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:23:24,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:23:24,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:23:24,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:23:24,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:23:24" (1/1) ... [2022-11-20 11:23:24,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d23d133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:24, skipping insertion in model container [2022-11-20 11:23:24,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:23:24" (1/1) ... [2022-11-20 11:23:24,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:23:24,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:23:25,042 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_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-20 11:23:25,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:23:25,066 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:23:25,141 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_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-20 11:23:25,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:23:25,185 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:23:25,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25 WrapperNode [2022-11-20 11:23:25,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:23:25,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:23:25,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:23:25,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:23:25,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (1/1) ... [2022-11-20 11:23:25,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (1/1) ... [2022-11-20 11:23:25,271 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 160 [2022-11-20 11:23:25,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:23:25,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:23:25,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:23:25,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:23:25,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (1/1) ... [2022-11-20 11:23:25,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (1/1) ... [2022-11-20 11:23:25,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (1/1) ... [2022-11-20 11:23:25,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (1/1) ... [2022-11-20 11:23:25,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (1/1) ... [2022-11-20 11:23:25,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (1/1) ... [2022-11-20 11:23:25,331 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (1/1) ... [2022-11-20 11:23:25,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (1/1) ... [2022-11-20 11:23:25,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:23:25,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:23:25,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:23:25,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:23:25,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (1/1) ... [2022-11-20 11:23:25,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:23:25,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:25,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:23:25,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:23:25,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:23:25,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:23:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 11:23:25,457 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 11:23:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:23:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:23:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:23:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:23:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:23:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:23:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 11:23:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:23:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:23:25,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:23:25,664 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:23:25,666 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:23:26,293 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:23:26,302 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:23:26,309 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 11:23:26,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:23:26 BoogieIcfgContainer [2022-11-20 11:23:26,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:23:26,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:23:26,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:23:26,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:23:26,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:23:24" (1/3) ... [2022-11-20 11:23:26,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b822638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:23:26, skipping insertion in model container [2022-11-20 11:23:26,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:23:25" (2/3) ... [2022-11-20 11:23:26,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b822638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:23:26, skipping insertion in model container [2022-11-20 11:23:26,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:23:26" (3/3) ... [2022-11-20 11:23:26,325 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2022-11-20 11:23:26,352 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:23:26,353 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-11-20 11:23:26,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:23:26,422 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1e7e3024, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:23:26,422 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-11-20 11:23:26,428 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-20 11:23:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 11:23:26,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:26,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 11:23:26,436 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-20 11:23:26,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash 896534515, now seen corresponding path program 1 times [2022-11-20 11:23:26,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:26,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647360263] [2022-11-20 11:23:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:26,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:23:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:26,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647360263] [2022-11-20 11:23:26,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647360263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:26,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:26,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:23:26,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636339081] [2022-11-20 11:23:26,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:26,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:23:26,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:26,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:23:26,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:23:26,899 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-20 11:23:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:27,195 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2022-11-20 11:23:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:23:27,201 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-20 11:23:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:27,213 INFO L225 Difference]: With dead ends: 151 [2022-11-20 11:23:27,214 INFO L226 Difference]: Without dead ends: 148 [2022-11-20 11:23:27,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:23:27,221 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-20 11:23:27,224 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-20 11:23:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-20 11:23:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-20 11:23:27,286 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-20 11:23:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-11-20 11:23:27,290 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 6 [2022-11-20 11:23:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:27,291 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-11-20 11:23:27,291 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-20 11:23:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-11-20 11:23:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 11:23:27,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:27,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 11:23:27,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:23:27,293 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-20 11:23:27,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash 896534514, now seen corresponding path program 1 times [2022-11-20 11:23:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:27,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534852353] [2022-11-20 11:23:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:27,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:23:27,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:27,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534852353] [2022-11-20 11:23:27,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534852353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:27,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:27,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:23:27,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794069339] [2022-11-20 11:23:27,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:27,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:23:27,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:27,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:23:27,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:23:27,387 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-20 11:23:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:27,554 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2022-11-20 11:23:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:23:27,554 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-20 11:23:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:27,556 INFO L225 Difference]: With dead ends: 145 [2022-11-20 11:23:27,556 INFO L226 Difference]: Without dead ends: 145 [2022-11-20 11:23:27,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:23:27,563 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.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:27,563 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.1s Time] [2022-11-20 11:23:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-20 11:23:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-11-20 11:23:27,575 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-20 11:23:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2022-11-20 11:23:27,578 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 6 [2022-11-20 11:23:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:27,578 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2022-11-20 11:23:27,579 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-20 11:23:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2022-11-20 11:23:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:23:27,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:27,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:27,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:23:27,580 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-20 11:23:27,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:27,581 INFO L85 PathProgramCache]: Analyzing trace with hash 976905444, now seen corresponding path program 1 times [2022-11-20 11:23:27,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:27,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730883603] [2022-11-20 11:23:27,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:27,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:23:27,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:27,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730883603] [2022-11-20 11:23:27,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730883603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:27,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:27,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:23:27,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327166257] [2022-11-20 11:23:27,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:27,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:27,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:27,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:27,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:27,742 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-20 11:23:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:27,987 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2022-11-20 11:23:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:23:27,988 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-20 11:23:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:27,993 INFO L225 Difference]: With dead ends: 156 [2022-11-20 11:23:27,993 INFO L226 Difference]: Without dead ends: 156 [2022-11-20 11:23:27,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:28,003 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-20 11:23:28,005 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-20 11:23:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-20 11:23:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2022-11-20 11:23:28,025 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-20 11:23:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2022-11-20 11:23:28,028 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 14 [2022-11-20 11:23:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:28,029 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2022-11-20 11:23:28,029 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-20 11:23:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2022-11-20 11:23:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:28,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:28,030 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:28,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:23:28,031 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-20 11:23:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:28,032 INFO L85 PathProgramCache]: Analyzing trace with hash 302098592, now seen corresponding path program 1 times [2022-11-20 11:23:28,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:28,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168657034] [2022-11-20 11:23:28,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:28,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:28,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:28,347 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-20 11:23:28,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:28,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168657034] [2022-11-20 11:23:28,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168657034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:28,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:28,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:23:28,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21792256] [2022-11-20 11:23:28,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:28,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:23:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:28,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:23:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:23:28,351 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-20 11:23:28,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:28,818 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-11-20 11:23:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:23:28,818 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-20 11:23:28,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:28,821 INFO L225 Difference]: With dead ends: 146 [2022-11-20 11:23:28,822 INFO L226 Difference]: Without dead ends: 146 [2022-11-20 11:23:28,822 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-20 11:23:28,823 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 21 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-20 11:23:28,824 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-20 11:23:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-20 11:23:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2022-11-20 11:23:28,832 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-20 11:23:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2022-11-20 11:23:28,834 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 24 [2022-11-20 11:23:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:28,843 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2022-11-20 11:23:28,843 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-20 11:23:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2022-11-20 11:23:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:28,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:28,844 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:28,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:23:28,845 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-20 11:23:28,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:28,846 INFO L85 PathProgramCache]: Analyzing trace with hash 302098593, now seen corresponding path program 1 times [2022-11-20 11:23:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:28,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205938820] [2022-11-20 11:23:28,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:28,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:29,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:29,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:29,245 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-20 11:23:29,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:29,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205938820] [2022-11-20 11:23:29,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205938820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:29,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:29,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:23:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164065026] [2022-11-20 11:23:29,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:29,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:23:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:29,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:23:29,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:23:29,249 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-20 11:23:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:29,673 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-11-20 11:23:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:23:29,677 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-20 11:23:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:29,678 INFO L225 Difference]: With dead ends: 145 [2022-11-20 11:23:29,678 INFO L226 Difference]: Without dead ends: 145 [2022-11-20 11:23:29,679 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-20 11:23:29,679 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.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:29,680 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.4s Time] [2022-11-20 11:23:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-20 11:23:29,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2022-11-20 11:23:29,685 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-20 11:23:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2022-11-20 11:23:29,694 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 24 [2022-11-20 11:23:29,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:29,695 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2022-11-20 11:23:29,695 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-20 11:23:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2022-11-20 11:23:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:23:29,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:29,697 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-20 11:23:29,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:23:29,697 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-20 11:23:29,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029503, now seen corresponding path program 1 times [2022-11-20 11:23:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:29,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569422446] [2022-11-20 11:23:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:30,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:30,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:30,182 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-20 11:23:30,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:30,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569422446] [2022-11-20 11:23:30,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569422446] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:30,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717394284] [2022-11-20 11:23:30,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:30,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:30,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:30,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:30,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:23:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:30,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 11:23:30,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:30,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:23:30,517 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-20 11:23:30,691 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:23:30,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:23:30,717 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-20 11:23:30,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:30,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717394284] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:30,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:23:30,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-20 11:23:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727931103] [2022-11-20 11:23:30,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:30,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:23:30,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:30,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:23:30,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-20 11:23:30,810 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-20 11:23:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:31,318 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2022-11-20 11:23:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:23:31,319 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-20 11:23:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:31,320 INFO L225 Difference]: With dead ends: 151 [2022-11-20 11:23:31,320 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 11:23:31,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2022-11-20 11:23:31,321 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 5 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:31,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 565 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 441 Invalid, 0 Unknown, 170 Unchecked, 0.4s Time] [2022-11-20 11:23:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 11:23:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-11-20 11:23:31,328 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-20 11:23:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2022-11-20 11:23:31,329 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 26 [2022-11-20 11:23:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:31,330 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2022-11-20 11:23:31,330 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-20 11:23:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2022-11-20 11:23:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:23:31,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:31,332 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-20 11:23:31,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 11:23:31,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:31,545 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-20 11:23:31,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:31,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029502, now seen corresponding path program 1 times [2022-11-20 11:23:31,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:31,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975438240] [2022-11-20 11:23:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:31,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:31,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:32,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:32,223 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-20 11:23:32,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:32,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975438240] [2022-11-20 11:23:32,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975438240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:32,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788280647] [2022-11-20 11:23:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:32,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:32,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:32,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:23:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:32,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 11:23:32,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:32,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:23:32,686 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-20 11:23:32,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:32,778 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-20 11:23:32,789 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:23:32,789 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-20 11:23:32,841 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-20 11:23:32,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:35,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788280647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:35,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:23:35,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2022-11-20 11:23:35,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395691894] [2022-11-20 11:23:35,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:35,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 11:23:35,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:35,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 11:23:35,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2022-11-20 11:23:35,101 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-20 11:23:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:36,428 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2022-11-20 11:23:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:23:36,429 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-20 11:23:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:36,431 INFO L225 Difference]: With dead ends: 151 [2022-11-20 11:23:36,431 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 11:23:36,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=79, Invalid=386, Unknown=1, NotChecked=40, Total=506 [2022-11-20 11:23:36,432 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 17 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:36,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 939 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1174 Invalid, 0 Unknown, 150 Unchecked, 1.1s Time] [2022-11-20 11:23:36,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 11:23:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-11-20 11:23:36,438 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-20 11:23:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-11-20 11:23:36,439 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 26 [2022-11-20 11:23:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:36,440 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-11-20 11:23:36,440 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-20 11:23:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-11-20 11:23:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:23:36,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:36,442 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-20 11:23:36,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:36,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 11:23:36,649 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-20 11:23:36,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:36,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1908047191, now seen corresponding path program 1 times [2022-11-20 11:23:36,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:36,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607130727] [2022-11-20 11:23:36,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:36,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:36,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:36,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:36,855 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-20 11:23:36,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:36,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607130727] [2022-11-20 11:23:36,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607130727] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:36,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957898140] [2022-11-20 11:23:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:36,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:36,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:36,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:36,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:23:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:37,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 11:23:37,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:37,090 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-20 11:23:37,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:37,159 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-20 11:23:37,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957898140] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:23:37,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:23:37,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-20 11:23:37,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115296699] [2022-11-20 11:23:37,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:37,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:23:37,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:37,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:23:37,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:23:37,164 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-20 11:23:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:37,453 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2022-11-20 11:23:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:23:37,453 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-20 11:23:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:37,455 INFO L225 Difference]: With dead ends: 150 [2022-11-20 11:23:37,455 INFO L226 Difference]: Without dead ends: 150 [2022-11-20 11:23:37,455 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-20 11:23:37,456 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.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:37,456 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.3s Time] [2022-11-20 11:23:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-20 11:23:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-11-20 11:23:37,460 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-20 11:23:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2022-11-20 11:23:37,462 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 28 [2022-11-20 11:23:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:37,463 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2022-11-20 11:23:37,463 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-20 11:23:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-11-20 11:23:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:23:37,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:37,464 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-20 11:23:37,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:37,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:37,671 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-20 11:23:37,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash -984859886, now seen corresponding path program 1 times [2022-11-20 11:23:37,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:37,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751594636] [2022-11-20 11:23:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:37,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:37,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:37,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:37,814 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-20 11:23:37,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:37,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751594636] [2022-11-20 11:23:37,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751594636] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:37,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680221168] [2022-11-20 11:23:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:37,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:37,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:37,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:37,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:23:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:38,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:23:38,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:38,045 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-20 11:23:38,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:38,062 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:23:38,062 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-20 11:23:38,090 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-20 11:23:38,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680221168] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:23:38,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:23:38,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-20 11:23:38,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339250440] [2022-11-20 11:23:38,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:38,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:23:38,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:38,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:23:38,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:38,093 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-20 11:23:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:38,416 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2022-11-20 11:23:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:23:38,416 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-20 11:23:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:38,418 INFO L225 Difference]: With dead ends: 154 [2022-11-20 11:23:38,418 INFO L226 Difference]: Without dead ends: 154 [2022-11-20 11:23:38,418 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-20 11:23:38,419 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 13 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:38,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 351 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:23:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-20 11:23:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2022-11-20 11:23:38,426 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-20 11:23:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-11-20 11:23:38,427 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 29 [2022-11-20 11:23:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:38,427 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-11-20 11:23:38,427 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-20 11:23:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-11-20 11:23:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:23:38,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:38,429 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-20 11:23:38,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:38,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:38,635 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-20 11:23:38,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash -984859885, now seen corresponding path program 1 times [2022-11-20 11:23:38,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:38,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368869166] [2022-11-20 11:23:38,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:38,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:39,020 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-20 11:23:39,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:39,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368869166] [2022-11-20 11:23:39,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368869166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:39,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145872075] [2022-11-20 11:23:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:39,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:39,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:39,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:39,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:23:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:39,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:23:39,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:39,365 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-20 11:23:39,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:39,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:23:39,410 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-20 11:23:39,587 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-20 11:23:39,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145872075] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:23:39,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:23:39,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-20 11:23:39,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484806231] [2022-11-20 11:23:39,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:39,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:23:39,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:39,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:23:39,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:23:39,590 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-20 11:23:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:40,016 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2022-11-20 11:23:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:23:40,017 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-20 11:23:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:40,018 INFO L225 Difference]: With dead ends: 159 [2022-11-20 11:23:40,018 INFO L226 Difference]: Without dead ends: 159 [2022-11-20 11:23:40,019 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-20 11:23:40,019 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 30 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:40,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1198 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:23:40,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-20 11:23:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2022-11-20 11:23:40,024 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-20 11:23:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2022-11-20 11:23:40,025 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 29 [2022-11-20 11:23:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:40,026 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2022-11-20 11:23:40,026 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-20 11:23:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2022-11-20 11:23:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:23:40,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:40,027 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-20 11:23:40,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:40,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 11:23:40,234 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-20 11:23:40,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash -465885389, now seen corresponding path program 1 times [2022-11-20 11:23:40,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:40,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465944977] [2022-11-20 11:23:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:40,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:40,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:40,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:40,433 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-20 11:23:40,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:40,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465944977] [2022-11-20 11:23:40,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465944977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:40,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:40,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:23:40,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850509802] [2022-11-20 11:23:40,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:40,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:23:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:40,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:23:40,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:23:40,439 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-20 11:23:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:40,968 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-11-20 11:23:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:23:40,968 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-20 11:23:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:40,970 INFO L225 Difference]: With dead ends: 152 [2022-11-20 11:23:40,971 INFO L226 Difference]: Without dead ends: 152 [2022-11-20 11:23:40,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-20 11:23:40,972 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 24 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:40,972 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.5s Time] [2022-11-20 11:23:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-20 11:23:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2022-11-20 11:23:40,976 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-20 11:23:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2022-11-20 11:23:40,978 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 30 [2022-11-20 11:23:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:40,978 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2022-11-20 11:23:40,978 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-20 11:23:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2022-11-20 11:23:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:23:40,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:40,984 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-20 11:23:40,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:23:40,984 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-20 11:23:40,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:40,985 INFO L85 PathProgramCache]: Analyzing trace with hash -465885388, now seen corresponding path program 1 times [2022-11-20 11:23:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:40,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439917627] [2022-11-20 11:23:40,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:40,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:41,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:41,362 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-20 11:23:41,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:41,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439917627] [2022-11-20 11:23:41,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439917627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:41,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:41,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:23:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533628287] [2022-11-20 11:23:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:41,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:23:41,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:23:41,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:23:41,365 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-20 11:23:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:41,830 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2022-11-20 11:23:41,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:23:41,830 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-20 11:23:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:41,831 INFO L225 Difference]: With dead ends: 150 [2022-11-20 11:23:41,831 INFO L226 Difference]: Without dead ends: 150 [2022-11-20 11:23:41,832 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-20 11:23:41,832 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-20 11:23:41,832 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-20 11:23:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-20 11:23:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-20 11:23:41,835 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-20 11:23:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2022-11-20 11:23:41,836 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 30 [2022-11-20 11:23:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:41,837 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2022-11-20 11:23:41,837 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-20 11:23:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2022-11-20 11:23:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:23:41,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:41,838 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-20 11:23:41,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:23:41,838 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-20 11:23:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1959133359, now seen corresponding path program 1 times [2022-11-20 11:23:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:41,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144159092] [2022-11-20 11:23:41,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:42,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:42,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 11:23:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:42,072 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-20 11:23:42,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:42,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144159092] [2022-11-20 11:23:42,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144159092] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:42,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166030577] [2022-11-20 11:23:42,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:42,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:42,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:42,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:42,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:23:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:42,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:23:42,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:42,337 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-20 11:23:42,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:42,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166030577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:42,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:23:42,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-20 11:23:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592232740] [2022-11-20 11:23:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:42,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:42,341 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-20 11:23:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:42,358 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-11-20 11:23:42,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:23:42,359 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-20 11:23:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:42,360 INFO L225 Difference]: With dead ends: 138 [2022-11-20 11:23:42,360 INFO L226 Difference]: Without dead ends: 138 [2022-11-20 11:23:42,361 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-20 11:23:42,362 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 124 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:42,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 170 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:23:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-20 11:23:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-20 11:23:42,369 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-20 11:23:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2022-11-20 11:23:42,370 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 41 [2022-11-20 11:23:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:42,370 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2022-11-20 11:23:42,371 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-20 11:23:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-11-20 11:23:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 11:23:42,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:42,377 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-20 11:23:42,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-20 11:23:42,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:42,584 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-20 11:23:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash -930567857, now seen corresponding path program 1 times [2022-11-20 11:23:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:42,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435088440] [2022-11-20 11:23:42,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:42,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:43,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:43,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:43,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:23:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:43,245 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-20 11:23:43,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:43,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435088440] [2022-11-20 11:23:43,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435088440] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:43,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084225739] [2022-11-20 11:23:43,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:43,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:43,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:43,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:43,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:23:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:43,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-20 11:23:43,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:43,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:23:43,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:23:43,560 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-20 11:23:43,578 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-20 11:23:43,604 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:43,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:43,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 11:23:43,716 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-20 11:23:43,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:43,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:23:43,879 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-20 11:23:43,906 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:23:43,907 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-20 11:23:43,920 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-20 11:23:43,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:44,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084225739] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:44,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:23:44,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2022-11-20 11:23:44,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120190279] [2022-11-20 11:23:44,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:44,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:23:44,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:23:44,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=221, Unknown=4, NotChecked=132, Total=420 [2022-11-20 11:23:44,221 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-20 11:23:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:45,005 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-11-20 11:23:45,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:23:45,006 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-20 11:23:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:45,007 INFO L225 Difference]: With dead ends: 147 [2022-11-20 11:23:45,007 INFO L226 Difference]: Without dead ends: 147 [2022-11-20 11:23:45,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=311, Unknown=4, NotChecked=156, Total=552 [2022-11-20 11:23:45,008 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 200 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 518 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:45,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 521 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 619 Invalid, 0 Unknown, 518 Unchecked, 0.6s Time] [2022-11-20 11:23:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-20 11:23:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2022-11-20 11:23:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 124 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:23:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2022-11-20 11:23:45,012 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 43 [2022-11-20 11:23:45,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:45,013 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2022-11-20 11:23:45,013 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-20 11:23:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2022-11-20 11:23:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 11:23:45,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:45,014 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-20 11:23:45,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:45,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:45,224 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-20 11:23:45,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash -930567856, now seen corresponding path program 1 times [2022-11-20 11:23:45,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:45,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965559716] [2022-11-20 11:23:45,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:45,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:23:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:46,111 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-20 11:23:46,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:46,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965559716] [2022-11-20 11:23:46,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965559716] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:46,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568093418] [2022-11-20 11:23:46,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:46,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:46,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:46,125 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:46,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:23:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:46,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 11:23:46,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:46,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:23:46,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:23:46,474 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-20 11:23:46,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:46,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:46,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:23:46,562 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-20 11:23:46,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:46,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:46,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:23:46,736 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-20 11:23:46,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:46,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:46,813 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-20 11:23:46,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:46,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568093418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:46,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:23:46,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2022-11-20 11:23:46,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348695578] [2022-11-20 11:23:46,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:46,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 11:23:46,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 11:23:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=251, Unknown=3, NotChecked=102, Total=420 [2022-11-20 11:23:46,946 INFO L87 Difference]: Start difference. First operand 129 states and 137 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-20 11:23:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:47,650 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-11-20 11:23:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:23:47,651 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-20 11:23:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:47,652 INFO L225 Difference]: With dead ends: 137 [2022-11-20 11:23:47,652 INFO L226 Difference]: Without dead ends: 137 [2022-11-20 11:23:47,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=335, Unknown=3, NotChecked=120, Total=552 [2022-11-20 11:23:47,653 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 418 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:47,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 267 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 388 Invalid, 0 Unknown, 417 Unchecked, 0.6s Time] [2022-11-20 11:23:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-20 11:23:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2022-11-20 11:23:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 114 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:23:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2022-11-20 11:23:47,658 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 43 [2022-11-20 11:23:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:47,658 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2022-11-20 11:23:47,659 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-20 11:23:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2022-11-20 11:23:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:23:47,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:47,660 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-20 11:23:47,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:47,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 11:23:47,868 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-20 11:23:47,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883970, now seen corresponding path program 1 times [2022-11-20 11:23:47,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:47,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748320069] [2022-11-20 11:23:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:47,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:48,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:48,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:48,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:23:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:48,888 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-20 11:23:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:48,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748320069] [2022-11-20 11:23:48,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748320069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:48,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957611957] [2022-11-20 11:23:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:48,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:48,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:48,891 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:48,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:23:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:49,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-20 11:23:49,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:49,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:23:49,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-20 11:23:49,813 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-20 11:23:49,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:49,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:23:49,894 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 11:23:49,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:23:49,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 11:23:49,997 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-20 11:23:49,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:50,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957611957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:50,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:23:50,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-11-20 11:23:50,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407509563] [2022-11-20 11:23:50,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:50,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 11:23:50,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 11:23:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=662, Unknown=12, NotChecked=52, Total=812 [2022-11-20 11:23:50,200 INFO L87 Difference]: Start difference. First operand 119 states and 127 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-20 11:23:51,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:51,220 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2022-11-20 11:23:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:23:51,221 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-20 11:23:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:51,222 INFO L225 Difference]: With dead ends: 205 [2022-11-20 11:23:51,222 INFO L226 Difference]: Without dead ends: 205 [2022-11-20 11:23:51,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=974, Unknown=14, NotChecked=64, Total=1190 [2022-11-20 11:23:51,223 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 117 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:51,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 700 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 779 Invalid, 0 Unknown, 192 Unchecked, 0.7s Time] [2022-11-20 11:23:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-20 11:23:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 126. [2022-11-20 11:23:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 121 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:23:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2022-11-20 11:23:51,228 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 46 [2022-11-20 11:23:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:51,228 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2022-11-20 11:23:51,229 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-20 11:23:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2022-11-20 11:23:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:23:51,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:51,230 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-20 11:23:51,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:51,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 11:23:51,436 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-20 11:23:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883971, now seen corresponding path program 1 times [2022-11-20 11:23:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:51,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737232060] [2022-11-20 11:23:51,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:51,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:52,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:52,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:52,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:23:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:53,416 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-20 11:23:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:53,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737232060] [2022-11-20 11:23:53,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737232060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:53,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913688860] [2022-11-20 11:23:53,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:53,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:23:53,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:23:53,420 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:23:53,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:23:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:53,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 11:23:53,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:53,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:23:53,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:23:54,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-20 11:23:54,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:23:54,835 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-20 11:23:54,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:54,908 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-20 11:23:54,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:54,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 11:23:54,942 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 11:23:54,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-20 11:23:54,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-20 11:23:55,045 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-20 11:23:55,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 11:23:55,076 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-20 11:23:55,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:56,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913688860] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:23:56,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:23:56,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2022-11-20 11:23:56,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828765204] [2022-11-20 11:23:56,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:56,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 11:23:56,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:56,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 11:23:56,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1015, Unknown=1, NotChecked=64, Total=1190 [2022-11-20 11:23:56,411 INFO L87 Difference]: Start difference. First operand 126 states and 144 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-20 11:23:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:58,484 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2022-11-20 11:23:58,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:23:58,485 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-20 11:23:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:58,486 INFO L225 Difference]: With dead ends: 206 [2022-11-20 11:23:58,486 INFO L226 Difference]: Without dead ends: 206 [2022-11-20 11:23:58,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=220, Invalid=1763, Unknown=1, NotChecked=86, Total=2070 [2022-11-20 11:23:58,488 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 592 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:58,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 841 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1414 Invalid, 0 Unknown, 143 Unchecked, 1.5s Time] [2022-11-20 11:23:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-20 11:23:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 126. [2022-11-20 11:23:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 121 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:23:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2022-11-20 11:23:58,493 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 46 [2022-11-20 11:23:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:58,494 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2022-11-20 11:23:58,494 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-20 11:23:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2022-11-20 11:23:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 11:23:58,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:58,495 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-20 11:23:58,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:58,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 11:23:58,702 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-20 11:23:58,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1771238793, now seen corresponding path program 1 times [2022-11-20 11:23:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:58,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431406070] [2022-11-20 11:23:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:58,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:58,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:58,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:58,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:23:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:58,874 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-20 11:23:58,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:58,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431406070] [2022-11-20 11:23:58,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431406070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:58,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:58,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:23:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824186946] [2022-11-20 11:23:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:58,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:58,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:58,879 INFO L87 Difference]: Start difference. First operand 126 states and 142 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-20 11:23:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:59,009 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2022-11-20 11:23:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:23:59,010 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-20 11:23:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:59,011 INFO L225 Difference]: With dead ends: 166 [2022-11-20 11:23:59,011 INFO L226 Difference]: Without dead ends: 166 [2022-11-20 11:23:59,011 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-20 11:23:59,012 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 78 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:59,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 260 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:23:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-20 11:23:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 122. [2022-11-20 11:23:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 117 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:23:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2022-11-20 11:23:59,015 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 47 [2022-11-20 11:23:59,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:59,016 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2022-11-20 11:23:59,016 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-20 11:23:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2022-11-20 11:23:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 11:23:59,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:59,017 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-20 11:23:59,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 11:23:59,017 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-20 11:23:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:59,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997608, now seen corresponding path program 1 times [2022-11-20 11:23:59,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:59,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790403032] [2022-11-20 11:23:59,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:59,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:59,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:59,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:59,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:23:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:59,243 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-20 11:23:59,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:59,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790403032] [2022-11-20 11:23:59,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790403032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:59,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:59,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:23:59,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069750447] [2022-11-20 11:23:59,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:59,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:23:59,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:59,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:23:59,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:23:59,246 INFO L87 Difference]: Start difference. First operand 122 states and 131 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-20 11:23:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:59,555 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-11-20 11:23:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:23:59,556 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-20 11:23:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:59,557 INFO L225 Difference]: With dead ends: 134 [2022-11-20 11:23:59,557 INFO L226 Difference]: Without dead ends: 134 [2022-11-20 11:23:59,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:23:59,558 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 86 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:59,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 307 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:23:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-20 11:23:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2022-11-20 11:23:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 79 states have (on average 1.5063291139240507) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:23:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2022-11-20 11:23:59,561 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 49 [2022-11-20 11:23:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:59,561 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2022-11-20 11:23:59,561 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-20 11:23:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-11-20 11:23:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 11:23:59,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:59,562 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-20 11:23:59,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 11:23:59,563 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-20 11:23:59,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:59,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997607, now seen corresponding path program 1 times [2022-11-20 11:23:59,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:59,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289432883] [2022-11-20 11:23:59,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:23:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:59,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:23:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:59,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:23:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:59,766 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-20 11:23:59,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:23:59,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289432883] [2022-11-20 11:23:59,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289432883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:59,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:59,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:23:59,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103301564] [2022-11-20 11:23:59,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:59,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:59,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:23:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:59,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:59,769 INFO L87 Difference]: Start difference. First operand 116 states and 125 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-20 11:23:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:59,918 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-11-20 11:23:59,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:23:59,919 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-20 11:23:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:59,919 INFO L225 Difference]: With dead ends: 115 [2022-11-20 11:23:59,919 INFO L226 Difference]: Without dead ends: 115 [2022-11-20 11:23:59,920 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-20 11:23:59,920 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 100 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:59,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 279 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:23:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-20 11:23:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-20 11:23:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.5) internal successors, (117), 110 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:23:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2022-11-20 11:23:59,924 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 49 [2022-11-20 11:23:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:59,925 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2022-11-20 11:23:59,925 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-20 11:23:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-11-20 11:23:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 11:23:59,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:59,926 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-20 11:23:59,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 11:23:59,926 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-20 11:23:59,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1351857860, now seen corresponding path program 1 times [2022-11-20 11:23:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:23:59,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525418184] [2022-11-20 11:23:59,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:23:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:24:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:24:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:24:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,178 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-20 11:24:00,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:00,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525418184] [2022-11-20 11:24:00,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525418184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:00,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:00,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:24:00,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833444634] [2022-11-20 11:24:00,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:00,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:24:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:24:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:24:00,181 INFO L87 Difference]: Start difference. First operand 115 states and 123 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-20 11:24:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:00,338 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-11-20 11:24:00,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:24:00,338 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-20 11:24:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:00,339 INFO L225 Difference]: With dead ends: 112 [2022-11-20 11:24:00,339 INFO L226 Difference]: Without dead ends: 112 [2022-11-20 11:24:00,339 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-20 11:24:00,340 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 179 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:00,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 220 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:24:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-20 11:24:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-20 11:24:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 107 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:24:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2022-11-20 11:24:00,344 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 49 [2022-11-20 11:24:00,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:00,344 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2022-11-20 11:24:00,344 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-20 11:24:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2022-11-20 11:24:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 11:24:00,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:00,345 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-20 11:24:00,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 11:24:00,345 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-20 11:24:00,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077693, now seen corresponding path program 1 times [2022-11-20 11:24:00,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:00,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565269825] [2022-11-20 11:24:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:00,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:24:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:24:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:24:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,488 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-20 11:24:00,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:00,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565269825] [2022-11-20 11:24:00,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565269825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:00,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:00,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:24:00,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699702033] [2022-11-20 11:24:00,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:00,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:24:00,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:00,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:24:00,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:00,491 INFO L87 Difference]: Start difference. First operand 112 states and 119 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-20 11:24:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:00,724 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2022-11-20 11:24:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:24:00,725 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-20 11:24:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:00,726 INFO L225 Difference]: With dead ends: 171 [2022-11-20 11:24:00,726 INFO L226 Difference]: Without dead ends: 171 [2022-11-20 11:24:00,727 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-20 11:24:00,727 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 166 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:00,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 215 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:24:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-20 11:24:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 111. [2022-11-20 11:24:00,730 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-20 11:24:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2022-11-20 11:24:00,731 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 50 [2022-11-20 11:24:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:00,731 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2022-11-20 11:24:00,731 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-20 11:24:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2022-11-20 11:24:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 11:24:00,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:00,732 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-20 11:24:00,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 11:24:00,732 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-20 11:24:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077694, now seen corresponding path program 1 times [2022-11-20 11:24:00,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:00,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020654113] [2022-11-20 11:24:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:00,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:24:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:24:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:24:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:00,927 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-20 11:24:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:00,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020654113] [2022-11-20 11:24:00,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020654113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:00,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:00,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:24:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776809480] [2022-11-20 11:24:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:00,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:24:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:00,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:24:00,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:00,929 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-20 11:24:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:01,186 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-11-20 11:24:01,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:24:01,187 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-20 11:24:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:01,188 INFO L225 Difference]: With dead ends: 110 [2022-11-20 11:24:01,189 INFO L226 Difference]: Without dead ends: 110 [2022-11-20 11:24:01,189 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-20 11:24:01,190 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 83 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:01,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 204 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:24:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-20 11:24:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-20 11:24:01,195 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-20 11:24:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2022-11-20 11:24:01,196 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 50 [2022-11-20 11:24:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:01,196 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2022-11-20 11:24:01,197 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-20 11:24:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-11-20 11:24:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 11:24:01,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:01,198 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-20 11:24:01,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 11:24:01,198 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-20 11:24:01,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2055329845, now seen corresponding path program 1 times [2022-11-20 11:24:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:01,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246786852] [2022-11-20 11:24:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:24:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:24:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:24:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:01,532 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-20 11:24:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:01,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246786852] [2022-11-20 11:24:01,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246786852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:01,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:01,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:24:01,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133317705] [2022-11-20 11:24:01,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:01,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:24:01,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:01,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:24:01,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:24:01,536 INFO L87 Difference]: Start difference. First operand 110 states and 117 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-20 11:24:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:01,797 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-11-20 11:24:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:24:01,797 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-20 11:24:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:01,798 INFO L225 Difference]: With dead ends: 104 [2022-11-20 11:24:01,798 INFO L226 Difference]: Without dead ends: 104 [2022-11-20 11:24:01,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:24:01,799 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 77 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:01,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 314 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:24:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-20 11:24:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-20 11:24:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 99 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 11:24:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2022-11-20 11:24:01,802 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 51 [2022-11-20 11:24:01,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:01,803 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2022-11-20 11:24:01,803 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-20 11:24:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2022-11-20 11:24:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 11:24:01,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:01,804 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-20 11:24:01,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 11:24:01,804 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-20 11:24:01,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash 512975501, now seen corresponding path program 1 times [2022-11-20 11:24:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:01,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316932299] [2022-11-20 11:24:01,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:01,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:03,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:24:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:03,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:24:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:03,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:24:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:04,707 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-20 11:24:04,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:04,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316932299] [2022-11-20 11:24:04,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316932299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:24:04,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757305018] [2022-11-20 11:24:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:04,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:24:04,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:24:04,711 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:24:04,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 11:24:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:05,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-20 11:24:05,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:05,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:24:05,456 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:24:05,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:24:05,640 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-20 11:24:05,789 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:05,790 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-20 11:24:06,036 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:06,037 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-20 11:24:06,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:06,136 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-20 11:24:06,351 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:24:06,351 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-20 11:24:06,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:24:06,642 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-20 11:24:06,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:06,711 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:24:06,712 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-20 11:24:06,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:06,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:24:06,768 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-20 11:24:06,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-20 11:24:06,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:24:07,090 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:24:07,090 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-20 11:24:07,273 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-20 11:24:07,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:24:07,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757305018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:24:07,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:24:07,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2022-11-20 11:24:07,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871071576] [2022-11-20 11:24:07,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:24:07,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-20 11:24:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:07,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-20 11:24:07,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2083, Unknown=1, NotChecked=92, Total=2352 [2022-11-20 11:24:07,489 INFO L87 Difference]: Start difference. First operand 104 states and 111 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-20 11:24:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:09,034 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-11-20 11:24:09,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:24:09,035 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-20 11:24:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:09,036 INFO L225 Difference]: With dead ends: 103 [2022-11-20 11:24:09,036 INFO L226 Difference]: Without dead ends: 103 [2022-11-20 11:24:09,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=257, Invalid=2716, Unknown=1, NotChecked=106, Total=3080 [2022-11-20 11:24:09,038 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 47 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:09,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1144 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 915 Invalid, 0 Unknown, 210 Unchecked, 1.0s Time] [2022-11-20 11:24:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-20 11:24:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-20 11:24:09,041 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-20 11:24:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-11-20 11:24:09,042 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 53 [2022-11-20 11:24:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:09,042 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-11-20 11:24:09,043 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-20 11:24:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-11-20 11:24:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 11:24:09,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:09,044 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-20 11:24:09,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:09,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 11:24:09,251 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-20 11:24:09,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 512975502, now seen corresponding path program 1 times [2022-11-20 11:24:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:09,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104810105] [2022-11-20 11:24:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:09,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:11,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:24:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:11,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:24:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:11,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:24:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:13,152 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-20 11:24:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:13,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104810105] [2022-11-20 11:24:13,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104810105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:24:13,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330398110] [2022-11-20 11:24:13,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:13,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:24:13,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:24:13,159 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:24:13,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 11:24:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:13,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-20 11:24:13,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:13,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:24:14,133 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:24:14,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:24:14,361 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-20 11:24:14,388 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-20 11:24:14,565 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:14,566 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-20 11:24:14,573 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-20 11:24:14,889 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:14,889 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-20 11:24:14,898 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-20 11:24:15,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:15,043 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-20 11:24:15,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:15,051 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-20 11:24:15,346 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:24:15,347 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-20 11:24:15,359 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-20 11:24:15,710 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-20 11:24:15,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:15,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:15,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:15,782 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-20 11:24:15,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:15,805 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:24:15,805 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-20 11:24:15,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:15,814 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-20 11:24:15,870 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:24:15,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 11:24:16,276 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-20 11:24:16,276 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-20 11:24:16,288 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:24:16,289 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-20 11:24:16,454 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-20 11:24:16,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:24:17,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330398110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:24:17,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:24:17,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2022-11-20 11:24:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291586844] [2022-11-20 11:24:17,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:24:17,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 11:24:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:17,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 11:24:17,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3013, Unknown=1, NotChecked=110, Total=3306 [2022-11-20 11:24:17,248 INFO L87 Difference]: Start difference. First operand 103 states and 110 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-20 11:24:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:21,388 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-11-20 11:24:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 11:24:21,389 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-20 11:24:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:21,389 INFO L225 Difference]: With dead ends: 102 [2022-11-20 11:24:21,390 INFO L226 Difference]: Without dead ends: 102 [2022-11-20 11:24:21,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=339, Invalid=4494, Unknown=1, NotChecked=136, Total=4970 [2022-11-20 11:24:21,392 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 158 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:21,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1347 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1898 Invalid, 0 Unknown, 213 Unchecked, 2.0s Time] [2022-11-20 11:24:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-20 11:24:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-20 11:24:21,395 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-20 11:24:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-11-20 11:24:21,396 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 53 [2022-11-20 11:24:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:21,396 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-11-20 11:24:21,396 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-20 11:24:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-11-20 11:24:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 11:24:21,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:21,397 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] [2022-11-20 11:24:21,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:21,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 11:24:21,605 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-20 11:24:21,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:21,605 INFO L85 PathProgramCache]: Analyzing trace with hash -951779474, now seen corresponding path program 1 times [2022-11-20 11:24:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:21,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470839474] [2022-11-20 11:24:21,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:21,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:21,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:24:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:21,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:24:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:21,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:24:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-20 11:24:21,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:21,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470839474] [2022-11-20 11:24:21,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470839474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:21,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:21,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:24:21,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202650563] [2022-11-20 11:24:21,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:21,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:24:21,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:24:21,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:24:21,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:21,767 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-20 11:24:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:21,910 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-11-20 11:24:21,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:24:21,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 55 [2022-11-20 11:24:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:21,912 INFO L225 Difference]: With dead ends: 119 [2022-11-20 11:24:21,912 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 11:24:21,912 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-20 11:24:21,913 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 160 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:21,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 171 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:24:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 11:24:21,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2022-11-20 11:24:21,915 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-20 11:24:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2022-11-20 11:24:21,916 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 55 [2022-11-20 11:24:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:21,916 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2022-11-20 11:24:21,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-20 11:24:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-11-20 11:24:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 11:24:21,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:21,917 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-20 11:24:21,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 11:24:21,917 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-20 11:24:21,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash 167962770, now seen corresponding path program 1 times [2022-11-20 11:24:21,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:24:21,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713819457] [2022-11-20 11:24:21,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:24:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:24:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:24,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:24:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:24,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:24:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:25,407 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-20 11:24:25,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:24:25,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713819457] [2022-11-20 11:24:25,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713819457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:24:25,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794014479] [2022-11-20 11:24:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:25,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:24:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:24:25,411 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:24:25,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 11:24:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:25,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-20 11:24:25,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:25,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:24:25,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:24:26,037 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:24:26,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:24:26,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:24:26,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:26,479 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:24:26,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-20 11:24:26,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:24:26,917 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:26,917 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-20 11:24:27,212 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:27,213 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-20 11:24:27,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:27,353 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-20 11:24:27,678 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:24:27,679 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-20 11:24:27,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:27,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 11:24:27,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:24:40,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:40,221 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 11:24:40,222 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-20 11:24:40,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:40,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:40,386 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:24:40,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 11:24:40,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:40,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-20 11:24:42,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:24:47,811 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:24:47,811 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-20 11:24:47,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-20 11:24:48,798 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:48,798 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-20 11:24:49,070 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:49,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-20 11:24:49,582 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-20 11:24:50,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-20 11:24:50,150 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-20 11:24:50,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:24:50,225 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4419 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4419) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-20 11:24:53,306 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4416 (Array Int Int)) (v_ArrVal_4418 (Array Int Int)) (v_ArrVal_4419 (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_4416) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4418) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4419) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-20 11:24:55,348 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4416 (Array Int Int)) (v_ArrVal_4418 (Array Int Int)) (v_ArrVal_4419 (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_4416) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4418) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_4419) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-20 11:24:55,399 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-20 11:24:55,399 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-20 11:25:05,678 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base_33| Int) (v_ArrVal_4416 (Array Int Int)) (v_ArrVal_4428 (Array Int Int)) (v_ArrVal_4429 (Array Int Int)) (v_ArrVal_4418 (Array Int Int)) (|v_node_create_~temp~0#1.base_64| Int) (v_ArrVal_4419 (Array Int Int))) (or (< |v_node_create_~temp~0#1.base_64| |v_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base_33|) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_64| v_ArrVal_4429))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (= (select (select (store (store (store .cse0 .cse1 v_ArrVal_4416) |v_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base_33| v_ArrVal_4418) (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_64| v_ArrVal_4428) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) v_ArrVal_4419) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1))) (not (< |v_node_create_~temp~0#1.base_64| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_64|) 0)))) is different from false [2022-11-20 11:25:05,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794014479] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:05,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:25:05,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 61 [2022-11-20 11:25:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622078435] [2022-11-20 11:25:05,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:05,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-20 11:25:05,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:05,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-20 11:25:05,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=4235, Unknown=94, NotChecked=540, Total=5112 [2022-11-20 11:25:05,686 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-20 11:25:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:41,614 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2022-11-20 11:25:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 11:25:41,614 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-20 11:25:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:41,616 INFO L225 Difference]: With dead ends: 225 [2022-11-20 11:25:41,617 INFO L226 Difference]: Without dead ends: 225 [2022-11-20 11:25:41,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1667 ImplicationChecksByTransitivity, 55.9s TimeCoverageRelationStatistics Valid=657, Invalid=7097, Unknown=94, NotChecked=708, Total=8556 [2022-11-20 11:25:41,620 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 906 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:41,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 1724 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 3108 Invalid, 0 Unknown, 72 Unchecked, 16.6s Time] [2022-11-20 11:25:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-20 11:25:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 104. [2022-11-20 11:25:41,626 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-20 11:25:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2022-11-20 11:25:41,627 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 57 [2022-11-20 11:25:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:41,627 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2022-11-20 11:25:41,627 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-20 11:25:41,628 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2022-11-20 11:25:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 11:25:41,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:41,629 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-20 11:25:41,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:41,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 11:25:41,836 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-20 11:25:41,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:41,836 INFO L85 PathProgramCache]: Analyzing trace with hash 167962771, now seen corresponding path program 1 times [2022-11-20 11:25:41,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:41,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406247254] [2022-11-20 11:25:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:41,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:50,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:25:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:51,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:25:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:53,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:25:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:25:56,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:56,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406247254] [2022-11-20 11:25:56,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406247254] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:25:56,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092308236] [2022-11-20 11:25:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:56,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:25:56,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:56,872 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:25:56,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 11:25:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:57,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-20 11:25:57,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:57,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:25:57,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:25:58,912 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:25:58,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:25:59,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:26:01,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:01,654 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:26:01,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-20 11:26:03,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:26:03,935 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:26:03,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2022-11-20 11:26:05,551 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:26:05,551 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-20 11:26:06,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:06,200 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-20 11:26:07,643 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:26:07,643 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-20 11:26:07,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:26:07,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:07,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 11:26:07,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:26:11,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:11,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:26:11,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:11,100 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:26:11,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 63 [2022-11-20 11:26:11,235 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 11:26:11,235 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 26 [2022-11-20 11:26:11,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:11,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:11,402 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:26:11,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 11:26:17,081 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:26:17,082 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 102 treesize of output 73 [2022-11-20 11:26:17,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:17,121 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-20 11:26:17,137 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-20 11:26:17,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:17,885 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 41 treesize of output 37 [2022-11-20 11:26:18,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:18,005 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-20 11:26:18,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:18,055 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 41 treesize of output 37 [2022-11-20 11:26:18,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:26:18,089 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-20 11:26:18,741 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-20 11:26:18,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:26:19,540 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 34 treesize of output 18 [2022-11-20 11:26:19,555 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 24 treesize of output 10 [2022-11-20 11:26:19,597 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-20 11:26:19,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:26:22,532 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4731 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int)) (<= 0 (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4731))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4730 (Array Int Int)) (v_ArrVal_4731 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int) (v_ArrVal_4734 (Array Int Int))) (<= (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4731))) (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4730) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-20 11:26:30,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092308236] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:30,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:26:30,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 66 [2022-11-20 11:26:30,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794274333] [2022-11-20 11:26:30,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:26:30,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-20 11:26:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:30,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-20 11:26:30,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=5852, Unknown=46, NotChecked=154, Total=6320 [2022-11-20 11:26:30,288 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 67 states, 62 states have (on average 1.596774193548387) internal successors, (99), 58 states have internal predecessors, (99), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 11:26:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:56,422 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-11-20 11:26:56,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 11:26:56,423 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 62 states have (on average 1.596774193548387) internal successors, (99), 58 states have internal predecessors, (99), 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 57 [2022-11-20 11:26:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:56,424 INFO L225 Difference]: With dead ends: 110 [2022-11-20 11:26:56,425 INFO L226 Difference]: Without dead ends: 110 [2022-11-20 11:26:56,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=514, Invalid=9141, Unknown=51, NotChecked=194, Total=9900 [2022-11-20 11:26:56,429 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 167 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 2141 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:56,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1436 Invalid, 2423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2141 Invalid, 0 Unknown, 205 Unchecked, 11.2s Time] [2022-11-20 11:26:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-20 11:26:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2022-11-20 11:26:56,437 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-20 11:26:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-11-20 11:26:56,439 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 57 [2022-11-20 11:26:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:56,439 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-11-20 11:26:56,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 62 states have (on average 1.596774193548387) internal successors, (99), 58 states have internal predecessors, (99), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 11:26:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-11-20 11:26:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 11:26:56,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:56,441 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-20 11:26:56,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 11:26:56,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 11:26:56,651 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-20 11:26:56,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560249, now seen corresponding path program 1 times [2022-11-20 11:26:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:26:56,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375841444] [2022-11-20 11:26:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:26:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:26:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:57,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:26:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:57,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:26:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:57,527 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-20 11:26:57,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:26:57,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375841444] [2022-11-20 11:26:57,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375841444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:26:57,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075685884] [2022-11-20 11:26:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:57,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:26:57,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:26:57,530 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:26:57,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 11:26:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:57,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-20 11:26:57,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:58,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:26:59,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:26:59,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 11:26:59,745 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-20 11:26:59,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:26:59,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075685884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:26:59,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:26:59,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 17 [2022-11-20 11:26:59,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230664011] [2022-11-20 11:26:59,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:26:59,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:26:59,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:26:59,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:26:59,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:26:59,748 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-20 11:27:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:02,639 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-11-20 11:27:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:27:02,639 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-20 11:27:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:02,641 INFO L225 Difference]: With dead ends: 167 [2022-11-20 11:27:02,641 INFO L226 Difference]: Without dead ends: 167 [2022-11-20 11:27:02,641 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-20 11:27:02,642 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 251 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:02,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 551 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-20 11:27:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-20 11:27:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 107. [2022-11-20 11:27:02,646 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-20 11:27:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2022-11-20 11:27:02,647 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 58 [2022-11-20 11:27:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:02,648 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2022-11-20 11:27:02,648 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-20 11:27:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2022-11-20 11:27:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 11:27:02,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:02,649 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-20 11:27:02,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 11:27:02,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:27:02,858 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-20 11:27:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560248, now seen corresponding path program 1 times [2022-11-20 11:27:02,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:27:02,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260660006] [2022-11-20 11:27:02,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:02,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:27:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:03,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:27:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:03,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:27:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:27:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:03,678 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-20 11:27:03,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:27:03,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260660006] [2022-11-20 11:27:03,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260660006] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:27:03,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922115582] [2022-11-20 11:27:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:03,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:27:03,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:27:03,681 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:27:03,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 11:27:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:04,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 11:27:04,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:04,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:27:04,248 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_5288 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5288))))) is different from true [2022-11-20 11:27:04,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:27:04,488 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5289 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5289))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-20 11:27:04,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:27:04,778 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5290 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5290))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-20 11:27:04,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:27:04,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:27:05,110 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:27:05,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 11:27:05,144 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-20 11:27:05,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:27:07,772 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-20 11:27:07,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922115582] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:27:07,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:27:07,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2022-11-20 11:27:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805526459] [2022-11-20 11:27:07,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:27:07,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:27:07,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:27:07,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:27:07,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2022-11-20 11:27:07,775 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-20 11:27:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:09,043 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-20 11:27:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:27:09,044 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-20 11:27:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:09,045 INFO L225 Difference]: With dead ends: 82 [2022-11-20 11:27:09,045 INFO L226 Difference]: Without dead ends: 82 [2022-11-20 11:27:09,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=112, Invalid=277, Unknown=3, NotChecked=114, Total=506 [2022-11-20 11:27:09,046 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 366 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:09,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 180 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 125 Invalid, 0 Unknown, 228 Unchecked, 0.7s Time] [2022-11-20 11:27:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-20 11:27:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-20 11:27:09,050 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-20 11:27:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-11-20 11:27:09,051 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 58 [2022-11-20 11:27:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:09,051 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-11-20 11:27:09,052 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-20 11:27:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-11-20 11:27:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 11:27:09,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:09,053 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-20 11:27:09,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-20 11:27:09,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:27:09,261 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-20 11:27:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:09,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1796531691, now seen corresponding path program 1 times [2022-11-20 11:27:09,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:27:09,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617627329] [2022-11-20 11:27:09,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:09,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:27:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:18,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:27:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:19,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:27:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:21,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:27:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:24,010 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-20 11:27:24,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:27:24,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617627329] [2022-11-20 11:27:24,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617627329] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:27:24,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896880569] [2022-11-20 11:27:24,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:24,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:27:24,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:27:24,015 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:27:24,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 11:27:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:24,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 159 conjunts are in the unsatisfiable core [2022-11-20 11:27:24,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:24,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:27:24,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-20 11:27:26,171 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:27:26,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:27:27,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:27:27,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:27:29,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:29,122 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:27:29,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-20 11:27:30,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:27:30,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 11:27:31,392 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:27:31,392 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-20 11:27:31,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 11:27:33,035 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:27:33,036 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-20 11:27:33,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 11:27:33,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:33,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:27:33,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:33,765 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-20 11:27:35,195 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:27:35,196 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-20 11:27:35,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:35,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 11:27:35,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:27:35,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-20 11:27:37,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:37,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-20 11:27:37,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:37,994 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 11:27:37,994 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 60 [2022-11-20 11:27:38,126 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-20 11:27:38,127 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 20 treesize of output 23 [2022-11-20 11:27:38,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:27:38,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:38,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:38,295 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:27:38,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 11:27:43,787 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:27:43,787 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-20 11:27:43,816 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-20 11:27:43,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:43,836 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-20 11:27:43,851 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-20 11:27:44,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:44,529 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-20 11:27:44,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:44,576 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-20 11:27:44,602 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-20 11:27:44,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:44,737 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-20 11:27:44,764 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-20 11:27:44,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:44,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:27:45,349 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-20 11:27:45,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 11:27:45,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:27:45,962 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-20 11:27:45,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:27:46,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:27:47,428 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-20 11:27:47,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:27:48,771 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5617 (Array Int Int)) (v_ArrVal_5616 (Array Int Int)) (v_ArrVal_5618 (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_5616) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5618) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5617) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-20 11:28:45,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896880569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:28:45,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:28:45,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 70 [2022-11-20 11:28:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398765982] [2022-11-20 11:28:45,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:28:45,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-20 11:28:45,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:28:45,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-20 11:28:45,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=6043, Unknown=282, NotChecked=160, Total=6806 [2022-11-20 11:28:45,251 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 70 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 61 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 11:29:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:29:21,857 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2022-11-20 11:29:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 11:29:21,857 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 61 states have internal predecessors, (100), 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-20 11:29:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:29:21,858 INFO L225 Difference]: With dead ends: 101 [2022-11-20 11:29:21,858 INFO L226 Difference]: Without dead ends: 101 [2022-11-20 11:29:21,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2601 ImplicationChecksByTransitivity, 107.5s TimeCoverageRelationStatistics Valid=787, Invalid=9850, Unknown=287, NotChecked=206, Total=11130 [2022-11-20 11:29:21,860 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 682 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:29:21,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1118 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2022-11-20 11:29:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-20 11:29:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2022-11-20 11:29:21,863 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-20 11:29:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-20 11:29:21,864 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 59 [2022-11-20 11:29:21,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:29:21,865 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-20 11:29:21,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 61 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 11:29:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-20 11:29:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 11:29:21,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:29:21,866 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-20 11:29:21,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 11:29:22,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:22,073 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-20 11:29:22,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:29:22,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535007, now seen corresponding path program 1 times [2022-11-20 11:29:22,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:29:22,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041253919] [2022-11-20 11:29:22,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:22,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:29:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:30,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:29:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:31,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:29:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:32,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:29:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:34,141 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-20 11:29:34,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:29:34,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041253919] [2022-11-20 11:29:34,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041253919] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:29:34,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548659872] [2022-11-20 11:29:34,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:29:34,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:29:34,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:29:34,143 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:29:34,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 11:29:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:29:34,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-20 11:29:34,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:29:34,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:29:34,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:29:36,029 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:29:36,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:29:37,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:29:38,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:38,327 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:29:38,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-20 11:29:39,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:29:40,441 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:29:40,442 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-20 11:29:41,869 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:29:41,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 11:29:42,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:42,552 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-20 11:29:44,085 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:29:44,085 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-20 11:29:44,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:44,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 11:29:44,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:29:47,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:47,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:29:47,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:47,525 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:29:47,526 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-20 11:29:47,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:47,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:47,792 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-20 11:29:47,793 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-20 11:29:54,141 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-20 11:29:54,141 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-20 11:29:54,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:54,258 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-20 11:29:54,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:54,992 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-20 11:29:55,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:55,072 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:29:55,073 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-20 11:29:55,360 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 11:29:55,360 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-20 11:29:55,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:29:55,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 11:29:56,205 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:29:56,205 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-20 11:29:56,268 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-20 11:29:57,163 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-20 11:29:58,820 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:29:58,821 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-20 11:30:00,351 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-20 11:30:00,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:30:00,481 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5938))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-20 11:30:00,518 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (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_5935) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5938))) (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_5936) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-20 11:30:02,154 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5931 (Array Int Int)) (v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (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_5935) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5938))) (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_5931) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5936) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-20 11:30:04,062 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5931 (Array Int Int)) (v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse2 (select .cse1 |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_~last~1#1.base| (store .cse1 |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_5935) .cse2 v_ArrVal_5938))) (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_~last~1#1.base| v_ArrVal_5931) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5936) .cse2 v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1)) is different from false [2022-11-20 11:30:06,086 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5931 (Array Int Int)) (v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (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_5935) .cse2 v_ArrVal_5938))) (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_5931) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5936) .cse2 v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1)) is different from false [2022-11-20 11:30:06,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5931 (Array Int Int)) (v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (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_5935) .cse4 v_ArrVal_5938))) (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_5931) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5936) .cse4 v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) 1)) is different from false [2022-11-20 11:30:08,158 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5931 (Array Int Int)) (v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (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_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5935) .cse4 v_ArrVal_5938))) (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_5931) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5936) .cse4 v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) 1)) is different from false [2022-11-20 11:30:09,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548659872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:09,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:30:09,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 70 [2022-11-20 11:30:09,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179547358] [2022-11-20 11:30:09,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:30:09,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-20 11:30:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:09,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-20 11:30:09,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=5053, Unknown=105, NotChecked=1050, Total=6480 [2022-11-20 11:30:09,338 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-20 11:30:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:30:24,509 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-11-20 11:30:24,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 11:30:24,510 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-20 11:30:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:30:24,511 INFO L225 Difference]: With dead ends: 86 [2022-11-20 11:30:24,511 INFO L226 Difference]: Without dead ends: 86 [2022-11-20 11:30:24,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 42.0s TimeCoverageRelationStatistics Valid=426, Invalid=6974, Unknown=110, NotChecked=1232, Total=8742 [2022-11-20 11:30:24,514 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 61 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:30:24,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1136 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1604 Invalid, 0 Unknown, 65 Unchecked, 8.2s Time] [2022-11-20 11:30:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-20 11:30:24,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-20 11:30:24,517 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-20 11:30:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-11-20 11:30:24,518 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 63 [2022-11-20 11:30:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:30:24,519 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-11-20 11:30:24,519 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-20 11:30:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-11-20 11:30:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 11:30:24,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:30:24,520 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-20 11:30:24,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:24,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-20 11:30:24,729 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-20 11:30:24,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:24,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535006, now seen corresponding path program 1 times [2022-11-20 11:30:24,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:24,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048279852] [2022-11-20 11:30:24,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:24,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:30:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:30:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:34,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:30:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:37,063 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-20 11:30:37,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:37,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048279852] [2022-11-20 11:30:37,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048279852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:37,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912601474] [2022-11-20 11:30:37,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:37,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:37,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:37,066 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:37,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 11:30:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:37,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 152 conjunts are in the unsatisfiable core [2022-11-20 11:30:37,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:37,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:30:37,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:30:38,858 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:30:38,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:30:39,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:30:41,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:41,191 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:30:41,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-20 11:30:42,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:30:43,194 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:30:43,195 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-20 11:30:44,592 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:30:44,592 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-20 11:30:45,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:45,228 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-20 11:30:46,621 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:30:46,621 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-20 11:30:46,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:46,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 11:30:46,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:30:47,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:30:50,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:50,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:30:50,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:50,452 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:30:50,452 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-20 11:30:50,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:50,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:50,621 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:30:50,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 11:30:56,641 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-20 11:30:56,641 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-20 11:30:56,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:56,685 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-20 11:30:57,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:57,528 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:30:57,528 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-20 11:30:57,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:57,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:57,567 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-20 11:30:57,819 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 11:30:57,819 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 111 treesize of output 84 [2022-11-20 11:30:57,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:57,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:57,869 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 33 treesize of output 38 [2022-11-20 11:30:58,702 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:30:58,703 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 89 treesize of output 71 [2022-11-20 11:30:58,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:30:58,757 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 25 treesize of output 30 [2022-11-20 11:31:01,349 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-20 11:31:01,349 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 93 treesize of output 47 [2022-11-20 11:31:02,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:31:02,900 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:31:02,900 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 26 treesize of output 16 [2022-11-20 11:31:03,540 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-20 11:31:03,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:31:06,931 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6254 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6254))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6255 (Array Int Int))) (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6255) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1) 8))) (not (<= 0 .cse1)))))) (forall ((v_ArrVal_6254 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6254))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6255 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6255))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse2 .cse3) .cse4) 12) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))) (not (<= 0 .cse4))))))) is different from false [2022-11-20 11:31:08,605 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (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|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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.offset|)))) (and (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6254))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6255 (Array Int Int))) (<= 0 (+ 8 (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6255) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))))))) (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse5 (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6254))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (forall ((v_ArrVal_6255 (Array Int Int))) (let ((.cse7 (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6255))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse5 .cse6) .cse4)) (select |c_#length| (select (select .cse7 .cse6) .cse4)))))))))))) is different from false [2022-11-20 11:31:08,818 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (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|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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.offset|)))) (and (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_6254))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6255 (Array Int Int))) (<= 0 (+ (select (select .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_6255) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2) 8))) (not (<= 0 .cse2)))))) (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse5 (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_6254))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (forall ((v_ArrVal_6255 (Array Int Int))) (let ((.cse7 (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_6255))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse5 .cse6) .cse4) 12) (select |c_#length| (select (select .cse7 .cse6) .cse4)))))))))))) is different from false [2022-11-20 11:31:08,907 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (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|))) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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.offset|))) (.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|))) (and (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) .cse2 v_ArrVal_6254))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6255 (Array Int Int))) (<= 0 (+ (select (select .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) .cse2 v_ArrVal_6255) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3) 8))) (not (<= 0 .cse3)))))) (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse5 (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) .cse2 v_ArrVal_6254))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6255 (Array Int Int))) (let ((.cse8 (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) .cse2 v_ArrVal_6255))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse5 .cse6) .cse7) 12) (select |c_#length| (select (select .cse8 .cse6) .cse7)))))) (not (<= 0 .cse7)))))))) is different from false [2022-11-20 11:31:10,447 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse3 (select .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset|))) (and (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) .cse3 v_ArrVal_6254))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6255 (Array Int Int))) (<= 0 (+ (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) .cse3 v_ArrVal_6255) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0) 8))))))) (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse6 (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) .cse3 v_ArrVal_6254))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse5)) (forall ((v_ArrVal_6255 (Array Int Int))) (let ((.cse8 (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) .cse3 v_ArrVal_6255))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse6 .cse7) .cse5) 12) (select |c_#length| (select (select .cse8 .cse7) .cse5))))))))))))) is different from false [2022-11-20 11:31:12,133 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse11)) (.cse10 (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 (store |c_#memory_$Pointer$.base| .cse11 (store .cse9 .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse4 (store |c_#memory_$Pointer$.offset| .cse11 (store (select |c_#memory_$Pointer$.offset| .cse11) .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))) (.cse3 (select .cse9 .cse10))) (and (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6252) .cse3 v_ArrVal_6254))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6255 (Array Int Int))) (<= 0 (+ 8 (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6253) .cse3 v_ArrVal_6255) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))))))) (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse6 (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6252) .cse3 v_ArrVal_6254))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse5)) (forall ((v_ArrVal_6255 (Array Int Int))) (let ((.cse8 (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6253) .cse3 v_ArrVal_6255))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse6 .cse7) .cse5)) (select |c_#length| (select (select .cse8 .cse7) .cse5)))))))))))))) is different from false [2022-11-20 11:31:12,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1357 treesize of output 1157 [2022-11-20 11:31:15,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912601474] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:31:15,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:31:15,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 71 [2022-11-20 11:31:15,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102487685] [2022-11-20 11:31:15,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:31:15,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-20 11:31:15,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-20 11:31:15,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=6210, Unknown=21, NotChecked=978, Total=7482 [2022-11-20 11:31:15,343 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-20 11:31:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:31:47,773 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-11-20 11:31:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 11:31:47,774 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-20 11:31:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:31:47,776 INFO L225 Difference]: With dead ends: 119 [2022-11-20 11:31:47,776 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 11:31:47,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1765 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=668, Invalid=9235, Unknown=21, NotChecked=1206, Total=11130 [2022-11-20 11:31:47,779 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 312 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:31:47,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1491 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2179 Invalid, 0 Unknown, 116 Unchecked, 11.2s Time] [2022-11-20 11:31:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 11:31:47,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 88. [2022-11-20 11:31:47,782 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-20 11:31:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-11-20 11:31:47,783 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 63 [2022-11-20 11:31:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:31:47,783 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-11-20 11:31:47,784 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-20 11:31:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-11-20 11:31:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 11:31:47,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:31:47,785 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-20 11:31:47,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 11:31:47,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-20 11:31:47,993 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-20 11:31:47,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:31:47,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1257988692, now seen corresponding path program 1 times [2022-11-20 11:31:47,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:31:47,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676328491] [2022-11-20 11:31:47,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:47,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:55,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:31:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:31:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:57,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:31:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:59,950 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-20 11:31:59,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:59,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676328491] [2022-11-20 11:31:59,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676328491] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:31:59,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117480895] [2022-11-20 11:31:59,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:59,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:31:59,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:31:59,952 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:31:59,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 11:32:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:32:00,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-20 11:32:00,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:32:00,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:32:00,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:32:01,742 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:32:01,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:32:02,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:32:03,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:03,746 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:32:03,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-20 11:32:04,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:32:05,611 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:32:05,611 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-20 11:32:06,988 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:32:06,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 11:32:07,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:07,601 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-20 11:32:08,986 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:32:08,987 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-20 11:32:09,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:09,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 11:32:09,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:32:11,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:11,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-20 11:32:11,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:11,622 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 11:32:11,623 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-20 11:32:11,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:11,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:11,774 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:32:11,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 11:32:16,884 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-20 11:32:16,884 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-20 11:32:16,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:16,926 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-20 11:32:17,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:17,639 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:32:17,640 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-20 11:32:17,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:17,702 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-20 11:32:17,872 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 11:32:17,873 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-20 11:32:17,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:32:17,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 11:32:18,592 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:32:18,592 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-20 11:32:18,618 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-20 11:32:19,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 15 treesize of output 7 [2022-11-20 11:32:21,755 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:32:21,756 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-20 11:32:21,766 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-20 11:32:21,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:32:21,873 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6571 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6572))) (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 |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-20 11:32:23,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6564 (Array Int Int)) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6570 (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_6570) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6572))) (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_6564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6569) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-20 11:32:24,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6564 (Array Int Int)) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6570 (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 ((.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_6570) .cse2 v_ArrVal_6572))) (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_6564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6569) .cse2 v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-20 11:32:24,129 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6564 (Array Int Int)) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6570 (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 ((.cse1 (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_6570) .cse2 v_ArrVal_6572))) (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_~last~1#1.base| v_ArrVal_6564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6569) .cse2 v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2022-11-20 11:32:24,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6564 (Array Int Int)) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6570 (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_6570) .cse2 v_ArrVal_6572))) (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_6564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6569) .cse2 v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2022-11-20 11:32:24,210 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6564 (Array Int Int)) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6570 (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_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6570) .cse3 v_ArrVal_6572))) (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_6564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6569) .cse3 v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))))) is different from false [2022-11-20 11:32:26,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117480895] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:32:26,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:32:26,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 70 [2022-11-20 11:32:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838567004] [2022-11-20 11:32:26,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:32:26,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-20 11:32:26,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:32:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-20 11:32:26,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=5042, Unknown=121, NotChecked=894, Total=6320 [2022-11-20 11:32:26,355 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 70 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 61 states have internal predecessors, (107), 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-20 11:32:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:32:56,593 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-11-20 11:32:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 11:32:56,594 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 61 states have internal predecessors, (107), 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 64 [2022-11-20 11:32:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:32:56,595 INFO L225 Difference]: With dead ends: 109 [2022-11-20 11:32:56,595 INFO L226 Difference]: Without dead ends: 109 [2022-11-20 11:32:56,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=700, Invalid=8132, Unknown=122, NotChecked=1146, Total=10100 [2022-11-20 11:32:56,596 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 942 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:32:56,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1186 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2022-11-20 11:32:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-20 11:32:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2022-11-20 11:32:56,600 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-20 11:32:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-20 11:32:56,601 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 64 [2022-11-20 11:32:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:32:56,601 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-20 11:32:56,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 61 states have internal predecessors, (107), 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-20 11:32:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-20 11:32:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 11:32:56,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:32:56,603 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-20 11:32:56,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 11:32:56,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-20 11:32:56,811 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-20 11:32:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:32:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash 342976484, now seen corresponding path program 1 times [2022-11-20 11:32:56,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:32:56,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886510838] [2022-11-20 11:32:56,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:32:56,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:32:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:10,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:33:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 11:33:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:12,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 11:33:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:33:15,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:33:15,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886510838] [2022-11-20 11:33:15,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886510838] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:33:15,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888588420] [2022-11-20 11:33:15,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:33:15,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:33:15,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:33:15,632 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:33:15,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5b2bbcb-cad2-4ea2-a0d1-a71124bf2955/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 11:33:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:33:16,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 168 conjunts are in the unsatisfiable core [2022-11-20 11:33:16,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:33:16,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:33:16,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:33:17,966 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:33:17,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:33:19,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:33:20,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:20,368 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:33:20,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-20 11:33:21,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:33:22,602 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:33:22,603 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-20 11:33:24,127 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:33:24,127 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-20 11:33:24,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:24,829 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-20 11:33:26,353 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:33:26,353 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-20 11:33:26,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:33:26,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:26,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 11:33:28,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:33:30,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:30,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 11:33:30,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:30,155 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:33:30,155 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-20 11:33:30,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:30,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:30,314 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 11:33:30,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 11:33:36,668 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-20 11:33:36,669 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 129 treesize of output 77 [2022-11-20 11:33:36,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:36,687 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-20 11:33:36,779 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 20 treesize of output 22 [2022-11-20 11:33:37,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:37,626 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:33:37,627 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-20 11:33:37,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:37,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:37,660 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-20 11:33:37,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:37,729 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 23 treesize of output 22 [2022-11-20 11:33:37,941 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 11:33:37,941 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 161 treesize of output 118 [2022-11-20 11:33:37,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:37,994 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 53 treesize of output 44 [2022-11-20 11:33:38,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:38,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:38,017 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 44 treesize of output 43 [2022-11-20 11:33:38,906 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:33:38,907 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 104 treesize of output 84 [2022-11-20 11:33:38,933 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 24 treesize of output 26 [2022-11-20 11:33:38,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:38,953 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 36 treesize of output 35 [2022-11-20 11:33:41,749 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-20 11:33:41,749 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 108 treesize of output 58 [2022-11-20 11:33:41,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:33:41,808 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:33:41,809 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 33 treesize of output 19 [2022-11-20 11:33:43,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:33:43,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:43,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-11-20 11:33:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:33:43,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:33:46,856 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6894 (Array Int Int)) (v_ArrVal_6893 (Array Int Int)) (v_ArrVal_6895 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6893)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6894))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6895) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 8)))))) is different from false [2022-11-20 11:33:57,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:57,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 482 treesize of output 473 [2022-11-20 11:33:57,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:33:57,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20178 treesize of output 19574 [2022-11-20 11:33:57,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24284 treesize of output 22668 [2022-11-20 11:33:57,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22668 treesize of output 19436 [2022-11-20 11:34:00,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1907 treesize of output 1503 [2022-11-20 11:34:19,755 WARN L233 SmtUtils]: Spent 18.97s on a formula simplification that was a NOOP. DAG size: 171 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-20 11:34:19,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:34:19,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 8726 treesize of output 10556