./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 13:20:39,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 13:20:39,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 13:20:39,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 13:20:39,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 13:20:39,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 13:20:39,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 13:20:39,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 13:20:39,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 13:20:39,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 13:20:39,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 13:20:39,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 13:20:39,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 13:20:39,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 13:20:39,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 13:20:39,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 13:20:39,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 13:20:39,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 13:20:39,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 13:20:39,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 13:20:39,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 13:20:39,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 13:20:39,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 13:20:39,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 13:20:39,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 13:20:39,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 13:20:39,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 13:20:39,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 13:20:39,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 13:20:39,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 13:20:39,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 13:20:39,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 13:20:39,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 13:20:39,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 13:20:39,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 13:20:39,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 13:20:39,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 13:20:39,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 13:20:39,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 13:20:39,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 13:20:39,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 13:20:39,510 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-19 13:20:39,562 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 13:20:39,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 13:20:39,564 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 13:20:39,565 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 13:20:39,565 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 13:20:39,565 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 13:20:39,566 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 13:20:39,566 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 13:20:39,573 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 13:20:39,574 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 13:20:39,575 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 13:20:39,575 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 13:20:39,576 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 13:20:39,576 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 13:20:39,577 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 13:20:39,577 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 13:20:39,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 13:20:39,578 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 13:20:39,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 13:20:39,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 13:20:39,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 13:20:39,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 13:20:39,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 13:20:39,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 13:20:39,580 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 13:20:39,581 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 13:20:39,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 13:20:39,581 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 13:20:39,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 13:20:39,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 13:20:39,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 13:20:39,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:20:39,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 13:20:39,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 13:20:39,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 13:20:39,586 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 13:20:39,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 13:20:39,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 13:20:39,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 13:20:39,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 13:20:39,587 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/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_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2021-11-19 13:20:39,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 13:20:39,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 13:20:39,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 13:20:39,916 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 13:20:39,916 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 13:20:39,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2021-11-19 13:20:39,991 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/data/b6d7ba20f/5670077de4ff41bebf0d2799ae8c9060/FLAG160dece87 [2021-11-19 13:20:40,554 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 13:20:40,555 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2021-11-19 13:20:40,568 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/data/b6d7ba20f/5670077de4ff41bebf0d2799ae8c9060/FLAG160dece87 [2021-11-19 13:20:40,960 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/data/b6d7ba20f/5670077de4ff41bebf0d2799ae8c9060 [2021-11-19 13:20:40,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 13:20:40,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 13:20:40,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 13:20:40,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 13:20:40,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 13:20:40,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:20:40" (1/1) ... [2021-11-19 13:20:40,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7c944f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:40, skipping insertion in model container [2021-11-19 13:20:40,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:20:40" (1/1) ... [2021-11-19 13:20:40,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 13:20:41,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:20:41,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2021-11-19 13:20:41,405 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:20:41,425 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 13:20:41,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2021-11-19 13:20:41,509 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:20:41,546 INFO L208 MainTranslator]: Completed translation [2021-11-19 13:20:41,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41 WrapperNode [2021-11-19 13:20:41,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 13:20:41,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 13:20:41,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 13:20:41,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 13:20:41,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41" (1/1) ... [2021-11-19 13:20:41,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41" (1/1) ... [2021-11-19 13:20:41,626 INFO L137 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 154 [2021-11-19 13:20:41,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 13:20:41,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 13:20:41,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 13:20:41,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 13:20:41,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41" (1/1) ... [2021-11-19 13:20:41,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41" (1/1) ... [2021-11-19 13:20:41,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41" (1/1) ... [2021-11-19 13:20:41,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41" (1/1) ... [2021-11-19 13:20:41,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41" (1/1) ... [2021-11-19 13:20:41,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41" (1/1) ... [2021-11-19 13:20:41,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41" (1/1) ... [2021-11-19 13:20:41,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 13:20:41,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 13:20:41,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 13:20:41,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 13:20:41,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41" (1/1) ... [2021-11-19 13:20:41,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:20:41,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:20:41,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 13:20:41,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 13:20:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-19 13:20:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-19 13:20:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-19 13:20:41,793 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-19 13:20:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-19 13:20:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 13:20:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 13:20:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-19 13:20:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-19 13:20:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 13:20:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-19 13:20:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 13:20:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 13:20:41,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 13:20:41,951 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 13:20:41,953 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 13:20:42,328 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 13:20:42,425 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 13:20:42,425 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-19 13:20:42,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:20:42 BoogieIcfgContainer [2021-11-19 13:20:42,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 13:20:42,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 13:20:42,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 13:20:42,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 13:20:42,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:20:40" (1/3) ... [2021-11-19 13:20:42,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cdd2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:20:42, skipping insertion in model container [2021-11-19 13:20:42,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:20:41" (2/3) ... [2021-11-19 13:20:42,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cdd2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:20:42, skipping insertion in model container [2021-11-19 13:20:42,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:20:42" (3/3) ... [2021-11-19 13:20:42,437 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2021-11-19 13:20:42,449 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 13:20:42,449 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 13:20:42,511 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 13:20:42,538 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-19 13:20:42,539 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 13:20:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 13:20:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-19 13:20:42,616 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:20:42,616 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:20:42,617 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:20:42,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:20:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 647624886, now seen corresponding path program 1 times [2021-11-19 13:20:42,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:20:42,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701330673] [2021-11-19 13:20:42,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:20:42,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:20:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:20:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-19 13:20:42,969 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:20:42,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701330673] [2021-11-19 13:20:42,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701330673] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:20:42,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:20:42,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 13:20:42,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137445296] [2021-11-19 13:20:42,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:20:42,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 13:20:42,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:20:43,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 13:20:43,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 13:20:43,014 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 13:20:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:20:43,148 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2021-11-19 13:20:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 13:20:43,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2021-11-19 13:20:43,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:20:43,158 INFO L225 Difference]: With dead ends: 32 [2021-11-19 13:20:43,158 INFO L226 Difference]: Without dead ends: 18 [2021-11-19 13:20:43,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 13:20:43,166 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:20:43,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:20:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-19 13:20:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-19 13:20:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 13:20:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2021-11-19 13:20:43,212 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 16 [2021-11-19 13:20:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:20:43,213 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-11-19 13:20:43,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 13:20:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2021-11-19 13:20:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-19 13:20:43,217 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:20:43,217 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:20:43,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 13:20:43,218 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:20:43,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:20:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash 647610967, now seen corresponding path program 1 times [2021-11-19 13:20:43,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:20:43,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415299135] [2021-11-19 13:20:43,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:20:43,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:20:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:20:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-19 13:20:43,332 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:20:43,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415299135] [2021-11-19 13:20:43,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415299135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:20:43,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:20:43,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 13:20:43,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595007292] [2021-11-19 13:20:43,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:20:43,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 13:20:43,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:20:43,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 13:20:43,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 13:20:43,336 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 13:20:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:20:44,040 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2021-11-19 13:20:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 13:20:44,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2021-11-19 13:20:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:20:44,042 INFO L225 Difference]: With dead ends: 31 [2021-11-19 13:20:44,042 INFO L226 Difference]: Without dead ends: 19 [2021-11-19 13:20:44,042 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-19 13:20:44,044 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-19 13:20:44,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-19 13:20:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-19 13:20:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-19 13:20:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 13:20:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-11-19 13:20:44,052 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2021-11-19 13:20:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:20:44,052 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-11-19 13:20:44,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-19 13:20:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2021-11-19 13:20:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-19 13:20:44,054 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:20:44,054 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:20:44,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 13:20:44,055 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:20:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:20:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash -687658553, now seen corresponding path program 1 times [2021-11-19 13:20:44,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:20:44,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537383319] [2021-11-19 13:20:44,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:20:44,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:20:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:20:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-19 13:20:44,152 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:20:44,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537383319] [2021-11-19 13:20:44,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537383319] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:20:44,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:20:44,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 13:20:44,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948654691] [2021-11-19 13:20:44,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:20:44,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 13:20:44,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:20:44,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 13:20:44,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 13:20:44,155 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 13:20:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:20:44,673 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2021-11-19 13:20:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 13:20:44,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2021-11-19 13:20:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:20:44,675 INFO L225 Difference]: With dead ends: 26 [2021-11-19 13:20:44,675 INFO L226 Difference]: Without dead ends: 20 [2021-11-19 13:20:44,675 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-19 13:20:44,677 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 13:20:44,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-19 13:20:44,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-19 13:20:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-19 13:20:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 13:20:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-11-19 13:20:44,704 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2021-11-19 13:20:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:20:44,705 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-11-19 13:20:44,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-19 13:20:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2021-11-19 13:20:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-19 13:20:44,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:20:44,709 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:20:44,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 13:20:44,710 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:20:44,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:20:44,713 INFO L85 PathProgramCache]: Analyzing trace with hash 67418736, now seen corresponding path program 1 times [2021-11-19 13:20:44,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:20:44,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807104995] [2021-11-19 13:20:44,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:20:44,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:20:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:20:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 13:20:47,178 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:20:47,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807104995] [2021-11-19 13:20:47,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807104995] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:20:47,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419002666] [2021-11-19 13:20:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:20:47,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:20:47,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:20:47,185 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:20:47,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 13:20:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:20:47,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 111 conjunts are in the unsatisfiable core [2021-11-19 13:20:47,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:20:47,741 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-19 13:20:47,888 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 9 treesize of output 7 [2021-11-19 13:20:48,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:20:48,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-19 13:20:48,333 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 13:20:48,337 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 21 treesize of output 17 [2021-11-19 13:20:48,443 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 13 treesize of output 9 [2021-11-19 13:20:48,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:20:48,620 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-19 13:20:48,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-11-19 13:20:48,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, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2021-11-19 13:20:48,823 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-19 13:20:48,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 48 [2021-11-19 13:20:48,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2021-11-19 13:20:49,163 INFO L354 Elim1Store]: treesize reduction 268, result has 11.8 percent of original size [2021-11-19 13:20:49,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 310 treesize of output 154 [2021-11-19 13:20:49,177 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:20:49,181 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 266 [2021-11-19 13:20:49,229 INFO L354 Elim1Store]: treesize reduction 250, result has 12.9 percent of original size [2021-11-19 13:20:49,230 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 2 case distinctions, treesize of input 266 treesize of output 185 [2021-11-19 13:20:51,639 INFO L354 Elim1Store]: treesize reduction 104, result has 1.0 percent of original size [2021-11-19 13:20:51,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 63 [2021-11-19 13:20:51,650 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 51 treesize of output 41 [2021-11-19 13:20:51,661 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-19 13:20:51,662 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 38 treesize of output 32 [2021-11-19 13:20:51,782 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:20:51,784 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-11-19 13:20:51,787 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:20:51,789 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76 [2021-11-19 13:20:58,104 INFO L354 Elim1Store]: treesize reduction 295, result has 10.3 percent of original size [2021-11-19 13:20:58,105 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 252 treesize of output 259 [2021-11-19 13:20:58,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:20:58,294 INFO L354 Elim1Store]: treesize reduction 663, result has 7.0 percent of original size [2021-11-19 13:20:58,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 231 treesize of output 150 [2021-11-19 13:20:58,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:20:58,340 INFO L354 Elim1Store]: treesize reduction 82, result has 17.2 percent of original size [2021-11-19 13:20:58,341 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 2 case distinctions, treesize of input 220 treesize of output 184 [2021-11-19 13:20:58,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:20:58,374 INFO L354 Elim1Store]: treesize reduction 64, result has 28.1 percent of original size [2021-11-19 13:20:58,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 209 treesize of output 209 [2021-11-19 13:20:59,580 INFO L354 Elim1Store]: treesize reduction 242, result has 0.4 percent of original size [2021-11-19 13:20:59,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 4483 treesize of output 3291 [2021-11-19 13:20:59,668 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-19 13:20:59,669 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 4908 treesize of output 4550 [2021-11-19 13:20:59,822 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:20:59,866 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4530 [2021-11-19 13:20:59,961 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:20:59,999 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4536 [2021-11-19 13:21:00,063 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-19 13:21:00,064 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 4536 treesize of output 4524 [2021-11-19 13:21:00,215 INFO L354 Elim1Store]: treesize reduction 239, result has 9.8 percent of original size [2021-11-19 13:21:00,216 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 4521 treesize of output 4495 [2021-11-19 13:21:00,293 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 13:21:01,503 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 23 treesize of output 11 [2021-11-19 13:21:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 13:21:01,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:21:01,743 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-19 13:21:01,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [907224313] [2021-11-19 13:21:01,764 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-19 13:21:01,764 INFO L166 IcfgInterpreter]: Building call graph [2021-11-19 13:21:01,769 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-19 13:21:01,774 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-19 13:21:01,775 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-19 13:21:01,813 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:21:01,814 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-19 13:21:01,815 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:21:01,816 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-19 13:21:01,816 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-19 13:21:01,817 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:21:01,818 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-11-19 13:21:01,819 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-11-19 13:21:01,828 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1b03e84a at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:92) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:571) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.doElimAllRec(ElimStorePlain.java:444) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:242) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:402) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:228) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 13:21:01,831 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-19 13:21:01,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-11-19 13:21:01,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168220534] [2021-11-19 13:21:01,831 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-19 13:21:01,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-19 13:21:01,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:21:01,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-19 13:21:01,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1317, Unknown=2, NotChecked=0, Total=1406 [2021-11-19 13:21:01,835 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 13:21:01,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 13:21:01,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=87, Invalid=1317, Unknown=2, NotChecked=0, Total=1406 [2021-11-19 13:21:01,837 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 13:21:01,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 13:21:01,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 13:21:02,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:21:02,065 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1b03e84a at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 13:21:02,067 INFO L158 Benchmark]: Toolchain (without parser) took 21101.62ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 48.7MB in the beginning and 51.3MB in the end (delta: -2.6MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2021-11-19 13:21:02,067 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 88.1MB. Free memory was 66.9MB in the beginning and 66.8MB in the end (delta: 94.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 13:21:02,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.67ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 48.5MB in the beginning and 72.4MB in the end (delta: -23.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-19 13:21:02,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.74ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 70.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 13:21:02,069 INFO L158 Benchmark]: Boogie Preprocessor took 71.04ms. Allocated memory is still 107.0MB. Free memory was 70.3MB in the beginning and 68.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 13:21:02,069 INFO L158 Benchmark]: RCFGBuilder took 723.29ms. Allocated memory is still 107.0MB. Free memory was 68.2MB in the beginning and 43.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-11-19 13:21:02,069 INFO L158 Benchmark]: TraceAbstraction took 19635.80ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 42.5MB in the beginning and 51.3MB in the end (delta: -8.7MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2021-11-19 13:21:02,071 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 88.1MB. Free memory was 66.9MB in the beginning and 66.8MB in the end (delta: 94.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.67ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 48.5MB in the beginning and 72.4MB in the end (delta: -23.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.74ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 70.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.04ms. Allocated memory is still 107.0MB. Free memory was 70.3MB in the beginning and 68.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 723.29ms. Allocated memory is still 107.0MB. Free memory was 68.2MB in the beginning and 43.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19635.80ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 42.5MB in the beginning and 51.3MB in the end (delta: -8.7MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1b03e84a de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1b03e84a: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-19 13:21:02,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 13:21:04,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 13:21:04,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 13:21:04,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 13:21:04,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 13:21:04,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 13:21:04,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 13:21:04,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 13:21:04,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 13:21:04,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 13:21:04,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 13:21:04,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 13:21:04,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 13:21:04,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 13:21:04,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 13:21:04,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 13:21:04,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 13:21:04,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 13:21:04,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 13:21:04,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 13:21:04,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 13:21:04,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 13:21:04,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 13:21:04,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 13:21:04,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 13:21:04,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 13:21:04,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 13:21:04,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 13:21:04,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 13:21:04,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 13:21:04,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 13:21:04,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 13:21:04,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 13:21:04,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 13:21:04,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 13:21:04,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 13:21:04,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 13:21:04,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 13:21:04,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 13:21:04,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 13:21:04,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 13:21:04,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-19 13:21:04,714 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 13:21:04,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 13:21:04,715 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 13:21:04,716 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 13:21:04,716 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 13:21:04,717 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 13:21:04,717 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 13:21:04,717 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 13:21:04,717 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 13:21:04,718 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 13:21:04,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 13:21:04,720 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 13:21:04,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 13:21:04,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 13:21:04,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 13:21:04,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 13:21:04,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 13:21:04,722 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 13:21:04,722 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 13:21:04,723 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 13:21:04,723 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 13:21:04,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 13:21:04,724 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 13:21:04,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 13:21:04,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 13:21:04,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 13:21:04,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 13:21:04,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:21:04,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 13:21:04,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 13:21:04,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 13:21:04,726 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-19 13:21:04,727 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 13:21:04,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 13:21:04,728 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 13:21:04,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 13:21:04,728 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/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_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2021-11-19 13:21:05,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 13:21:05,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 13:21:05,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 13:21:05,149 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 13:21:05,149 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 13:21:05,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2021-11-19 13:21:05,230 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/data/c511ef0cd/4ec1b0e05915468f8290587703c3ca32/FLAG9508a409a [2021-11-19 13:21:05,885 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 13:21:05,886 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2021-11-19 13:21:05,906 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/data/c511ef0cd/4ec1b0e05915468f8290587703c3ca32/FLAG9508a409a [2021-11-19 13:21:06,165 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/data/c511ef0cd/4ec1b0e05915468f8290587703c3ca32 [2021-11-19 13:21:06,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 13:21:06,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 13:21:06,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 13:21:06,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 13:21:06,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 13:21:06,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74037bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06, skipping insertion in model container [2021-11-19 13:21:06,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 13:21:06,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:21:06,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2021-11-19 13:21:06,677 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:21:06,697 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 13:21:06,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2021-11-19 13:21:06,747 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:21:06,784 INFO L208 MainTranslator]: Completed translation [2021-11-19 13:21:06,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06 WrapperNode [2021-11-19 13:21:06,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 13:21:06,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 13:21:06,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 13:21:06,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 13:21:06,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,846 INFO L137 Inliner]: procedures = 130, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 155 [2021-11-19 13:21:06,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 13:21:06,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 13:21:06,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 13:21:06,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 13:21:06,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 13:21:06,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 13:21:06,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 13:21:06,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 13:21:06,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06" (1/1) ... [2021-11-19 13:21:06,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:21:06,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:21:06,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 13:21:07,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 13:21:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-19 13:21:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-19 13:21:07,052 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-19 13:21:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-19 13:21:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 13:21:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 13:21:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-19 13:21:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-19 13:21:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 13:21:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-19 13:21:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-19 13:21:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 13:21:07,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 13:21:07,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 13:21:07,250 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 13:21:07,252 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 13:21:08,060 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 13:21:08,067 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 13:21:08,067 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-19 13:21:08,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:08 BoogieIcfgContainer [2021-11-19 13:21:08,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 13:21:08,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 13:21:08,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 13:21:08,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 13:21:08,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:21:06" (1/3) ... [2021-11-19 13:21:08,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1b7b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:08, skipping insertion in model container [2021-11-19 13:21:08,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:06" (2/3) ... [2021-11-19 13:21:08,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1b7b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:08, skipping insertion in model container [2021-11-19 13:21:08,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:08" (3/3) ... [2021-11-19 13:21:08,087 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2021-11-19 13:21:08,093 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 13:21:08,093 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 13:21:08,152 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 13:21:08,159 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-19 13:21:08,159 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 13:21:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 13:21:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 13:21:08,188 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:21:08,188 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:21:08,189 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:21:08,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:21:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1237252285, now seen corresponding path program 1 times [2021-11-19 13:21:08,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:21:08,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000635671] [2021-11-19 13:21:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:21:08,219 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:21:08,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:21:08,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:21:08,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 13:21:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:21:08,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-19 13:21:08,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:21:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-19 13:21:08,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:21:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-19 13:21:08,576 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:21:08,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000635671] [2021-11-19 13:21:08,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000635671] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:21:08,577 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:21:08,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-19 13:21:08,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041612779] [2021-11-19 13:21:08,580 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:21:08,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 13:21:08,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:21:08,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 13:21:08,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 13:21:08,617 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 13:21:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:21:08,640 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2021-11-19 13:21:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 13:21:08,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-11-19 13:21:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:21:08,650 INFO L225 Difference]: With dead ends: 67 [2021-11-19 13:21:08,651 INFO L226 Difference]: Without dead ends: 30 [2021-11-19 13:21:08,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 13:21:08,658 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 13:21:08,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 13:21:08,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-19 13:21:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-11-19 13:21:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 13:21:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-11-19 13:21:08,698 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 25 [2021-11-19 13:21:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:21:08,700 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-11-19 13:21:08,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-19 13:21:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2021-11-19 13:21:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-19 13:21:08,702 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:21:08,702 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:21:08,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-19 13:21:08,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:21:08,916 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:21:08,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:21:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1104710801, now seen corresponding path program 1 times [2021-11-19 13:21:08,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:21:08,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434551322] [2021-11-19 13:21:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:21:08,918 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:21:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:21:08,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:21:08,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 13:21:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:21:09,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 13:21:09,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:21:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 13:21:09,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:21:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-19 13:21:09,242 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:21:09,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434551322] [2021-11-19 13:21:09,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434551322] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:21:09,242 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:21:09,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-19 13:21:09,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472112363] [2021-11-19 13:21:09,243 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:21:09,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 13:21:09,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:21:09,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 13:21:09,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-19 13:21:09,248 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-19 13:21:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:21:09,290 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2021-11-19 13:21:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 13:21:09,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2021-11-19 13:21:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:21:09,300 INFO L225 Difference]: With dead ends: 56 [2021-11-19 13:21:09,300 INFO L226 Difference]: Without dead ends: 35 [2021-11-19 13:21:09,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-19 13:21:09,303 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 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-19 13:21:09,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 13:21:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-19 13:21:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2021-11-19 13:21:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 13:21:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-11-19 13:21:09,321 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2021-11-19 13:21:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:21:09,322 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-11-19 13:21:09,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-19 13:21:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2021-11-19 13:21:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-19 13:21:09,325 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:21:09,325 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:21:09,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-19 13:21:09,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:21:09,542 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:21:09,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:21:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash -313226979, now seen corresponding path program 1 times [2021-11-19 13:21:09,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:21:09,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711512575] [2021-11-19 13:21:09,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:21:09,544 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:21:09,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:21:09,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:21:09,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-19 13:21:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:21:09,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-19 13:21:09,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:21:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-19 13:21:09,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:21:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-19 13:21:10,466 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-19 13:21:10,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711512575] [2021-11-19 13:21:10,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711512575] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:21:10,466 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:21:10,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-19 13:21:10,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943332289] [2021-11-19 13:21:10,467 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:21:10,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 13:21:10,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-19 13:21:10,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 13:21:10,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 13:21:10,469 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-19 13:21:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:21:10,532 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2021-11-19 13:21:10,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 13:21:10,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2021-11-19 13:21:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:21:10,534 INFO L225 Difference]: With dead ends: 43 [2021-11-19 13:21:10,535 INFO L226 Difference]: Without dead ends: 32 [2021-11-19 13:21:10,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-19 13:21:10,536 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 13:21:10,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 13:21:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-11-19 13:21:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-11-19 13:21:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-19 13:21:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-11-19 13:21:10,544 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 35 [2021-11-19 13:21:10,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:21:10,545 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-11-19 13:21:10,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-19 13:21:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-11-19 13:21:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-19 13:21:10,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:21:10,547 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:21:10,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-19 13:21:10,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 [2021-11-19 13:21:10,764 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 13:21:10,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:21:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash 415590512, now seen corresponding path program 1 times [2021-11-19 13:21:10,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-19 13:21:10,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154968812] [2021-11-19 13:21:10,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:21:10,767 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 13:21:10,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat [2021-11-19 13:21:10,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 13:21:10,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df14d637-8fe0-4f53-b79e-6a4c099e1b71/bin/utaipan-UbGMyvGFUs/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-19 13:21:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:21:11,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 80 conjunts are in the unsatisfiable core [2021-11-19 13:21:11,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:21:11,137 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-19 13:21:11,226 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 16 treesize of output 14 [2021-11-19 13:21:11,476 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-19 13:21:11,477 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 26 treesize of output 33 [2021-11-19 13:21:11,923 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-19 13:21:11,924 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 40 treesize of output 36 [2021-11-19 13:21:12,080 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 11 treesize of output 7 [2021-11-19 13:21:12,362 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-11-19 13:21:12,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 63 [2021-11-19 13:21:12,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-19 13:21:12,802 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-19 13:21:13,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2021-11-19 13:21:13,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2021-11-19 13:21:14,440 INFO L354 Elim1Store]: treesize reduction 122, result has 16.4 percent of original size [2021-11-19 13:21:14,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 194 treesize of output 130 [2021-11-19 13:21:14,510 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-19 13:21:14,511 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 1 case distinctions, treesize of input 169 treesize of output 144 [2021-11-19 13:21:14,523 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:21:14,527 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 158 [2021-11-19 13:21:14,606 INFO L354 Elim1Store]: treesize reduction 92, result has 20.0 percent of original size [2021-11-19 13:21:14,607 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 2 case distinctions, treesize of input 158 treesize of output 121 [2021-11-19 13:21:19,933 INFO L354 Elim1Store]: treesize reduction 93, result has 4.1 percent of original size [2021-11-19 13:21:19,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 234 treesize of output 145 [2021-11-19 13:21:19,964 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-19 13:21:19,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 123 treesize of output 117 [2021-11-19 13:21:19,987 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-19 13:21:19,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 32 [2021-11-19 13:21:19,999 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 15 treesize of output 11 [2021-11-19 13:21:20,001 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 13:21:20,349 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:21:20,351 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-11-19 13:21:20,355 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:21:20,356 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76 [2021-11-19 13:21:24,067 INFO L354 Elim1Store]: treesize reduction 223, result has 11.2 percent of original size [2021-11-19 13:21:24,070 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 305 treesize of output 312 [2021-11-19 13:21:24,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:21:24,955 INFO L354 Elim1Store]: treesize reduction 757, result has 6.7 percent of original size [2021-11-19 13:21:24,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 17 case distinctions, treesize of input 284 treesize of output 217 [2021-11-19 13:21:25,103 INFO L354 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2021-11-19 13:21:25,104 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 273 treesize of output 277 [2021-11-19 13:21:25,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:21:25,349 INFO L354 Elim1Store]: treesize reduction 603, result has 7.7 percent of original size [2021-11-19 13:21:25,351 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 8 case distinctions, treesize of input 204 treesize of output 197 [2021-11-19 13:22:09,038 WARN L227 SmtUtils]: Spent 33.33s on a formula simplification. DAG size of input: 326 DAG size of output: 61 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-19 13:22:09,040 INFO L354 Elim1Store]: treesize reduction 1682, result has 5.9 percent of original size [2021-11-19 13:22:09,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 39 case distinctions, treesize of input 645 treesize of output 379 [2021-11-19 13:22:15,355 WARN L227 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 226 DAG size of output: 50 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-19 13:22:15,356 INFO L354 Elim1Store]: treesize reduction 1352, result has 6.4 percent of original size [2021-11-19 13:22:15,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 800 treesize of output 572 [2021-11-19 13:22:15,397 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:22:15,401 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 894 [2021-11-19 13:22:15,415 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:22:15,425 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 899 [2021-11-19 13:22:15,664 INFO L354 Elim1Store]: treesize reduction 797, result has 8.1 percent of original size [2021-11-19 13:22:15,669 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 899 treesize of output 806 [2021-11-19 13:22:15,739 INFO L354 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2021-11-19 13:22:15,740 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 745 treesize of output 639 [2021-11-19 13:22:15,752 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 13:22:23,502 INFO L354 Elim1Store]: treesize reduction 319, result has 3.0 percent of original size [2021-11-19 13:22:23,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 489 treesize of output 269 [2021-11-19 13:22:23,627 INFO L354 Elim1Store]: treesize reduction 230, result has 6.1 percent of original size [2021-11-19 13:22:23,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 99 [2021-11-19 13:22:24,202 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 15 treesize of output 7 [2021-11-19 13:22:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 13:22:24,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:22:24,832 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:22:24,833 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 216 [2021-11-19 13:22:24,844 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:22:24,855 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 216 [2021-11-19 13:22:24,859 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:22:24,861 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 206 [2021-11-19 13:22:24,866 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:22:24,867 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 221 [2021-11-19 13:22:27,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse3 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_DerPreprocessor_9)))) (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse1 v_DerPreprocessor_6))) (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-11-19 13:22:29,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_DerPreprocessor_9)))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2021-11-19 13:22:31,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse5)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse1 (select .cse9 .cse6)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (store |c_#memory_int| .cse5 (store (select |c_#memory_int| .cse5) .cse6 v_DerPreprocessor_9)))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse5 (store .cse9 .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (store .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 .cse5) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2021-11-19 13:22:34,080 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:22:34,082 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 683 [2021-11-19 13:22:34,095 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:22:34,097 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 691 [2021-11-19 13:22:34,103 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:22:34,105 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1563 [2021-11-19 13:22:34,112 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:22:34,113 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2075 [2021-11-19 13:23:07,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (= (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse5)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select .cse9 .cse6)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (store |c_#memory_int| .cse5 (store (select |c_#memory_int| .cse5) .cse6 v_DerPreprocessor_9)))) (store .cse3 |c_node_create_#res#1.base| (store (store (select .cse3 |c_node_create_#res#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse5 (store .cse9 .cse6 |c_node_create_#res#1.base|)))) (store .cse8 |c_node_create_#res#1.base| (store (store (select .cse8 |c_node_create_#res#1.base|) .cse4 .cse5) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |c_node_create_#res#1.base|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse11 |c_node_create_#res#1.base| (store (store (select .cse11 |c_node_create_#res#1.base|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|) (exists ((v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse20 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|)) (.cse21 (bvadd (_ bv8 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse24 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse20 (_ bv0 32)) .cse21 v_DerPreprocessor_12)))) (let ((.cse28 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse20 (_ bv0 32)) .cse21 v_DerPreprocessor_13))) (.cse18 (select (select .cse24 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse25 (select .cse24 .cse18)) (.cse19 (select (select .cse28 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse13 (select .cse25 .cse19)) (.cse14 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse16 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse12 (let ((.cse15 (let ((.cse17 (store |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_11) .cse20 v_DerPreprocessor_10) .cse21 |v_node_create_~data#1_26|)))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 v_DerPreprocessor_9))))) (store .cse15 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse15 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_DerPreprocessor_6))) (select (select (let ((.cse22 (let ((.cse23 (store .cse24 .cse18 (store .cse25 .cse19 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))) (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 .cse18) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse13))))) (store .cse22 .cse13 (store (select .cse22 .cse13) .cse14 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse26 (let ((.cse27 (store .cse28 .cse18 (store (select .cse28 .cse18) .cse19 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse27 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse27 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 .cse19) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse26 .cse13 (store (select .cse26 .cse13) .cse14 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))))) (bvult |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))))) is different from false [2021-11-19 13:23:09,648 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (= (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse5)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select .cse9 .cse6)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (store |c_#memory_int| .cse5 (store (select |c_#memory_int| .cse5) .cse6 v_DerPreprocessor_9)))) (store .cse3 |c_node_create_#res#1.base| (store (store (select .cse3 |c_node_create_#res#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse5 (store .cse9 .cse6 |c_node_create_#res#1.base|)))) (store .cse8 |c_node_create_#res#1.base| (store (store (select .cse8 |c_node_create_#res#1.base|) .cse4 .cse5) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |c_node_create_#res#1.base|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse11 |c_node_create_#res#1.base| (store (store (select .cse11 |c_node_create_#res#1.base|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|) (exists ((v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse20 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|)) (.cse21 (bvadd (_ bv8 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse24 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse20 (_ bv0 32)) .cse21 v_DerPreprocessor_12)))) (let ((.cse28 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse20 (_ bv0 32)) .cse21 v_DerPreprocessor_13))) (.cse18 (select (select .cse24 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse25 (select .cse24 .cse18)) (.cse19 (select (select .cse28 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse13 (select .cse25 .cse19)) (.cse14 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse16 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse12 (let ((.cse15 (let ((.cse17 (store |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_11) .cse20 v_DerPreprocessor_10) .cse21 |v_node_create_~data#1_26|)))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 v_DerPreprocessor_9))))) (store .cse15 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse15 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_DerPreprocessor_6))) (select (select (let ((.cse22 (let ((.cse23 (store .cse24 .cse18 (store .cse25 .cse19 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))) (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 .cse18) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse13))))) (store .cse22 .cse13 (store (select .cse22 .cse13) .cse14 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse26 (let ((.cse27 (store .cse28 .cse18 (store (select .cse28 .cse18) .cse19 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse27 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse27 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 .cse19) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse26 .cse13 (store (select .cse26 .cse13) .cse14 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))))) (bvult |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))))) is different from true [2021-11-19 13:23:24,875 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:23:24,880 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2745 [2021-11-19 13:23:24,890 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:23:24,894 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3257 [2021-11-19 13:23:24,904 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:23:24,906 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3265 [2021-11-19 13:23:24,913 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:23:24,915 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4137 [2021-11-19 13:24:16,942 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse8 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)) (.cse9 (bvadd |node_create_~temp~0#1.offset| (_ bv8 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_17)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_15))) (.cse6 (select (select .cse12 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse13 (select .cse12 .cse6)) (.cse7 (select (select .cse16 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select .cse13 .cse7)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (let ((.cse5 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_16) .cse8 v_DerPreprocessor_14) .cse9 |node_create_~data#1|)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_9))))) (store .cse3 |c_node_create_~temp~0#1.base| (store (store (select .cse3 |c_node_create_~temp~0#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse10 (let ((.cse11 (store .cse12 .cse6 (store .cse13 .cse7 |c_node_create_~temp~0#1.base|)))) (store .cse11 |c_node_create_~temp~0#1.base| (store (store (select .cse11 |c_node_create_~temp~0#1.base|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |c_node_create_~temp~0#1.base|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse14 (let ((.cse15 (store .cse16 .cse6 (store (select .cse16 .cse6) .cse7 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse15 |c_node_create_~temp~0#1.base| (store (store (select .cse15 |c_node_create_~temp~0#1.base|) .cse4 .cse7) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse14 .cse1 (store (select .cse14 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (and (not (= (let ((.cse25 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|)) (.cse26 (bvadd (_ bv8 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse29 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_12)))) (let ((.cse33 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_13))) (.cse23 (select (select .cse29 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse30 (select .cse29 .cse23)) (.cse24 (select (select .cse33 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse18 (select .cse30 .cse24)) (.cse19 (bvadd (_ bv4 32) v_prenex_6)) (.cse21 (bvadd (_ bv4 32) v_prenex_5))) (select (select (let ((.cse17 (let ((.cse20 (let ((.cse22 (store |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_11) .cse25 v_DerPreprocessor_10) .cse26 |v_node_create_~data#1_26|)))) (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 v_prenex_1))))) (store .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 v_prenex_2) v_prenex_5 v_prenex_3))))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 v_prenex_4))) (select (select (let ((.cse27 (let ((.cse28 (store .cse29 .cse23 (store .cse30 .cse24 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))) (store .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse23) v_prenex_5 .cse18))))) (store .cse27 .cse18 (store (select .cse27 .cse18) .cse19 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse31 (let ((.cse32 (store .cse33 .cse23 (store (select .cse33 .cse23) .cse24 v_prenex_5)))) (store .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse24) v_prenex_5 v_prenex_6))))) (store .cse31 .cse18 (store (select .cse31 .cse18) .cse19 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))))) (bvult |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))))) is different from false [2021-11-19 13:24:18,948 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse8 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)) (.cse9 (bvadd |node_create_~temp~0#1.offset| (_ bv8 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_17)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_15))) (.cse6 (select (select .cse12 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse13 (select .cse12 .cse6)) (.cse7 (select (select .cse16 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select .cse13 .cse7)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (let ((.cse5 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_16) .cse8 v_DerPreprocessor_14) .cse9 |node_create_~data#1|)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_9))))) (store .cse3 |c_node_create_~temp~0#1.base| (store (store (select .cse3 |c_node_create_~temp~0#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse10 (let ((.cse11 (store .cse12 .cse6 (store .cse13 .cse7 |c_node_create_~temp~0#1.base|)))) (store .cse11 |c_node_create_~temp~0#1.base| (store (store (select .cse11 |c_node_create_~temp~0#1.base|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |c_node_create_~temp~0#1.base|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse14 (let ((.cse15 (store .cse16 .cse6 (store (select .cse16 .cse6) .cse7 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse15 |c_node_create_~temp~0#1.base| (store (store (select .cse15 |c_node_create_~temp~0#1.base|) .cse4 .cse7) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse14 .cse1 (store (select .cse14 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (and (not (= (let ((.cse25 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|)) (.cse26 (bvadd (_ bv8 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse29 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_12)))) (let ((.cse33 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_13))) (.cse23 (select (select .cse29 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse30 (select .cse29 .cse23)) (.cse24 (select (select .cse33 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse18 (select .cse30 .cse24)) (.cse19 (bvadd (_ bv4 32) v_prenex_6)) (.cse21 (bvadd (_ bv4 32) v_prenex_5))) (select (select (let ((.cse17 (let ((.cse20 (let ((.cse22 (store |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_11) .cse25 v_DerPreprocessor_10) .cse26 |v_node_create_~data#1_26|)))) (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 v_prenex_1))))) (store .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 v_prenex_2) v_prenex_5 v_prenex_3))))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 v_prenex_4))) (select (select (let ((.cse27 (let ((.cse28 (store .cse29 .cse23 (store .cse30 .cse24 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))) (store .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse23) v_prenex_5 .cse18))))) (store .cse27 .cse18 (store (select .cse27 .cse18) .cse19 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse31 (let ((.cse32 (store .cse33 .cse23 (store (select .cse33 .cse23) .cse24 v_prenex_5)))) (store .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse24) v_prenex_5 v_prenex_6))))) (store .cse31 .cse18 (store (select .cse31 .cse18) .cse19 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))))) (bvult |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))))) is different from true [2021-11-19 13:26:22,700 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_29| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_29|)))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse8 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)) (.cse9 (bvadd |node_create_~temp~0#1.offset| (_ bv8 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29| (store (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_17)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_29| (store (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_15))) (.cse6 (select (select .cse12 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse13 (select .cse12 .cse6)) (.cse7 (select (select .cse16 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select .cse13 .cse7)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (let ((.cse5 (store |c_#memory_int| |v_node_create_~temp~0#1.base_29| (store (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| v_DerPreprocessor_16) .cse8 v_DerPreprocessor_14) .cse9 |node_create_~data#1|)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_9))))) (store .cse3 |v_node_create_~temp~0#1.base_29| (store (store (select .cse3 |v_node_create_~temp~0#1.base_29|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse10 (let ((.cse11 (store .cse12 .cse6 (store .cse13 .cse7 |v_node_create_~temp~0#1.base_29|)))) (store .cse11 |v_node_create_~temp~0#1.base_29| (store (store (select .cse11 |v_node_create_~temp~0#1.base_29|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |v_node_create_~temp~0#1.base_29|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse14 (let ((.cse15 (store .cse16 .cse6 (store (select .cse16 .cse6) .cse7 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse15 |v_node_create_~temp~0#1.base_29| (store (store (select .cse15 |v_node_create_~temp~0#1.base_29|) .cse4 .cse7) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse14 .cse1 (store (select .cse14 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (and (not (= (let ((.cse25 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|)) (.cse26 (bvadd (_ bv8 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse29 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_12)))) (let ((.cse33 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_13))) (.cse23 (select (select .cse29 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse30 (select .cse29 .cse23)) (.cse24 (select (select .cse33 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse18 (select .cse30 .cse24)) (.cse19 (bvadd (_ bv4 32) v_prenex_6)) (.cse21 (bvadd (_ bv4 32) v_prenex_5))) (select (select (let ((.cse17 (let ((.cse20 (let ((.cse22 (store |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_11) .cse25 v_DerPreprocessor_10) .cse26 |v_node_create_~data#1_26|)))) (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 v_prenex_1))))) (store .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 v_prenex_2) v_prenex_5 v_prenex_3))))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 v_prenex_4))) (select (select (let ((.cse27 (let ((.cse28 (store .cse29 .cse23 (store .cse30 .cse24 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))) (store .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse23) v_prenex_5 .cse18))))) (store .cse27 .cse18 (store (select .cse27 .cse18) .cse19 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse31 (let ((.cse32 (store .cse33 .cse23 (store (select .cse33 .cse23) .cse24 v_prenex_5)))) (store .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse24) v_prenex_5 v_prenex_6))))) (store .cse31 .cse18 (store (select .cse31 .cse18) .cse19 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))))) (bvult |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))))) (not (bvult |v_node_create_~temp~0#1.base_29| |c_#StackHeapBarrier|)))) is different from true [2021-11-19 13:26:47,224 WARN L227 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 13:26:47,272 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:26:47,275 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6480 [2021-11-19 13:26:47,284 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:26:47,286 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6720 [2021-11-19 13:26:47,547 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 2053627857421 treesize of output 2052515053445