./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G --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 f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 12:23:06,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 12:23:06,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 12:23:06,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 12:23:06,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 12:23:06,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 12:23:06,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 12:23:06,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 12:23:06,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 12:23:06,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 12:23:06,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 12:23:06,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 12:23:06,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 12:23:06,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 12:23:06,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 12:23:06,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 12:23:06,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 12:23:06,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 12:23:06,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 12:23:06,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 12:23:06,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 12:23:06,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 12:23:06,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 12:23:06,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 12:23:06,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 12:23:06,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 12:23:06,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 12:23:06,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 12:23:06,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 12:23:06,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 12:23:06,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 12:23:06,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 12:23:06,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 12:23:06,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 12:23:06,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 12:23:06,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 12:23:06,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 12:23:06,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 12:23:06,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 12:23:06,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 12:23:06,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 12:23:06,316 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-23 12:23:06,348 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 12:23:06,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 12:23:06,349 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 12:23:06,349 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 12:23:06,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 12:23:06,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 12:23:06,351 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 12:23:06,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 12:23:06,352 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 12:23:06,353 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 12:23:06,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 12:23:06,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 12:23:06,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 12:23:06,354 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 12:23:06,354 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 12:23:06,355 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 12:23:06,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 12:23:06,355 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 12:23:06,356 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 12:23:06,356 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 12:23:06,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 12:23:06,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 12:23:06,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 12:23:06,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 12:23:06,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 12:23:06,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 12:23:06,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 12:23:06,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 12:23:06,359 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 12:23:06,360 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_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/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_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G 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 -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2021-11-23 12:23:06,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 12:23:06,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 12:23:06,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 12:23:06,728 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 12:23:06,730 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 12:23:06,732 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2021-11-23 12:23:06,834 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/data/4d20a791c/5b1a4bd962194d29a6e3e5d71b6ee2fb/FLAGe696edf93 [2021-11-23 12:23:07,478 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 12:23:07,479 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2021-11-23 12:23:07,496 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/data/4d20a791c/5b1a4bd962194d29a6e3e5d71b6ee2fb/FLAGe696edf93 [2021-11-23 12:23:07,763 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/data/4d20a791c/5b1a4bd962194d29a6e3e5d71b6ee2fb [2021-11-23 12:23:07,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 12:23:07,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 12:23:07,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 12:23:07,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 12:23:07,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 12:23:07,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:07" (1/1) ... [2021-11-23 12:23:07,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5248f85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:07, skipping insertion in model container [2021-11-23 12:23:07,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:07" (1/1) ... [2021-11-23 12:23:07,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 12:23:07,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 12:23:08,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 12:23:08,293 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 12:23:08,367 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 12:23:08,399 INFO L208 MainTranslator]: Completed translation [2021-11-23 12:23:08,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08 WrapperNode [2021-11-23 12:23:08,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 12:23:08,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 12:23:08,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 12:23:08,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 12:23:08,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08" (1/1) ... [2021-11-23 12:23:08,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08" (1/1) ... [2021-11-23 12:23:08,483 INFO L137 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 134 [2021-11-23 12:23:08,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 12:23:08,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 12:23:08,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 12:23:08,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 12:23:08,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08" (1/1) ... [2021-11-23 12:23:08,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08" (1/1) ... [2021-11-23 12:23:08,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08" (1/1) ... [2021-11-23 12:23:08,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08" (1/1) ... [2021-11-23 12:23:08,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08" (1/1) ... [2021-11-23 12:23:08,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08" (1/1) ... [2021-11-23 12:23:08,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08" (1/1) ... [2021-11-23 12:23:08,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 12:23:08,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 12:23:08,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 12:23:08,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 12:23:08,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08" (1/1) ... [2021-11-23 12:23:08,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 12:23:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:23:08,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 12:23:08,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 12:23:08,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 12:23:08,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 12:23:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 12:23:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 12:23:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 12:23:08,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 12:23:08,789 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 12:23:08,791 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 12:23:09,274 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 12:23:09,286 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 12:23:09,287 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 12:23:09,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:09 BoogieIcfgContainer [2021-11-23 12:23:09,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 12:23:09,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 12:23:09,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 12:23:09,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 12:23:09,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:23:07" (1/3) ... [2021-11-23 12:23:09,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e104a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:09, skipping insertion in model container [2021-11-23 12:23:09,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:08" (2/3) ... [2021-11-23 12:23:09,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e104a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:09, skipping insertion in model container [2021-11-23 12:23:09,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:09" (3/3) ... [2021-11-23 12:23:09,316 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2021-11-23 12:23:09,324 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 12:23:09,328 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2021-11-23 12:23:09,407 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 12:23:09,425 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 12:23:09,425 INFO L340 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2021-11-23 12:23:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 136 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-23 12:23:09,485 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:09,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-23 12:23:09,487 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2021-11-23 12:23:09,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:09,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443821579] [2021-11-23 12:23:09,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:09,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:09,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:09,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443821579] [2021-11-23 12:23:09,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443821579] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:09,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:09,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 12:23:09,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807182782] [2021-11-23 12:23:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:09,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 12:23:09,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:09,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 12:23:09,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 12:23:09,815 INFO L87 Difference]: Start difference. First operand has 137 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 136 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:10,010 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2021-11-23 12:23:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 12:23:10,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-23 12:23:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:10,034 INFO L225 Difference]: With dead ends: 134 [2021-11-23 12:23:10,035 INFO L226 Difference]: Without dead ends: 130 [2021-11-23 12:23:10,038 INFO L932 BasicCegarLoop]: 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 [2021-11-23 12:23:10,044 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 52 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:10,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 171 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 12:23:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-23 12:23:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-11-23 12:23:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 129 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2021-11-23 12:23:10,134 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 4 [2021-11-23 12:23:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:10,135 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2021-11-23 12:23:10,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2021-11-23 12:23:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-23 12:23:10,136 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:10,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-23 12:23:10,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 12:23:10,137 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:10,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:10,141 INFO L85 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2021-11-23 12:23:10,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:10,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507647188] [2021-11-23 12:23:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:10,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:10,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:10,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507647188] [2021-11-23 12:23:10,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507647188] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:10,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:10,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 12:23:10,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317139497] [2021-11-23 12:23:10,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:10,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 12:23:10,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:10,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 12:23:10,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 12:23:10,267 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:10,346 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2021-11-23 12:23:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 12:23:10,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-23 12:23:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:10,351 INFO L225 Difference]: With dead ends: 127 [2021-11-23 12:23:10,352 INFO L226 Difference]: Without dead ends: 127 [2021-11-23 12:23:10,353 INFO L932 BasicCegarLoop]: 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 [2021-11-23 12:23:10,356 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 128 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:10,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 117 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:23:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-23 12:23:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-11-23 12:23:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2021-11-23 12:23:10,393 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 4 [2021-11-23 12:23:10,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:10,393 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2021-11-23 12:23:10,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2021-11-23 12:23:10,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 12:23:10,395 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:10,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:10,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 12:23:10,396 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:10,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:10,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2097999444, now seen corresponding path program 1 times [2021-11-23 12:23:10,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:10,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705275625] [2021-11-23 12:23:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:10,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:10,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:10,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705275625] [2021-11-23 12:23:10,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705275625] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:10,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:10,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 12:23:10,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366019374] [2021-11-23 12:23:10,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:10,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 12:23:10,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:10,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 12:23:10,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 12:23:10,512 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:10,540 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2021-11-23 12:23:10,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 12:23:10,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-23 12:23:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:10,544 INFO L225 Difference]: With dead ends: 136 [2021-11-23 12:23:10,545 INFO L226 Difference]: Without dead ends: 136 [2021-11-23 12:23:10,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 12:23:10,551 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:10,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 254 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:23:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-11-23 12:23:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2021-11-23 12:23:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2021-11-23 12:23:10,572 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 9 [2021-11-23 12:23:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:10,573 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2021-11-23 12:23:10,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2021-11-23 12:23:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 12:23:10,575 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:10,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:10,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 12:23:10,576 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:10,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2098000980, now seen corresponding path program 1 times [2021-11-23 12:23:10,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:10,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738348506] [2021-11-23 12:23:10,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:10,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:10,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:10,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738348506] [2021-11-23 12:23:10,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738348506] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:10,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:10,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 12:23:10,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915381407] [2021-11-23 12:23:10,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:10,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 12:23:10,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:10,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 12:23:10,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 12:23:10,678 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:10,788 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2021-11-23 12:23:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 12:23:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-23 12:23:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:10,792 INFO L225 Difference]: With dead ends: 127 [2021-11-23 12:23:10,792 INFO L226 Difference]: Without dead ends: 127 [2021-11-23 12:23:10,793 INFO L932 BasicCegarLoop]: 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 [2021-11-23 12:23:10,801 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:10,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 12:23:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-11-23 12:23:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-11-23 12:23:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2021-11-23 12:23:10,814 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 9 [2021-11-23 12:23:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:10,815 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2021-11-23 12:23:10,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2021-11-23 12:23:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 12:23:10,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:10,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:10,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 12:23:10,817 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:10,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2098000981, now seen corresponding path program 1 times [2021-11-23 12:23:10,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:10,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302212110] [2021-11-23 12:23:10,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:10,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:10,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:10,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302212110] [2021-11-23 12:23:10,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302212110] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:10,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:10,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 12:23:10,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868365724] [2021-11-23 12:23:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:10,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 12:23:10,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:10,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 12:23:10,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 12:23:10,874 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:10,904 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2021-11-23 12:23:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 12:23:10,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-23 12:23:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:10,907 INFO L225 Difference]: With dead ends: 126 [2021-11-23 12:23:10,907 INFO L226 Difference]: Without dead ends: 126 [2021-11-23 12:23:10,908 INFO L932 BasicCegarLoop]: 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 [2021-11-23 12:23:10,909 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 122 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:10,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:23:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-11-23 12:23:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-11-23 12:23:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 125 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2021-11-23 12:23:10,919 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 9 [2021-11-23 12:23:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:10,919 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2021-11-23 12:23:10,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:10,920 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2021-11-23 12:23:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 12:23:10,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:10,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:10,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 12:23:10,922 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:10,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash 613520946, now seen corresponding path program 1 times [2021-11-23 12:23:10,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:10,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856491027] [2021-11-23 12:23:10,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:10,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:11,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:11,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856491027] [2021-11-23 12:23:11,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856491027] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:11,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:11,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 12:23:11,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300094746] [2021-11-23 12:23:11,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:11,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 12:23:11,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:11,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 12:23:11,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 12:23:11,023 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:11,171 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-11-23 12:23:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 12:23:11,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-23 12:23:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:11,173 INFO L225 Difference]: With dead ends: 130 [2021-11-23 12:23:11,173 INFO L226 Difference]: Without dead ends: 130 [2021-11-23 12:23:11,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-23 12:23:11,176 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:11,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 217 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 12:23:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-23 12:23:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2021-11-23 12:23:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.8) internal successors, (135), 128 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:11,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2021-11-23 12:23:11,203 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 10 [2021-11-23 12:23:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:11,203 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2021-11-23 12:23:11,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2021-11-23 12:23:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 12:23:11,205 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:11,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:11,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 12:23:11,206 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash 613520947, now seen corresponding path program 1 times [2021-11-23 12:23:11,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:11,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742892526] [2021-11-23 12:23:11,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:11,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:11,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:11,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742892526] [2021-11-23 12:23:11,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742892526] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:11,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:11,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 12:23:11,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356760821] [2021-11-23 12:23:11,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:11,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 12:23:11,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:11,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 12:23:11,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-23 12:23:11,389 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:11,651 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-11-23 12:23:11,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 12:23:11,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-23 12:23:11,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:11,654 INFO L225 Difference]: With dead ends: 130 [2021-11-23 12:23:11,654 INFO L226 Difference]: Without dead ends: 130 [2021-11-23 12:23:11,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-23 12:23:11,656 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 176 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:11,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 339 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:23:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-23 12:23:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2021-11-23 12:23:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2021-11-23 12:23:11,663 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 10 [2021-11-23 12:23:11,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:11,663 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2021-11-23 12:23:11,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2021-11-23 12:23:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 12:23:11,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:11,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:11,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 12:23:11,666 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1197790234, now seen corresponding path program 1 times [2021-11-23 12:23:11,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:11,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690738607] [2021-11-23 12:23:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:11,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:11,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:11,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690738607] [2021-11-23 12:23:11,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690738607] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:11,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:11,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 12:23:11,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353993180] [2021-11-23 12:23:11,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:11,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 12:23:11,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:11,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 12:23:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 12:23:11,793 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:11,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:11,860 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2021-11-23 12:23:11,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 12:23:11,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-23 12:23:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:11,863 INFO L225 Difference]: With dead ends: 128 [2021-11-23 12:23:11,863 INFO L226 Difference]: Without dead ends: 128 [2021-11-23 12:23:11,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 12:23:11,867 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 236 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:11,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 120 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:23:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-23 12:23:11,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2021-11-23 12:23:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.76) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2021-11-23 12:23:11,873 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 14 [2021-11-23 12:23:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:11,874 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2021-11-23 12:23:11,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2021-11-23 12:23:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 12:23:11,880 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:11,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:11,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 12:23:11,881 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:11,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1197790235, now seen corresponding path program 1 times [2021-11-23 12:23:11,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:11,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946157883] [2021-11-23 12:23:11,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:11,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:11,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:11,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946157883] [2021-11-23 12:23:11,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946157883] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:11,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:11,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 12:23:11,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754999083] [2021-11-23 12:23:11,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:11,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 12:23:11,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:11,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 12:23:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 12:23:11,967 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:12,084 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2021-11-23 12:23:12,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 12:23:12,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-23 12:23:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:12,086 INFO L225 Difference]: With dead ends: 125 [2021-11-23 12:23:12,087 INFO L226 Difference]: Without dead ends: 125 [2021-11-23 12:23:12,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 12:23:12,091 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 65 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:12,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 222 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 12:23:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-23 12:23:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2021-11-23 12:23:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 72 states have (on average 1.7638888888888888) internal successors, (127), 121 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2021-11-23 12:23:12,096 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 14 [2021-11-23 12:23:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:12,097 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2021-11-23 12:23:12,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2021-11-23 12:23:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 12:23:12,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:12,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:12,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 12:23:12,099 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash -780576785, now seen corresponding path program 1 times [2021-11-23 12:23:12,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:12,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635988857] [2021-11-23 12:23:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:12,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:12,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:12,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635988857] [2021-11-23 12:23:12,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635988857] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:12,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:12,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 12:23:12,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455384723] [2021-11-23 12:23:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:12,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 12:23:12,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:12,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 12:23:12,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 12:23:12,204 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:12,437 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2021-11-23 12:23:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 12:23:12,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-23 12:23:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:12,439 INFO L225 Difference]: With dead ends: 122 [2021-11-23 12:23:12,440 INFO L226 Difference]: Without dead ends: 122 [2021-11-23 12:23:12,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-23 12:23:12,441 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 107 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:12,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 325 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:23:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-11-23 12:23:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2021-11-23 12:23:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.7222222222222223) internal successors, (124), 118 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2021-11-23 12:23:12,447 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 17 [2021-11-23 12:23:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:12,448 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2021-11-23 12:23:12,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2021-11-23 12:23:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 12:23:12,450 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:12,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:12,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 12:23:12,451 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:12,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash -780576784, now seen corresponding path program 1 times [2021-11-23 12:23:12,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:12,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571304309] [2021-11-23 12:23:12,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:12,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:12,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:12,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571304309] [2021-11-23 12:23:12,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571304309] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:23:12,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877013825] [2021-11-23 12:23:12,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:12,528 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:23:12,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:23:12,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:23:12,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 12:23:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:12,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 12:23:12,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:23:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:12,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:23:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:12,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877013825] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:23:12,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:23:12,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-11-23 12:23:12,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950636209] [2021-11-23 12:23:12,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:23:12,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 12:23:12,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:12,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 12:23:12,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 12:23:12,862 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:12,875 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2021-11-23 12:23:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 12:23:12,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-23 12:23:12,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:12,878 INFO L225 Difference]: With dead ends: 124 [2021-11-23 12:23:12,879 INFO L226 Difference]: Without dead ends: 124 [2021-11-23 12:23:12,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 12:23:12,880 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:12,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 236 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:23:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-23 12:23:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-11-23 12:23:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 123 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2021-11-23 12:23:12,885 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 17 [2021-11-23 12:23:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:12,885 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2021-11-23 12:23:12,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2021-11-23 12:23:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 12:23:12,886 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:12,886 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:12,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 12:23:13,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-23 12:23:13,110 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2088887170, now seen corresponding path program 2 times [2021-11-23 12:23:13,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:13,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584872264] [2021-11-23 12:23:13,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:13,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 12:23:13,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:13,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584872264] [2021-11-23 12:23:13,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584872264] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:13,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:13,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 12:23:13,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329640845] [2021-11-23 12:23:13,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:13,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 12:23:13,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 12:23:13,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 12:23:13,212 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:13,375 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2021-11-23 12:23:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 12:23:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-23 12:23:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:13,376 INFO L225 Difference]: With dead ends: 117 [2021-11-23 12:23:13,377 INFO L226 Difference]: Without dead ends: 117 [2021-11-23 12:23:13,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-23 12:23:13,378 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 412 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:13,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 95 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 12:23:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-23 12:23:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-23 12:23:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 116 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2021-11-23 12:23:13,383 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 22 [2021-11-23 12:23:13,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:13,383 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2021-11-23 12:23:13,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:13,383 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2021-11-23 12:23:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 12:23:13,384 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:13,385 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:13,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 12:23:13,385 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1383417867, now seen corresponding path program 1 times [2021-11-23 12:23:13,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:13,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708058] [2021-11-23 12:23:13,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:13,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:13,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:13,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708058] [2021-11-23 12:23:13,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708058] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:23:13,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183495643] [2021-11-23 12:23:13,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:13,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:23:13,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:23:13,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:23:13,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 12:23:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:13,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-23 12:23:13,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:23:13,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:23:14,053 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-23 12:23:14,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 12:23:14,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:23:14,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2021-11-23 12:23:14,397 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-23 12:23:14,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2021-11-23 12:23:14,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:23:14,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 12:23:14,560 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-23 12:23:14,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 48 [2021-11-23 12:23:14,955 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-11-23 12:23:14,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 24 [2021-11-23 12:23:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:14,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:23:15,781 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2021-11-23 12:23:16,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2021-11-23 12:23:17,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2021-11-23 12:23:17,286 INFO L354 Elim1Store]: treesize reduction 72, result has 40.0 percent of original size [2021-11-23 12:23:17,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 72 treesize of output 60 [2021-11-23 12:23:17,305 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:23:17,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 76 [2021-11-23 12:23:17,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:23:17,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:23:17,580 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:23:17,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 23 [2021-11-23 12:23:17,669 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:23:17,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 99 [2021-11-23 12:23:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-23 12:23:18,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183495643] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:23:18,638 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:23:18,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 29 [2021-11-23 12:23:18,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623500124] [2021-11-23 12:23:18,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:23:18,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-23 12:23:18,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-23 12:23:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=613, Unknown=3, NotChecked=156, Total=870 [2021-11-23 12:23:18,643 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:32,685 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) (or (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_12| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_12|) 0)) (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (and (or .cse1 (= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) 0)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_12| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2021-11-23 12:23:33,368 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_12| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_12|) 0)) (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (and (or .cse0 (= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) 0)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_12| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0))) is different from false [2021-11-23 12:23:33,953 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_12| Int)) (or (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0))) (and (or (= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) 0) .cse0) (or .cse0 (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_12| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_12|) 0)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0))) is different from false [2021-11-23 12:23:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:34,102 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2021-11-23 12:23:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-23 12:23:34,103 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-23 12:23:34,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:34,104 INFO L225 Difference]: With dead ends: 130 [2021-11-23 12:23:34,104 INFO L226 Difference]: Without dead ends: 130 [2021-11-23 12:23:34,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=193, Invalid=1080, Unknown=11, NotChecked=438, Total=1722 [2021-11-23 12:23:34,105 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 103 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:34,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 1555 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 278 Invalid, 0 Unknown, 526 Unchecked, 0.2s Time] [2021-11-23 12:23:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-23 12:23:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2021-11-23 12:23:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 111 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2021-11-23 12:23:34,109 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 28 [2021-11-23 12:23:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:34,109 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2021-11-23 12:23:34,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2021-11-23 12:23:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 12:23:34,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:34,113 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:34,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 12:23:34,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-23 12:23:34,326 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:34,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:34,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1383419083, now seen corresponding path program 1 times [2021-11-23 12:23:34,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:34,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743126258] [2021-11-23 12:23:34,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:34,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 12:23:34,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:34,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743126258] [2021-11-23 12:23:34,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743126258] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:34,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:34,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 12:23:34,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829744996] [2021-11-23 12:23:34,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:34,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 12:23:34,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:34,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 12:23:34,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-23 12:23:34,551 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:34,810 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2021-11-23 12:23:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 12:23:34,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-23 12:23:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:34,812 INFO L225 Difference]: With dead ends: 107 [2021-11-23 12:23:34,812 INFO L226 Difference]: Without dead ends: 107 [2021-11-23 12:23:34,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-11-23 12:23:34,813 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 550 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:34,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 151 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 12:23:34,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-11-23 12:23:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-11-23 12:23:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2021-11-23 12:23:34,817 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 28 [2021-11-23 12:23:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:34,818 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2021-11-23 12:23:34,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2021-11-23 12:23:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 12:23:34,819 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:34,819 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:34,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 12:23:34,819 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1383380101, now seen corresponding path program 1 times [2021-11-23 12:23:34,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:34,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619380485] [2021-11-23 12:23:34,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:34,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 12:23:34,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:34,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619380485] [2021-11-23 12:23:34,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619380485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:34,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:34,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 12:23:34,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940937689] [2021-11-23 12:23:34,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:34,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 12:23:34,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:34,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 12:23:34,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 12:23:34,879 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:35,013 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2021-11-23 12:23:35,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 12:23:35,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-23 12:23:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:35,015 INFO L225 Difference]: With dead ends: 102 [2021-11-23 12:23:35,015 INFO L226 Difference]: Without dead ends: 102 [2021-11-23 12:23:35,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-23 12:23:35,016 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 346 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:35,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 74 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 12:23:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-23 12:23:35,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-11-23 12:23:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2021-11-23 12:23:35,020 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 28 [2021-11-23 12:23:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:35,020 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2021-11-23 12:23:35,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2021-11-23 12:23:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-23 12:23:35,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:35,022 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:35,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 12:23:35,023 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:35,024 INFO L85 PathProgramCache]: Analyzing trace with hash -63718946, now seen corresponding path program 1 times [2021-11-23 12:23:35,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:35,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579951834] [2021-11-23 12:23:35,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:35,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:35,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:35,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579951834] [2021-11-23 12:23:35,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579951834] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:23:35,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614165468] [2021-11-23 12:23:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:35,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:23:35,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:23:35,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:23:35,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 12:23:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:35,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-23 12:23:35,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:23:35,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:23:35,520 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-23 12:23:35,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 12:23:35,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:23:35,615 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:23:35,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2021-11-23 12:23:35,801 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-11-23 12:23:35,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 39 [2021-11-23 12:23:35,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:23:35,917 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-11-23 12:23:35,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 55 [2021-11-23 12:23:36,259 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-23 12:23:36,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 29 [2021-11-23 12:23:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:36,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:23:38,349 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-11-23 12:23:46,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-11-23 12:23:46,876 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-11-23 12:23:46,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 74 treesize of output 51 [2021-11-23 12:23:46,893 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:23:46,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 67 [2021-11-23 12:23:46,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:23:47,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:23:47,085 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:23:47,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 23 [2021-11-23 12:23:47,184 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:23:47,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 124 [2021-11-23 12:23:47,735 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 12:23:47,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2021-11-23 12:23:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-23 12:23:47,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614165468] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:23:47,773 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:23:47,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 29 [2021-11-23 12:23:47,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142244828] [2021-11-23 12:23:47,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:23:47,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-23 12:23:47,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-23 12:23:47,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=669, Unknown=10, NotChecked=106, Total=870 [2021-11-23 12:23:47,776 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:53,601 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2021-11-23 12:23:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-23 12:23:53,601 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-23 12:23:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:53,603 INFO L225 Difference]: With dead ends: 158 [2021-11-23 12:23:53,603 INFO L226 Difference]: Without dead ends: 158 [2021-11-23 12:23:53,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=139, Invalid=981, Unknown=10, NotChecked=130, Total=1260 [2021-11-23 12:23:53,604 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 84 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 534 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:53,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 761 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 566 Invalid, 0 Unknown, 534 Unchecked, 0.4s Time] [2021-11-23 12:23:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-23 12:23:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2021-11-23 12:23:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 145 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 162 transitions. [2021-11-23 12:23:53,616 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 162 transitions. Word has length 29 [2021-11-23 12:23:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:53,617 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 162 transitions. [2021-11-23 12:23:53,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 162 transitions. [2021-11-23 12:23:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-23 12:23:53,620 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:53,620 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:53,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 12:23:53,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-23 12:23:53,849 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:53,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:53,850 INFO L85 PathProgramCache]: Analyzing trace with hash -63681212, now seen corresponding path program 1 times [2021-11-23 12:23:53,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:53,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148398459] [2021-11-23 12:23:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:53,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 12:23:54,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:54,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148398459] [2021-11-23 12:23:54,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148398459] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:23:54,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:23:54,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 12:23:54,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587337675] [2021-11-23 12:23:54,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:23:54,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 12:23:54,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:23:54,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 12:23:54,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-23 12:23:54,084 INFO L87 Difference]: Start difference. First operand 146 states and 162 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:23:54,489 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2021-11-23 12:23:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 12:23:54,490 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-23 12:23:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:23:54,492 INFO L225 Difference]: With dead ends: 141 [2021-11-23 12:23:54,492 INFO L226 Difference]: Without dead ends: 141 [2021-11-23 12:23:54,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-11-23 12:23:54,493 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 645 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:23:54,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 74 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:23:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-23 12:23:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-11-23 12:23:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.28099173553719) internal successors, (155), 140 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2021-11-23 12:23:54,500 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 29 [2021-11-23 12:23:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:23:54,500 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2021-11-23 12:23:54,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:23:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2021-11-23 12:23:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 12:23:54,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:23:54,502 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:23:54,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 12:23:54,502 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:23:54,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:23:54,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1975287187, now seen corresponding path program 1 times [2021-11-23 12:23:54,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:23:54,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911093208] [2021-11-23 12:23:54,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:54,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:23:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:54,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:23:54,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911093208] [2021-11-23 12:23:54,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911093208] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:23:54,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915296132] [2021-11-23 12:23:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:23:54,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:23:54,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:23:54,802 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:23:54,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 12:23:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:23:54,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-23 12:23:54,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:23:54,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:23:54,965 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-23 12:23:54,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 12:23:54,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:23:55,036 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:23:55,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 51 [2021-11-23 12:23:55,227 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-11-23 12:23:55,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 39 [2021-11-23 12:23:55,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:23:55,340 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-11-23 12:23:55,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 55 [2021-11-23 12:23:55,631 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-23 12:23:55,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 29 [2021-11-23 12:23:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:23:55,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:23:59,833 INFO L354 Elim1Store]: treesize reduction 5, result has 88.9 percent of original size [2021-11-23 12:23:59,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 48 [2021-11-23 12:24:00,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-11-23 12:24:00,986 INFO L354 Elim1Store]: treesize reduction 93, result has 22.5 percent of original size [2021-11-23 12:24:00,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 72 treesize of output 39 [2021-11-23 12:24:00,992 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 12:24:00,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 29 [2021-11-23 12:24:00,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 36 [2021-11-23 12:24:01,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 28 [2021-11-23 12:24:01,845 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 12:24:01,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2021-11-23 12:24:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-23 12:24:01,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915296132] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:24:01,870 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:24:01,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 27 [2021-11-23 12:24:01,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314416915] [2021-11-23 12:24:01,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:24:01,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-23 12:24:01,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:24:01,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-23 12:24:01,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=610, Unknown=8, NotChecked=50, Total=756 [2021-11-23 12:24:01,873 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:24:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:24:12,258 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2021-11-23 12:24:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-23 12:24:12,258 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-23 12:24:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:24:12,260 INFO L225 Difference]: With dead ends: 161 [2021-11-23 12:24:12,260 INFO L226 Difference]: Without dead ends: 161 [2021-11-23 12:24:12,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=136, Invalid=909, Unknown=15, NotChecked=62, Total=1122 [2021-11-23 12:24:12,262 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 19 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:24:12,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 702 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 388 Invalid, 0 Unknown, 136 Unchecked, 0.3s Time] [2021-11-23 12:24:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-23 12:24:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2021-11-23 12:24:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 153 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:24:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2021-11-23 12:24:12,269 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 30 [2021-11-23 12:24:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:24:12,270 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2021-11-23 12:24:12,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:24:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2021-11-23 12:24:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 12:24:12,271 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:24:12,271 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:24:12,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-23 12:24:12,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-23 12:24:12,482 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:24:12,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:24:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1974117395, now seen corresponding path program 1 times [2021-11-23 12:24:12,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:24:12,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205683041] [2021-11-23 12:24:12,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:24:12,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:24:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:24:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 12:24:12,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:24:12,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205683041] [2021-11-23 12:24:12,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205683041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:24:12,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:24:12,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-23 12:24:12,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163673406] [2021-11-23 12:24:12,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:24:12,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-23 12:24:12,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:24:12,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-23 12:24:12,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-23 12:24:12,682 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:24:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:24:13,119 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2021-11-23 12:24:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 12:24:13,119 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-23 12:24:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:24:13,121 INFO L225 Difference]: With dead ends: 153 [2021-11-23 12:24:13,121 INFO L226 Difference]: Without dead ends: 153 [2021-11-23 12:24:13,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-11-23 12:24:13,122 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 243 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:24:13,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 314 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:24:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-23 12:24:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-11-23 12:24:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 152 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:24:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2021-11-23 12:24:13,128 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 30 [2021-11-23 12:24:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:24:13,128 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2021-11-23 12:24:13,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:24:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2021-11-23 12:24:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-23 12:24:13,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:24:13,130 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:24:13,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 12:24:13,130 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:24:13,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:24:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash 652960449, now seen corresponding path program 1 times [2021-11-23 12:24:13,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:24:13,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422989076] [2021-11-23 12:24:13,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:24:13,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:24:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:24:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:24:13,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:24:13,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422989076] [2021-11-23 12:24:13,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422989076] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:24:13,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686159500] [2021-11-23 12:24:13,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:24:13,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:24:13,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:24:13,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:24:13,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 12:24:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:24:13,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 12:24:13,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:24:13,580 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 12:24:13,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:24:13,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 17 [2021-11-23 12:24:13,797 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:24:13,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 23 [2021-11-23 12:24:14,087 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 12:24:14,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:24:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:24:14,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:24:14,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 11 [2021-11-23 12:24:14,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 22 [2021-11-23 12:24:14,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 12:24:14,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:24:14,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:24:14,450 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 12:24:14,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-11-23 12:24:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:24:14,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686159500] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:24:14,468 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:24:14,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2021-11-23 12:24:14,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015562927] [2021-11-23 12:24:14,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:24:14,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-23 12:24:14,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:24:14,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-23 12:24:14,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2021-11-23 12:24:14,471 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 31 states, 30 states have (on average 2.433333333333333) internal successors, (73), 31 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:24:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:24:15,168 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2021-11-23 12:24:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 12:24:15,169 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.433333333333333) internal successors, (73), 31 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-23 12:24:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:24:15,170 INFO L225 Difference]: With dead ends: 155 [2021-11-23 12:24:15,170 INFO L226 Difference]: Without dead ends: 155 [2021-11-23 12:24:15,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=1369, Unknown=0, NotChecked=0, Total=1640 [2021-11-23 12:24:15,172 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 442 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:24:15,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 603 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 451 Invalid, 0 Unknown, 231 Unchecked, 0.3s Time] [2021-11-23 12:24:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-23 12:24:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2021-11-23 12:24:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 151 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:24:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-11-23 12:24:15,179 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 33 [2021-11-23 12:24:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:24:15,179 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-11-23 12:24:15,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.433333333333333) internal successors, (73), 31 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:24:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-11-23 12:24:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-23 12:24:15,181 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:24:15,181 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:24:15,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 12:24:15,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-11-23 12:24:15,405 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:24:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:24:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash 652529473, now seen corresponding path program 1 times [2021-11-23 12:24:15,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:24:15,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9872418] [2021-11-23 12:24:15,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:24:15,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:24:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:24:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:24:15,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:24:15,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9872418] [2021-11-23 12:24:15,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9872418] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:24:15,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046339922] [2021-11-23 12:24:15,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:24:15,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:24:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:24:15,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:24:15,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 12:24:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:24:15,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-23 12:24:15,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:24:15,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:24:15,895 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-23 12:24:15,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 12:24:15,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:24:15,966 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:24:15,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 51 [2021-11-23 12:24:16,161 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-11-23 12:24:16,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 39 [2021-11-23 12:24:16,286 INFO L354 Elim1Store]: treesize reduction 122, result has 16.4 percent of original size [2021-11-23 12:24:16,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 58 treesize of output 58 [2021-11-23 12:24:19,700 INFO L354 Elim1Store]: treesize reduction 106, result has 15.2 percent of original size [2021-11-23 12:24:19,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 50 [2021-11-23 12:24:20,008 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 12:24:20,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:24:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:24:20,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:24:21,118 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) is different from false [2021-11-23 12:24:43,638 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_28| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_28| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1))) is different from false [2021-11-23 12:24:43,667 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:24:43,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 104 [2021-11-23 12:25:27,032 INFO L354 Elim1Store]: treesize reduction 166, result has 30.5 percent of original size [2021-11-23 12:25:27,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 108 [2021-11-23 12:25:27,055 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:25:27,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 124 [2021-11-23 12:25:27,080 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:25:27,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 140 [2021-11-23 12:25:27,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:25:27,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:25:27,458 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:25:27,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:25:27,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:25:27,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:25:27,661 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:25:27,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:25:27,866 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:25:27,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 127 [2021-11-23 12:25:28,518 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:25:28,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 149 treesize of output 275 [2021-11-23 12:25:29,445 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 12:25:29,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2021-11-23 12:25:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-23 12:25:29,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046339922] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:25:29,462 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:25:29,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 36 [2021-11-23 12:25:29,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811515757] [2021-11-23 12:25:29,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:25:29,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-23 12:25:29,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:25:29,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-23 12:25:29,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1050, Unknown=53, NotChecked=134, Total=1332 [2021-11-23 12:25:29,465 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:25:33,305 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_28| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_28| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| .cse0) 1) (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-11-23 12:25:35,119 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse2 0)) (.cse0 (select (store .cse2 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_27| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_27| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2021-11-23 12:25:39,785 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_28| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_28| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| .cse0) 1) (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-11-23 12:25:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:25:50,385 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2021-11-23 12:25:50,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-23 12:25:50,386 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-23 12:25:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:25:50,387 INFO L225 Difference]: With dead ends: 154 [2021-11-23 12:25:50,388 INFO L226 Difference]: Without dead ends: 154 [2021-11-23 12:25:50,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 90.6s TimeCoverageRelationStatistics Valid=189, Invalid=1924, Unknown=69, NotChecked=470, Total=2652 [2021-11-23 12:25:50,390 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 54 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 366 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:25:50,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 1162 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 624 Invalid, 0 Unknown, 366 Unchecked, 0.4s Time] [2021-11-23 12:25:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-11-23 12:25:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2021-11-23 12:25:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.2439024390243902) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:25:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2021-11-23 12:25:50,396 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 33 [2021-11-23 12:25:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:25:50,397 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2021-11-23 12:25:50,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:25:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2021-11-23 12:25:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 12:25:50,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:25:50,398 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:25:50,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-23 12:25:50,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:25:50,612 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:25:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:25:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash -554352783, now seen corresponding path program 1 times [2021-11-23 12:25:50,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:25:50,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609310782] [2021-11-23 12:25:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:25:50,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:25:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:25:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:25:50,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:25:50,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609310782] [2021-11-23 12:25:50,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609310782] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:25:50,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370211827] [2021-11-23 12:25:50,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:25:50,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:25:50,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:25:50,967 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:25:50,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 12:25:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:25:51,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 12:25:51,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:25:51,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:25:51,082 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 12:25:51,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:25:51,137 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-23 12:25:51,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 12:25:51,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:25:51,227 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:25:51,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2021-11-23 12:25:51,363 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-11-23 12:25:51,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 34 [2021-11-23 12:25:51,475 INFO L354 Elim1Store]: treesize reduction 122, result has 16.4 percent of original size [2021-11-23 12:25:51,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 49 treesize of output 53 [2021-11-23 12:25:57,113 INFO L354 Elim1Store]: treesize reduction 106, result has 15.2 percent of original size [2021-11-23 12:25:57,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 45 [2021-11-23 12:25:57,302 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-23 12:25:57,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 27 [2021-11-23 12:25:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:25:57,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:25:57,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 23 [2021-11-23 12:25:58,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2021-11-23 12:25:59,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) is different from false [2021-11-23 12:26:00,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_32| Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_32| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-11-23 12:26:39,208 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-11-23 12:26:39,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 83 treesize of output 59 [2021-11-23 12:26:39,224 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:26:39,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 75 [2021-11-23 12:26:39,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:26:39,387 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:26:39,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 23 [2021-11-23 12:26:39,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:26:39,515 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:26:39,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 117 [2021-11-23 12:26:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-23 12:26:40,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370211827] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:26:40,294 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:26:40,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 42 [2021-11-23 12:26:40,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751487881] [2021-11-23 12:26:40,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:26:40,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-23 12:26:40,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:26:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-23 12:26:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1407, Unknown=32, NotChecked=234, Total=1806 [2021-11-23 12:26:40,297 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:26:41,323 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_32| Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_32| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-11-23 12:26:42,148 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_31| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_31| 4)))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2021-11-23 12:26:43,078 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_32| Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_32| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-11-23 12:26:43,884 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_31| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_31| 4)))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2021-11-23 12:26:44,456 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_31| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_31| 4)))) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store .cse0 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:26:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:26:46,940 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2021-11-23 12:26:46,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-23 12:26:46,941 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-23 12:26:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:26:46,942 INFO L225 Difference]: With dead ends: 167 [2021-11-23 12:26:46,942 INFO L226 Difference]: Without dead ends: 167 [2021-11-23 12:26:46,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 53.6s TimeCoverageRelationStatistics Valid=230, Invalid=2215, Unknown=37, NotChecked=824, Total=3306 [2021-11-23 12:26:46,945 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 38 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 467 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:26:46,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 1681 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 628 Invalid, 0 Unknown, 467 Unchecked, 0.4s Time] [2021-11-23 12:26:46,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-23 12:26:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2021-11-23 12:26:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 140 states have (on average 1.2357142857142858) internal successors, (173), 157 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:26:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2021-11-23 12:26:46,951 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 34 [2021-11-23 12:26:46,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:26:46,952 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2021-11-23 12:26:46,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:26:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2021-11-23 12:26:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 12:26:46,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:26:46,953 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:26:46,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 12:26:47,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:26:47,178 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:26:47,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:26:47,178 INFO L85 PathProgramCache]: Analyzing trace with hash -553921807, now seen corresponding path program 1 times [2021-11-23 12:26:47,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:26:47,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172575742] [2021-11-23 12:26:47,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:26:47,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:26:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:26:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:26:47,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:26:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172575742] [2021-11-23 12:26:47,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172575742] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:26:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35741392] [2021-11-23 12:26:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:26:47,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:26:47,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:26:47,743 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:26:47,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 12:26:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:26:47,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-23 12:26:47,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:26:47,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:26:47,899 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 12:26:47,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:26:48,054 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-23 12:26:48,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2021-11-23 12:26:48,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 12:26:48,195 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:26:48,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-11-23 12:26:48,356 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-11-23 12:26:48,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 38 [2021-11-23 12:26:48,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:26:48,478 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-11-23 12:26:48,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 12:26:48,941 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-23 12:26:48,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 36 [2021-11-23 12:26:48,993 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 12:26:48,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:26:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:26:49,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:26:49,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:27:04,504 INFO L354 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2021-11-23 12:27:04,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 73 treesize of output 50 [2021-11-23 12:27:04,523 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-11-23 12:27:04,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2021-11-23 12:27:04,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:27:04,598 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:27:04,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 13 [2021-11-23 12:27:04,639 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:27:04,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 77 [2021-11-23 12:27:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:27:05,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35741392] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:27:05,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:27:05,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 52 [2021-11-23 12:27:05,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122184791] [2021-11-23 12:27:05,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:27:05,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-11-23 12:27:05,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:27:05,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-11-23 12:27:05,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2524, Unknown=8, NotChecked=0, Total=2756 [2021-11-23 12:27:05,176 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:27:07,089 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_25|) 0)) (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_25| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2021-11-23 12:27:07,953 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_25|) 0)) (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_25| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:27:08,802 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_25| Int)) (or (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_25| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_25|) 0)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2021-11-23 12:27:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:27:09,997 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2021-11-23 12:27:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-23 12:27:09,998 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-23 12:27:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:27:09,999 INFO L225 Difference]: With dead ends: 196 [2021-11-23 12:27:09,999 INFO L226 Difference]: Without dead ends: 196 [2021-11-23 12:27:10,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=427, Invalid=3996, Unknown=11, NotChecked=396, Total=4830 [2021-11-23 12:27:10,003 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 12:27:10,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 1340 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 755 Invalid, 0 Unknown, 289 Unchecked, 0.5s Time] [2021-11-23 12:27:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-11-23 12:27:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2021-11-23 12:27:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 167 states have (on average 1.2395209580838322) internal successors, (207), 184 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:27:10,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2021-11-23 12:27:10,010 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 34 [2021-11-23 12:27:10,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:27:10,010 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2021-11-23 12:27:10,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:27:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2021-11-23 12:27:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 12:27:10,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:27:10,012 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:27:10,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 12:27:10,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-23 12:27:10,218 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:27:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:27:10,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1737934321, now seen corresponding path program 1 times [2021-11-23 12:27:10,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:27:10,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782112414] [2021-11-23 12:27:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:27:10,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:27:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:27:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:27:10,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:27:10,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782112414] [2021-11-23 12:27:10,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782112414] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:27:10,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066683613] [2021-11-23 12:27:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:27:10,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:27:10,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:27:10,708 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:27:10,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 12:27:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:27:10,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-23 12:27:10,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:27:10,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:27:10,846 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 12:27:10,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:27:10,978 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-23 12:27:10,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2021-11-23 12:27:11,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 12:27:11,089 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:27:11,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-11-23 12:27:11,236 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-11-23 12:27:11,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 43 [2021-11-23 12:27:11,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:27:11,330 INFO L354 Elim1Store]: treesize reduction 102, result has 14.3 percent of original size [2021-11-23 12:27:11,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 59 [2021-11-23 12:27:11,776 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-23 12:27:11,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 36 [2021-11-23 12:27:11,827 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 12:27:11,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:27:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:27:11,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:27:12,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2021-11-23 12:27:13,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2021-11-23 12:27:13,673 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:27:13,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 91 treesize of output 95 [2021-11-23 12:27:15,547 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:27:15,591 INFO L354 Elim1Store]: treesize reduction 93, result has 22.5 percent of original size [2021-11-23 12:27:15,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 72 treesize of output 39 [2021-11-23 12:27:15,596 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 12:27:15,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 29 [2021-11-23 12:27:15,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 36 [2021-11-23 12:27:15,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 28 [2021-11-23 12:27:15,647 INFO L354 Elim1Store]: treesize reduction 93, result has 22.5 percent of original size [2021-11-23 12:27:15,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 73 treesize of output 40 [2021-11-23 12:27:15,665 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-11-23 12:27:15,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 44 [2021-11-23 12:27:15,695 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:27:15,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:27:15,724 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:27:15,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2021-11-23 12:27:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-23 12:27:16,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066683613] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:27:16,200 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:27:16,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 52 [2021-11-23 12:27:16,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941078649] [2021-11-23 12:27:16,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:27:16,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-11-23 12:27:16,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:27:16,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-11-23 12:27:16,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2256, Unknown=3, NotChecked=294, Total=2756 [2021-11-23 12:27:16,203 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:27:42,552 WARN L227 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:27:43,650 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28|) 0)) (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1))) is different from false [2021-11-23 12:27:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:27:52,953 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2021-11-23 12:27:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-23 12:27:52,953 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-23 12:27:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:27:52,955 INFO L225 Difference]: With dead ends: 183 [2021-11-23 12:27:52,955 INFO L226 Difference]: Without dead ends: 183 [2021-11-23 12:27:52,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 41.1s TimeCoverageRelationStatistics Valid=392, Invalid=3771, Unknown=13, NotChecked=516, Total=4692 [2021-11-23 12:27:52,957 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 72 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 412 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:27:52,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 1310 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 658 Invalid, 0 Unknown, 412 Unchecked, 0.4s Time] [2021-11-23 12:27:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-23 12:27:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2021-11-23 12:27:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 166 states have (on average 1.2228915662650603) internal successors, (203), 181 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:27:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 203 transitions. [2021-11-23 12:27:52,965 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 203 transitions. Word has length 34 [2021-11-23 12:27:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:27:52,965 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 203 transitions. [2021-11-23 12:27:52,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:27:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 203 transitions. [2021-11-23 12:27:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 12:27:52,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:27:52,967 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:27:52,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-11-23 12:27:53,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-23 12:27:53,174 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:27:53,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:27:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1737503345, now seen corresponding path program 1 times [2021-11-23 12:27:53,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:27:53,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317334460] [2021-11-23 12:27:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:27:53,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:27:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:27:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:27:53,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:27:53,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317334460] [2021-11-23 12:27:53,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317334460] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:27:53,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135366336] [2021-11-23 12:27:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:27:53,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:27:53,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:27:53,408 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:27:53,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 12:27:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:27:53,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 12:27:53,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:27:53,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:27:53,506 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 12:27:53,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:27:53,573 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 12:27:53,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:27:53,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2021-11-23 12:27:53,709 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:27:53,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-11-23 12:27:53,878 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-23 12:27:53,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 27 [2021-11-23 12:27:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 12:27:54,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:27:54,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 25 [2021-11-23 12:27:54,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 11 [2021-11-23 12:27:54,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 22 [2021-11-23 12:27:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 12:27:54,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135366336] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:27:54,366 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:27:54,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 30 [2021-11-23 12:27:54,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240383092] [2021-11-23 12:27:54,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:27:54,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-23 12:27:54,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:27:54,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-23 12:27:54,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2021-11-23 12:27:54,368 INFO L87 Difference]: Start difference. First operand 182 states and 203 transitions. Second operand has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:27:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:27:55,189 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2021-11-23 12:27:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 12:27:55,190 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-23 12:27:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:27:55,191 INFO L225 Difference]: With dead ends: 184 [2021-11-23 12:27:55,191 INFO L226 Difference]: Without dead ends: 184 [2021-11-23 12:27:55,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=279, Invalid=1361, Unknown=0, NotChecked=0, Total=1640 [2021-11-23 12:27:55,193 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 523 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:27:55,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 533 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 570 Invalid, 0 Unknown, 66 Unchecked, 0.4s Time] [2021-11-23 12:27:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-23 12:27:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2021-11-23 12:27:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 180 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:27:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2021-11-23 12:27:55,200 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 34 [2021-11-23 12:27:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:27:55,200 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2021-11-23 12:27:55,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:27:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2021-11-23 12:27:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 12:27:55,202 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:27:55,202 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:27:55,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 12:27:55,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-23 12:27:55,426 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:27:55,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:27:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash 437974780, now seen corresponding path program 1 times [2021-11-23 12:27:55,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:27:55,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564917128] [2021-11-23 12:27:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:27:55,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:27:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:27:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:27:56,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:27:56,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564917128] [2021-11-23 12:27:56,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564917128] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:27:56,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470856401] [2021-11-23 12:27:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:27:56,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:27:56,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:27:56,138 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:27:56,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 12:27:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:27:56,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-23 12:27:56,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:27:56,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:27:56,310 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 12:27:56,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:27:56,468 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-23 12:27:56,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2021-11-23 12:27:56,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 12:27:56,578 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:27:56,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-11-23 12:27:56,737 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-11-23 12:27:56,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 43 [2021-11-23 12:27:56,853 INFO L354 Elim1Store]: treesize reduction 94, result has 15.3 percent of original size [2021-11-23 12:27:56,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 57 [2021-11-23 12:27:57,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:27:57,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:27:57,315 INFO L354 Elim1Store]: treesize reduction 124, result has 16.8 percent of original size [2021-11-23 12:27:57,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 60 [2021-11-23 12:27:57,943 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 12:27:57,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2021-11-23 12:27:58,080 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 12:27:58,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 25 treesize of output 30 [2021-11-23 12:27:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:27:58,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:27:59,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse0 (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) .cse0) 1) (not (= .cse0 (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))))))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) is different from false [2021-11-23 12:28:01,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))))))) is different from false [2021-11-23 12:28:02,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1))))) is different from false [2021-11-23 12:28:02,428 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:28:02,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 177 treesize of output 181 [2021-11-23 12:28:04,527 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_prenex_8 Int)) (not (let ((.cse2 (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))))))))) is different from false [2021-11-23 12:28:04,722 INFO L354 Elim1Store]: treesize reduction 249, result has 30.4 percent of original size [2021-11-23 12:28:04,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 297 treesize of output 165 [2021-11-23 12:28:04,741 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:28:04,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 181 [2021-11-23 12:28:04,762 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:28:04,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 197 [2021-11-23 12:28:04,803 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:28:04,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 197 treesize of output 211 [2021-11-23 12:28:05,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:28:05,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:28:05,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:28:05,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:28:05,455 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:28:05,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:28:05,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:28:05,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:28:05,831 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:28:05,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:28:05,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:28:06,022 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:28:06,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:28:06,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:28:06,223 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:28:06,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 107 treesize of output 189 [2021-11-23 12:28:07,764 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:28:07,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 126 treesize of output 258 [2021-11-23 12:28:16,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 12:28:16,632 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:28:16,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 182 treesize of output 356 [2021-11-23 12:28:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-23 12:28:18,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470856401] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:28:18,976 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:28:18,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 59 [2021-11-23 12:28:18,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004182654] [2021-11-23 12:28:18,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:28:18,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-11-23 12:28:18,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:28:18,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-11-23 12:28:18,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2875, Unknown=4, NotChecked=444, Total=3540 [2021-11-23 12:28:18,979 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand has 60 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 60 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:28:59,558 WARN L227 SmtUtils]: Spent 40.19s on a formula simplification. DAG size of input: 71 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:29:01,205 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_34|) 0)) (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_34| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_34| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| .cse1) 1) (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-11-23 12:29:02,762 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_34| Int)) (or (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_34| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_34| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_34|) 0)))) (= (select |c_#valid| .cse1) 1) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| .cse2) 1) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| 4)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:29:03,823 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))))))) (= (select |c_#valid| .cse1) 1) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| .cse2) 1) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| 4)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:29:04,656 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (select (store .cse4 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse2 (select .cse3 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) .cse2) 1) (not (= .cse2 (select .cse3 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))))))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| 4)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2021-11-23 12:29:05,845 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1))))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| .cse1) 1) (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-11-23 12:29:07,147 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))))))) (= (select |c_#valid| .cse1) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| 4)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:29:08,077 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse1 (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) .cse1) 1) (not (= .cse1 (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))))))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_50| 4)))) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:29:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:29:10,571 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2021-11-23 12:29:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-23 12:29:10,572 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 60 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 12:29:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:29:10,573 INFO L225 Difference]: With dead ends: 185 [2021-11-23 12:29:10,573 INFO L226 Difference]: Without dead ends: 185 [2021-11-23 12:29:10,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 58.7s TimeCoverageRelationStatistics Valid=317, Invalid=4137, Unknown=12, NotChecked=1540, Total=6006 [2021-11-23 12:29:10,577 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 43 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 688 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:29:10,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 1519 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 547 Invalid, 0 Unknown, 688 Unchecked, 0.4s Time] [2021-11-23 12:29:10,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-23 12:29:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2021-11-23 12:29:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 167 states have (on average 1.2095808383233533) internal successors, (202), 181 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:29:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 202 transitions. [2021-11-23 12:29:10,583 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 202 transitions. Word has length 36 [2021-11-23 12:29:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:29:10,584 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 202 transitions. [2021-11-23 12:29:10,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 60 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:29:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 202 transitions. [2021-11-23 12:29:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 12:29:10,585 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:29:10,585 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:29:10,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-23 12:29:10,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-23 12:29:10,814 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:29:10,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:29:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash 483656750, now seen corresponding path program 1 times [2021-11-23 12:29:10,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:29:10,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357691942] [2021-11-23 12:29:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:29:10,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:29:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:29:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:29:11,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:29:11,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357691942] [2021-11-23 12:29:11,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357691942] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:29:11,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200496814] [2021-11-23 12:29:11,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:29:11,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:29:11,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:29:11,349 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:29:11,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 12:29:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:29:11,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-23 12:29:11,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:29:11,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:29:11,479 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 12:29:11,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:29:11,606 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-23 12:29:11,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2021-11-23 12:29:11,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 12:29:11,707 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:29:11,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-11-23 12:29:11,841 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-11-23 12:29:11,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 38 [2021-11-23 12:29:11,975 INFO L354 Elim1Store]: treesize reduction 94, result has 15.3 percent of original size [2021-11-23 12:29:11,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 57 [2021-11-23 12:29:12,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:29:12,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:29:12,516 INFO L354 Elim1Store]: treesize reduction 124, result has 16.8 percent of original size [2021-11-23 12:29:12,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 60 [2021-11-23 12:29:13,192 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 12:29:13,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2021-11-23 12:29:13,333 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 12:29:13,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 25 treesize of output 30 [2021-11-23 12:29:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:29:13,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:29:15,058 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse1 (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))) (and (not (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) .cse1)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) .cse1) 1)))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) is different from false [2021-11-23 12:29:15,076 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:29:15,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 101 treesize of output 105 [2021-11-23 12:29:16,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2021-11-23 12:29:17,426 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) is different from false [2021-11-23 12:29:19,497 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (let ((.cse0 (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))))) is different from false [2021-11-23 12:29:19,663 INFO L354 Elim1Store]: treesize reduction 249, result has 30.4 percent of original size [2021-11-23 12:29:19,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 301 treesize of output 169 [2021-11-23 12:29:19,681 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:29:19,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 185 [2021-11-23 12:29:19,700 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:29:19,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 201 [2021-11-23 12:29:19,741 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:29:19,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 215 [2021-11-23 12:29:19,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:29:20,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:29:20,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:29:20,307 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:29:20,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 23 [2021-11-23 12:29:20,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:29:20,527 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:29:20,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:29:20,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:29:20,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:29:20,780 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:29:20,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:29:20,886 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:29:20,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 155 [2021-11-23 12:29:21,585 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:29:21,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 132 treesize of output 272 [2021-11-23 12:29:22,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 12:29:23,076 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:29:23,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 171 treesize of output 345 [2021-11-23 12:29:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-23 12:29:36,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200496814] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:29:36,951 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:29:36,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 60 [2021-11-23 12:29:36,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647012235] [2021-11-23 12:29:36,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:29:36,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-11-23 12:29:36,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:29:36,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-11-23 12:29:36,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2972, Unknown=4, NotChecked=452, Total=3660 [2021-11-23 12:29:36,953 INFO L87 Difference]: Start difference. First operand 182 states and 202 transitions. Second operand has 61 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 61 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:30,780 WARN L227 SmtUtils]: Spent 26.92s on a formula simplification. DAG size of input: 57 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:30:31,831 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_55| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_55| 4)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_37| Int)) (or (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_37| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_37|) 0)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:30:32,753 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_55| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_55| 4)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:30:33,562 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store .cse0 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_55| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_55| 4)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse3 (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))) (and (not (= (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) .cse3)) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) .cse3) 1)))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2021-11-23 12:30:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:34,254 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2021-11-23 12:30:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-23 12:30:34,254 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 61 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 12:30:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:34,256 INFO L225 Difference]: With dead ends: 199 [2021-11-23 12:30:34,256 INFO L226 Difference]: Without dead ends: 199 [2021-11-23 12:30:34,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 64.4s TimeCoverageRelationStatistics Valid=338, Invalid=4358, Unknown=24, NotChecked=980, Total=5700 [2021-11-23 12:30:34,260 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 91 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 427 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:34,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 1282 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 357 Invalid, 0 Unknown, 427 Unchecked, 0.2s Time] [2021-11-23 12:30:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-23 12:30:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 185. [2021-11-23 12:30:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 170 states have (on average 1.2058823529411764) internal successors, (205), 184 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 205 transitions. [2021-11-23 12:30:34,267 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 205 transitions. Word has length 36 [2021-11-23 12:30:34,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:34,267 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 205 transitions. [2021-11-23 12:30:34,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 61 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 205 transitions. [2021-11-23 12:30:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 12:30:34,268 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:34,269 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:34,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-23 12:30:34,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-23 12:30:34,482 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:30:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:34,482 INFO L85 PathProgramCache]: Analyzing trace with hash -574356217, now seen corresponding path program 1 times [2021-11-23 12:30:34,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:34,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593393096] [2021-11-23 12:30:34,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:34,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:35,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:35,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593393096] [2021-11-23 12:30:35,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593393096] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:30:35,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220831140] [2021-11-23 12:30:35,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:35,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:30:35,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:30:35,216 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:30:35,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 12:30:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:35,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-23 12:30:35,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:30:35,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:30:35,395 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 12:30:35,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:30:35,563 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-23 12:30:35,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2021-11-23 12:30:35,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 12:30:35,673 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:30:35,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-11-23 12:30:35,817 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-11-23 12:30:35,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 38 [2021-11-23 12:30:35,921 INFO L354 Elim1Store]: treesize reduction 94, result has 15.3 percent of original size [2021-11-23 12:30:35,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 57 [2021-11-23 12:30:36,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:30:36,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:30:36,382 INFO L354 Elim1Store]: treesize reduction 124, result has 16.8 percent of original size [2021-11-23 12:30:36,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 60 [2021-11-23 12:30:37,080 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-23 12:30:37,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 52 [2021-11-23 12:30:38,123 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 12:30:38,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 25 treesize of output 30 [2021-11-23 12:30:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:38,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:30:39,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= 1 (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))))))) is different from false [2021-11-23 12:30:39,925 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:30:39,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 101 treesize of output 105 [2021-11-23 12:30:41,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2021-11-23 12:30:42,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) is different from false [2021-11-23 12:30:44,863 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (let ((.cse0 (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))))) is different from false [2021-11-23 12:30:45,049 INFO L354 Elim1Store]: treesize reduction 249, result has 30.4 percent of original size [2021-11-23 12:30:45,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 301 treesize of output 169 [2021-11-23 12:30:45,069 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:30:45,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 185 [2021-11-23 12:30:45,092 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:30:45,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 201 [2021-11-23 12:30:45,130 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:30:45,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 215 [2021-11-23 12:30:45,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:30:45,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:30:45,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:30:45,564 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:30:45,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 23 [2021-11-23 12:30:45,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:30:45,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:30:45,788 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:30:45,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:30:45,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:30:45,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:30:46,054 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:30:46,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:30:46,245 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:30:46,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 111 treesize of output 199 [2021-11-23 12:30:46,870 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:30:46,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 154 [2021-11-23 12:30:49,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 12:30:49,795 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:30:49,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 171 treesize of output 345 [2021-11-23 12:31:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-23 12:31:00,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220831140] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:31:00,261 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:31:00,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 61 [2021-11-23 12:31:00,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279610401] [2021-11-23 12:31:00,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:31:00,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-11-23 12:31:00,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:31:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-11-23 12:31:00,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3074, Unknown=4, NotChecked=460, Total=3782 [2021-11-23 12:31:00,264 INFO L87 Difference]: Start difference. First operand 185 states and 205 transitions. Second operand has 62 states, 61 states have (on average 1.7049180327868851) internal successors, (104), 62 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:31:53,967 WARN L227 SmtUtils]: Spent 22.68s on a formula simplification. DAG size of input: 57 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:31:54,789 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_60| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_60| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_40| Int)) (or (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_40| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_40|) 0)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:31:55,536 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_60| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_60| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:31:56,224 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= 1 (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))))))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_60| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_60| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2021-11-23 12:31:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:31:57,783 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2021-11-23 12:31:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-23 12:31:57,783 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.7049180327868851) internal successors, (104), 62 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-23 12:31:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:31:57,784 INFO L225 Difference]: With dead ends: 204 [2021-11-23 12:31:57,784 INFO L226 Difference]: Without dead ends: 204 [2021-11-23 12:31:57,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=356, Invalid=4466, Unknown=36, NotChecked=994, Total=5852 [2021-11-23 12:31:57,787 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 483 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:31:57,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 1388 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 418 Invalid, 0 Unknown, 483 Unchecked, 0.3s Time] [2021-11-23 12:31:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-11-23 12:31:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2021-11-23 12:31:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 192 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:31:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2021-11-23 12:31:57,793 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 37 [2021-11-23 12:31:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:31:57,793 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2021-11-23 12:31:57,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.7049180327868851) internal successors, (104), 62 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:31:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2021-11-23 12:31:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 12:31:57,794 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:31:57,794 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:31:57,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-11-23 12:31:58,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:31:58,010 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:31:58,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:31:58,010 INFO L85 PathProgramCache]: Analyzing trace with hash -620038187, now seen corresponding path program 1 times [2021-11-23 12:31:58,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:31:58,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399828368] [2021-11-23 12:31:58,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:31:58,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:31:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:31:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:58,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:31:58,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399828368] [2021-11-23 12:31:58,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399828368] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:31:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316489995] [2021-11-23 12:31:58,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:31:58,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:31:58,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:31:58,522 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:31:58,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 12:31:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:31:58,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-23 12:31:58,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:31:58,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:31:58,761 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-23 12:31:58,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-11-23 12:31:58,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:31:58,854 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:31:58,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2021-11-23 12:31:58,977 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-11-23 12:31:58,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 34 [2021-11-23 12:31:59,043 INFO L354 Elim1Store]: treesize reduction 94, result has 15.3 percent of original size [2021-11-23 12:31:59,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 48 [2021-11-23 12:31:59,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:31:59,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:31:59,360 INFO L354 Elim1Store]: treesize reduction 124, result has 16.8 percent of original size [2021-11-23 12:31:59,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 57 treesize of output 51 [2021-11-23 12:31:59,639 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-23 12:31:59,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 51 [2021-11-23 12:31:59,998 INFO L354 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-11-23 12:31:59,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 54 treesize of output 71 [2021-11-23 12:32:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:32:00,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:32:01,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 33 [2021-11-23 12:32:01,964 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (not (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) is different from false [2021-11-23 12:32:02,829 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) is different from false [2021-11-23 12:32:47,573 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) is different from false [2021-11-23 12:32:47,656 INFO L354 Elim1Store]: treesize reduction 166, result has 30.5 percent of original size [2021-11-23 12:32:47,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 108 [2021-11-23 12:32:47,670 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:32:47,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 124 [2021-11-23 12:32:47,686 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:32:47,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 140 [2021-11-23 12:32:47,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:32:47,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:32:47,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:32:47,986 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:32:47,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:32:48,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:32:48,123 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:32:48,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:32:48,252 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:32:48,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 130 [2021-11-23 12:32:48,862 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:32:48,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 124 treesize of output 264 [2021-11-23 12:32:49,347 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-23 12:32:49,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2021-11-23 12:32:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-23 12:32:49,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316489995] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:32:49,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:32:49,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 55 [2021-11-23 12:32:49,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025297028] [2021-11-23 12:32:49,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:32:49,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-11-23 12:32:49,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:32:49,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-11-23 12:32:49,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2506, Unknown=50, NotChecked=312, Total=3080 [2021-11-23 12:32:49,363 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand has 56 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 56 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:33:37,037 WARN L227 SmtUtils]: Spent 9.11s on a formula simplification. DAG size of input: 52 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:33:37,782 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (not (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_65| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_65| 4)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2021-11-23 12:34:33,025 WARN L227 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 50 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:34:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:34:40,678 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2021-11-23 12:34:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-23 12:34:40,679 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 56 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-23 12:34:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:34:40,680 INFO L225 Difference]: With dead ends: 203 [2021-11-23 12:34:40,680 INFO L226 Difference]: Without dead ends: 203 [2021-11-23 12:34:40,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 158.7s TimeCoverageRelationStatistics Valid=404, Invalid=4291, Unknown=151, NotChecked=556, Total=5402 [2021-11-23 12:34:40,682 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 96 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 464 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:34:40,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 1183 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 545 Invalid, 0 Unknown, 464 Unchecked, 0.3s Time] [2021-11-23 12:34:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-11-23 12:34:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2021-11-23 12:34:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 188 states have (on average 1.196808510638298) internal successors, (225), 202 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:34:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2021-11-23 12:34:40,688 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 37 [2021-11-23 12:34:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:34:40,689 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2021-11-23 12:34:40,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 56 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:34:40,689 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2021-11-23 12:34:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 12:34:40,690 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:34:40,690 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:34:40,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-23 12:34:40,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-23 12:34:40,905 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:34:40,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:34:40,906 INFO L85 PathProgramCache]: Analyzing trace with hash -983513747, now seen corresponding path program 1 times [2021-11-23 12:34:40,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:34:40,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718344085] [2021-11-23 12:34:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:34:40,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:34:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:34:41,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:34:41,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:34:41,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718344085] [2021-11-23 12:34:41,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718344085] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:34:41,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172551506] [2021-11-23 12:34:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:34:41,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:34:41,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:34:41,531 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:34:41,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 12:34:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:34:41,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-23 12:34:41,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:34:41,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:34:41,642 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 12:34:41,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:34:41,753 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-23 12:34:41,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2021-11-23 12:34:41,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 12:34:41,839 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:34:41,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-11-23 12:34:41,989 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-11-23 12:34:41,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 43 [2021-11-23 12:34:42,077 INFO L354 Elim1Store]: treesize reduction 94, result has 15.3 percent of original size [2021-11-23 12:34:42,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 57 [2021-11-23 12:34:42,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:34:42,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:34:42,526 INFO L354 Elim1Store]: treesize reduction 124, result has 16.8 percent of original size [2021-11-23 12:34:42,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 60 [2021-11-23 12:34:43,269 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-23 12:34:43,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 63 [2021-11-23 12:34:44,495 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-23 12:34:44,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 25 treesize of output 30 [2021-11-23 12:34:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:34:44,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:34:47,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) is different from false [2021-11-23 12:34:49,228 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))) is different from false [2021-11-23 12:34:51,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))) is different from false [2021-11-23 12:34:51,275 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:34:51,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 177 treesize of output 181 [2021-11-23 12:34:53,361 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (let ((.cse1 (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) is different from false [2021-11-23 12:34:53,596 INFO L354 Elim1Store]: treesize reduction 249, result has 30.4 percent of original size [2021-11-23 12:34:53,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 297 treesize of output 165 [2021-11-23 12:34:53,621 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:34:53,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 181 [2021-11-23 12:34:53,648 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:34:53,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 195 [2021-11-23 12:34:53,679 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:34:53,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 211 [2021-11-23 12:34:53,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:34:54,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:34:54,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-11-23 12:34:54,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:34:54,334 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:34:54,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:34:54,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:34:54,607 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:34:54,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 23 [2021-11-23 12:34:54,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-11-23 12:34:54,804 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 12:34:54,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 [2021-11-23 12:34:54,939 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:34:54,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 147 [2021-11-23 12:34:55,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 12:34:55,742 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:34:55,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 150 treesize of output 266 [2021-11-23 12:34:57,912 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 12:34:57,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 117 treesize of output 245 [2021-11-23 12:35:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-23 12:35:04,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172551506] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:35:04,800 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:35:04,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 60 [2021-11-23 12:35:04,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30990380] [2021-11-23 12:35:04,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:35:04,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-11-23 12:35:04,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:35:04,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-11-23 12:35:04,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2983, Unknown=4, NotChecked=452, Total=3660 [2021-11-23 12:35:04,803 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand has 61 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:35:39,607 WARN L227 SmtUtils]: Spent 34.40s on a formula simplification. DAG size of input: 64 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:35:41,174 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= (let ((.cse1 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_45| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_45|) 0)) (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_45| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_45| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-11-23 12:35:42,682 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| .cse1) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_69| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_69| 4)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_45| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_45|) 0)) (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_45| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_45| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= (let ((.cse2 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:35:43,795 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| .cse1) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_69| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_69| 4)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= (let ((.cse2 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:35:44,672 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (select (store .cse3 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (= (select |c_#valid| .cse1) 1) (= (select |c_#valid| .cse2) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_69| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_69| 4)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) is different from false [2021-11-23 12:35:45,904 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= (let ((.cse1 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| .cse0) 1) (exists ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-11-23 12:35:47,096 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_69| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_69| 4)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= (let ((.cse1 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:35:48,028 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (= (select |c_#valid| .cse1) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_69| Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_69| 4)))) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-11-23 12:35:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:35:48,389 INFO L93 Difference]: Finished difference Result 212 states and 235 transitions. [2021-11-23 12:35:48,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-23 12:35:48,389 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-23 12:35:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:35:48,390 INFO L225 Difference]: With dead ends: 212 [2021-11-23 12:35:48,390 INFO L226 Difference]: Without dead ends: 212 [2021-11-23 12:35:48,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=358, Invalid=4367, Unknown=11, NotChecked=1584, Total=6320 [2021-11-23 12:35:48,392 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 663 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:35:48,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1465 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 582 Invalid, 0 Unknown, 663 Unchecked, 0.3s Time] [2021-11-23 12:35:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-23 12:35:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2021-11-23 12:35:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 189 states have (on average 1.1957671957671958) internal successors, (226), 203 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:35:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 226 transitions. [2021-11-23 12:35:48,408 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 226 transitions. Word has length 37 [2021-11-23 12:35:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:35:48,409 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 226 transitions. [2021-11-23 12:35:48,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:35:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 226 transitions. [2021-11-23 12:35:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 12:35:48,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:35:48,410 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:35:48,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-23 12:35:48,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:35:48,626 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-11-23 12:35:48,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:35:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash -13024769, now seen corresponding path program 1 times [2021-11-23 12:35:48,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:35:48,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045099532] [2021-11-23 12:35:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:35:48,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:35:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:35:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:35:49,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:35:49,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045099532] [2021-11-23 12:35:49,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045099532] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:35:49,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861239864] [2021-11-23 12:35:49,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:35:49,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:35:49,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:35:49,953 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:35:49,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c9b05e5-8f9e-44cf-a8ca-0ff2e6c975a3/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 12:35:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:35:50,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-23 12:35:50,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:35:50,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 12:35:50,404 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 12:35:50,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 55 [2021-11-23 12:35:50,627 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-11-23 12:35:50,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 65 [2021-11-23 12:35:50,762 INFO L354 Elim1Store]: treesize reduction 94, result has 15.3 percent of original size [2021-11-23 12:35:50,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 80 [2021-11-23 12:35:51,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:35:51,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 12:35:51,424 INFO L354 Elim1Store]: treesize reduction 124, result has 16.8 percent of original size [2021-11-23 12:35:51,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 113 treesize of output 83 [2021-11-23 12:35:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:35:53,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:35:56,278 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse0 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0)) (.cse1 (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (or (and (not (= (select .cse0 .cse1) 1)) (not (= .cse1 0))) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= |c_ULTIMATE.start_main_old_#valid#1| (store .cse0 .cse1 0)))))) is different from false [2021-11-23 12:35:58,342 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse0 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0)) (.cse1 (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (store .cse0 .cse1 0) |c_ULTIMATE.start_main_old_#valid#1|) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (not (= .cse1 0)) (not (= (select .cse0 .cse1) 1))))))) is different from false [2021-11-23 12:36:00,506 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse0 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0)) (.cse1 (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (and (not (= 1 (select .cse0 .cse1))) (not (= .cse1 0))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (= |c_ULTIMATE.start_main_old_#valid#1| (store .cse0 .cse1 0)))))) is different from false