./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30338be39fffa4ca48f26b164131a7bd561f2b23 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30338be39fffa4ca48f26b164131a7bd561f2b23 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_29 term size 33 --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:38:32,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:38:32,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:38:32,602 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:38:32,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:38:32,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:38:32,604 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:38:32,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:38:32,607 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:38:32,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:38:32,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:38:32,608 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:38:32,609 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:38:32,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:38:32,611 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:38:32,611 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:38:32,612 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:38:32,613 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:38:32,615 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:38:32,616 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:38:32,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:38:32,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:38:32,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:38:32,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:38:32,620 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:38:32,621 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:38:32,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:38:32,622 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:38:32,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:38:32,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:38:32,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:38:32,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:38:32,624 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:38:32,624 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:38:32,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:38:32,625 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:38:32,625 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 03:38:32,633 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:38:32,633 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:38:32,634 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:38:32,634 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 03:38:32,634 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 03:38:32,634 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 03:38:32,634 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 03:38:32,635 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 03:38:32,635 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 03:38:32,635 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 03:38:32,635 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 03:38:32,635 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:38:32,636 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:38:32,636 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:38:32,636 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:38:32,636 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:38:32,636 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:38:32,636 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:38:32,636 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:38:32,636 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:38:32,637 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:38:32,637 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:38:32,637 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:38:32,637 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:38:32,637 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:38:32,637 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:38:32,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:38:32,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:38:32,638 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:38:32,638 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:38:32,638 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 03:38:32,638 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:38:32,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:38:32,638 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 03:38:32,638 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan 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(__VERIFIER_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 -> 30338be39fffa4ca48f26b164131a7bd561f2b23 [2018-11-10 03:38:32,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:38:32,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:38:32,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:38:32,676 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:38:32,677 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:38:32,677 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 03:38:32,724 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/data/a6fcd1115/c451874d50f044ab983ec152b39832c5/FLAGcf93dd555 [2018-11-10 03:38:33,101 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:38:33,102 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 03:38:33,110 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/data/a6fcd1115/c451874d50f044ab983ec152b39832c5/FLAGcf93dd555 [2018-11-10 03:38:33,122 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/data/a6fcd1115/c451874d50f044ab983ec152b39832c5 [2018-11-10 03:38:33,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:38:33,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:38:33,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:38:33,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:38:33,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:38:33,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:38:33" (1/1) ... [2018-11-10 03:38:33,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2863403e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33, skipping insertion in model container [2018-11-10 03:38:33,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:38:33" (1/1) ... [2018-11-10 03:38:33,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:38:33,173 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:38:33,401 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:38:33,411 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:38:33,448 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:38:33,489 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:38:33,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33 WrapperNode [2018-11-10 03:38:33,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:38:33,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:38:33,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:38:33,491 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:38:33,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33" (1/1) ... [2018-11-10 03:38:33,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33" (1/1) ... [2018-11-10 03:38:33,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:38:33,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:38:33,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:38:33,577 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:38:33,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33" (1/1) ... [2018-11-10 03:38:33,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33" (1/1) ... [2018-11-10 03:38:33,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33" (1/1) ... [2018-11-10 03:38:33,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33" (1/1) ... [2018-11-10 03:38:33,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33" (1/1) ... [2018-11-10 03:38:33,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33" (1/1) ... [2018-11-10 03:38:33,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33" (1/1) ... [2018-11-10 03:38:33,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:38:33,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:38:33,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:38:33,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:38:33,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:38:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-10 03:38:33,660 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-10 03:38:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 03:38:33,660 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 03:38:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-11-10 03:38:33,660 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-11-10 03:38:33,661 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-10 03:38:33,661 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-10 03:38:33,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:38:33,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:38:33,661 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:38:33,661 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:38:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-10 03:38:33,662 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-10 03:38:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:38:33,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:38:34,049 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:38:34,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:38:34 BoogieIcfgContainer [2018-11-10 03:38:34,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:38:34,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:38:34,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:38:34,054 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:38:34,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:38:33" (1/3) ... [2018-11-10 03:38:34,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12307218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:38:34, skipping insertion in model container [2018-11-10 03:38:34,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:33" (2/3) ... [2018-11-10 03:38:34,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12307218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:38:34, skipping insertion in model container [2018-11-10 03:38:34,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:38:34" (3/3) ... [2018-11-10 03:38:34,058 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 03:38:34,068 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:38:34,077 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:38:34,094 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:38:34,127 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:38:34,128 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:38:34,128 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:38:34,128 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:38:34,128 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:38:34,128 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:38:34,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:38:34,129 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:38:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-10 03:38:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 03:38:34,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:34,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:34,156 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:34,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:34,162 INFO L82 PathProgramCache]: Analyzing trace with hash 305391789, now seen corresponding path program 1 times [2018-11-10 03:38:34,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:38:34,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:34,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:34,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:34,224 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:38:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:38:34,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:34,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:38:34,338 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:38:34,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 03:38:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:38:34,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:38:34,356 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-11-10 03:38:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:34,381 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2018-11-10 03:38:34,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:38:34,382 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-10 03:38:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:34,390 INFO L225 Difference]: With dead ends: 96 [2018-11-10 03:38:34,390 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 03:38:34,393 INFO L605 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 [2018-11-10 03:38:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 03:38:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 03:38:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 03:38:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-10 03:38:34,434 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 29 [2018-11-10 03:38:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:34,434 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 03:38:34,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 03:38:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-10 03:38:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 03:38:34,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:34,437 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:34,437 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:34,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:34,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2050074932, now seen corresponding path program 1 times [2018-11-10 03:38:34,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:38:34,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:34,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:34,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:34,441 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:38:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:38:34,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:34,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 03:38:34,645 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:38:34,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 03:38:34,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:38:34,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:38:34,648 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 10 states. [2018-11-10 03:38:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:34,838 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-10 03:38:34,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 03:38:34,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-10 03:38:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:34,840 INFO L225 Difference]: With dead ends: 58 [2018-11-10 03:38:34,840 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 03:38:34,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:38:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 03:38:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-11-10 03:38:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 03:38:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-10 03:38:34,850 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 31 [2018-11-10 03:38:34,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:34,851 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-10 03:38:34,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 03:38:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-10 03:38:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 03:38:34,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:34,853 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:34,853 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:34,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2050076606, now seen corresponding path program 1 times [2018-11-10 03:38:34,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:38:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:34,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:34,855 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:38:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:38:34,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:34,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:38:34,925 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:38:34,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:38:34,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:38:34,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:38:34,926 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 5 states. [2018-11-10 03:38:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:34,963 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-10 03:38:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:38:34,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-10 03:38:34,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:34,967 INFO L225 Difference]: With dead ends: 84 [2018-11-10 03:38:34,967 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 03:38:34,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:38:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 03:38:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-10 03:38:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 03:38:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-10 03:38:34,975 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 31 [2018-11-10 03:38:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:34,975 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-10 03:38:34,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:38:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-10 03:38:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 03:38:34,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:34,977 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:34,977 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:34,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:34,977 INFO L82 PathProgramCache]: Analyzing trace with hash -770662756, now seen corresponding path program 1 times [2018-11-10 03:38:34,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:38:34,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:34,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:34,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:34,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:38:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 03:38:35,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:35,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:38:35,054 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:38:35,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:38:35,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:38:35,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:38:35,055 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-11-10 03:38:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:35,078 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-11-10 03:38:35,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:38:35,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-10 03:38:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:35,080 INFO L225 Difference]: With dead ends: 90 [2018-11-10 03:38:35,080 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 03:38:35,081 INFO L605 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 [2018-11-10 03:38:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 03:38:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-10 03:38:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 03:38:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-10 03:38:35,089 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 42 [2018-11-10 03:38:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:35,089 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-10 03:38:35,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:38:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-10 03:38:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 03:38:35,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:35,092 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:35,092 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:35,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash -630114146, now seen corresponding path program 1 times [2018-11-10 03:38:35,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:38:35,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:35,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:35,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:35,095 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:38:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 03:38:35,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:38:35,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:38:35,185 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-10 03:38:35,187 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [18], [23], [25], [29], [30], [31], [33], [36], [55], [59], [61], [63], [67], [73], [76], [89], [107], [113], [115], [116], [117], [118], [119], [120], [121], [122], [123], [125], [126], [127], [128] [2018-11-10 03:38:35,238 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:38:35,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:38:35,640 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:38:35,641 INFO L272 AbstractInterpreter]: Visited 20 different actions 31 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2018-11-10 03:38:35,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:35,675 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:38:35,896 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 85.26% of their original sizes. [2018-11-10 03:38:35,896 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:38:36,095 INFO L415 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-11-10 03:38:36,095 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:38:36,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:38:36,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-10 03:38:36,096 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:38:36,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 03:38:36,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:38:36,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:38:36,097 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 13 states. [2018-11-10 03:38:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:37,653 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-10 03:38:37,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 03:38:37,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-11-10 03:38:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:37,654 INFO L225 Difference]: With dead ends: 95 [2018-11-10 03:38:37,654 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 03:38:37,655 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-10 03:38:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 03:38:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-10 03:38:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 03:38:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-11-10 03:38:37,667 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 42 [2018-11-10 03:38:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:37,668 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-10 03:38:37,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 03:38:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-10 03:38:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 03:38:37,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:37,669 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:37,670 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:37,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:37,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1069337020, now seen corresponding path program 1 times [2018-11-10 03:38:37,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:38:37,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:37,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:37,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:37,672 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:38:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:38,077 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-10 03:38:38,286 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-11-10 03:38:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:38:38,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:38:38,396 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:38:38,396 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-10 03:38:38,396 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [18], [21], [23], [25], [29], [30], [31], [33], [36], [55], [59], [61], [63], [67], [73], [76], [89], [107], [113], [115], [116], [117], [118], [119], [120], [121], [122], [123], [125], [126], [127], [128] [2018-11-10 03:38:38,399 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:38:38,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:38:38,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:38:38,898 INFO L272 AbstractInterpreter]: Visited 38 different actions 120 times. Merged at 18 different actions 40 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 48 variables. [2018-11-10 03:38:38,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:38,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:38:38,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:38:38,903 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:38:38,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:38,916 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:38:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:39,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:39,104 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:38:39,106 INFO L477 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 8 treesize of output 7 [2018-11-10 03:38:39,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 03:38:39,215 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:38:39,217 INFO L477 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 8 treesize of output 7 [2018-11-10 03:38:39,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,227 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:38:39,231 INFO L477 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 8 treesize of output 7 [2018-11-10 03:38:39,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-11-10 03:38:39,336 INFO L477 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 19 [2018-11-10 03:38:39,338 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-10 03:38:39,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,346 INFO L477 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 19 treesize of output 15 [2018-11-10 03:38:39,348 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-10 03:38:39,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-10 03:38:39,385 INFO L477 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 [2018-11-10 03:38:39,387 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 03:38:39,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:39,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-11-10 03:38:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 03:38:39,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:38:39,682 INFO L477 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 13 [2018-11-10 03:38:39,684 INFO L477 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 13 treesize of output 11 [2018-11-10 03:38:39,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:38:39,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:38:39,698 INFO L477 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 11 treesize of output 9 [2018-11-10 03:38:39,700 INFO L477 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 [2018-11-10 03:38:39,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:38:39,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:38:39,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-10 03:38:39,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:54 [2018-11-10 03:38:39,999 INFO L477 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 14 treesize of output 12 [2018-11-10 03:38:40,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-10 03:38:40,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:40,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:40,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-11-10 03:38:40,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-10 03:38:40,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:40,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:40,041 INFO L477 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 14 treesize of output 12 [2018-11-10 03:38:40,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-10 03:38:40,043 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:40,050 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:40,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-11-10 03:38:40,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-10 03:38:40,056 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:40,063 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:40,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 03:38:40,077 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:42, output treesize:10 [2018-11-10 03:38:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 03:38:40,115 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:38:40,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [18] total 33 [2018-11-10 03:38:40,115 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:38:40,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 03:38:40,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:38:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 03:38:40,116 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 12 states. [2018-11-10 03:38:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:40,379 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2018-11-10 03:38:40,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 03:38:40,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-10 03:38:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:40,381 INFO L225 Difference]: With dead ends: 71 [2018-11-10 03:38:40,381 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 03:38:40,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=118, Invalid=1364, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 03:38:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 03:38:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2018-11-10 03:38:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 03:38:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-11-10 03:38:40,395 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 53 [2018-11-10 03:38:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:40,395 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-11-10 03:38:40,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 03:38:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-10 03:38:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 03:38:40,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:40,397 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:40,397 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:40,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash 847990952, now seen corresponding path program 1 times [2018-11-10 03:38:40,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:38:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:40,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:40,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:40,399 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:38:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:40,825 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-10 03:38:41,053 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-11-10 03:38:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 03:38:41,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:38:41,146 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:38:41,147 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 03:38:41,147 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [18], [21], [23], [25], [29], [30], [31], [33], [36], [55], [59], [61], [63], [67], [71], [73], [78], [84], [89], [107], [113], [115], [116], [117], [118], [119], [120], [121], [122], [123], [125], [126], [127], [128] [2018-11-10 03:38:41,149 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:38:41,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:38:43,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:38:43,277 INFO L272 AbstractInterpreter]: Visited 40 different actions 280 times. Merged at 20 different actions 197 times. Widened at 2 different actions 46 times. Found 8 fixpoints after 4 different actions. Largest state had 51 variables. [2018-11-10 03:38:43,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:43,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:38:43,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:38:43,298 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:38:43,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:43,317 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:38:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:43,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:43,458 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:38:43,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 03:38:43,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:43,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:43,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:43,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-10 03:38:43,495 INFO L477 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 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 03:38:43,497 INFO L477 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 12 treesize of output 1 [2018-11-10 03:38:43,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:43,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:43,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:38:43,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:14 [2018-11-10 03:38:43,503 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int) (|node_create_write~$Pointer$_#value.base| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) 4 0) 8 |node_create_write~$Pointer$_#value.base|)))) is different from true [2018-11-10 03:38:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-11-10 03:38:43,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:38:43,763 INFO L477 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 0 case distinctions, treesize of input 33 treesize of output 30 [2018-11-10 03:38:43,767 INFO L477 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 30 treesize of output 29 [2018-11-10 03:38:43,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:43,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:43,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 03:38:43,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:19 [2018-11-10 03:38:43,980 INFO L477 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 0 case distinctions, treesize of input 33 treesize of output 30 [2018-11-10 03:38:43,982 INFO L477 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 30 treesize of output 29 [2018-11-10 03:38:43,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:43,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:44,189 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:38:44,190 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 03:38:44,193 INFO L168 Benchmark]: Toolchain (without parser) took 11067.10 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 598.2 MB). Free memory was 955.5 MB in the beginning and 894.3 MB in the end (delta: 61.2 MB). Peak memory consumption was 659.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:44,193 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:38:44,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.85 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 925.9 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:44,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -218.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:44,195 INFO L168 Benchmark]: Boogie Preprocessor took 26.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:44,195 INFO L168 Benchmark]: RCFGBuilder took 446.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:44,195 INFO L168 Benchmark]: TraceAbstraction took 10141.13 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 450.4 MB). Free memory was 1.1 GB in the beginning and 894.3 MB in the end (delta: 212.3 MB). Peak memory consumption was 662.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:44,202 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.85 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 925.9 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -218.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 446.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10141.13 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 450.4 MB). Free memory was 1.1 GB in the beginning and 894.3 MB in the end (delta: 212.3 MB). Peak memory consumption was 662.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:38:46,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:38:46,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:38:46,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:38:46,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:38:46,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:38:46,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:38:46,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:38:46,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:38:46,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:38:46,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:38:46,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:38:46,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:38:46,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:38:46,024 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:38:46,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:38:46,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:38:46,028 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:38:46,029 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:38:46,031 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:38:46,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:38:46,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:38:46,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:38:46,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:38:46,035 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:38:46,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:38:46,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:38:46,038 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:38:46,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:38:46,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:38:46,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:38:46,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:38:46,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:38:46,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:38:46,041 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:38:46,042 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:38:46,043 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 03:38:46,055 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:38:46,056 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:38:46,056 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:38:46,057 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 03:38:46,057 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 03:38:46,057 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 03:38:46,057 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 03:38:46,057 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 03:38:46,058 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:38:46,058 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:38:46,058 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:38:46,059 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:38:46,059 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:38:46,059 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:38:46,059 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:38:46,059 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 03:38:46,059 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 03:38:46,060 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:38:46,060 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:38:46,060 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:38:46,060 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:38:46,060 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:38:46,060 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:38:46,060 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:38:46,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:38:46,061 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:38:46,061 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:38:46,061 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:38:46,061 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 03:38:46,062 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:38:46,062 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 03:38:46,064 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 03:38:46,064 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan 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(__VERIFIER_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 -> 30338be39fffa4ca48f26b164131a7bd561f2b23 [2018-11-10 03:38:46,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:38:46,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:38:46,116 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:38:46,117 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:38:46,117 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:38:46,118 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 03:38:46,173 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/data/7ad3def62/faca480dac0f4d94a6c2fd3150efc2b9/FLAG41dcff434 [2018-11-10 03:38:46,573 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:38:46,574 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 03:38:46,584 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/data/7ad3def62/faca480dac0f4d94a6c2fd3150efc2b9/FLAG41dcff434 [2018-11-10 03:38:46,595 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/data/7ad3def62/faca480dac0f4d94a6c2fd3150efc2b9 [2018-11-10 03:38:46,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:38:46,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:38:46,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:38:46,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:38:46,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:38:46,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:38:46" (1/1) ... [2018-11-10 03:38:46,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6af860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:46, skipping insertion in model container [2018-11-10 03:38:46,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:38:46" (1/1) ... [2018-11-10 03:38:46,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:38:46,657 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:38:46,934 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:38:46,946 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:38:46,989 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:38:47,031 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:38:47,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47 WrapperNode [2018-11-10 03:38:47,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:38:47,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:38:47,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:38:47,033 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:38:47,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47" (1/1) ... [2018-11-10 03:38:47,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47" (1/1) ... [2018-11-10 03:38:47,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:38:47,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:38:47,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:38:47,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:38:47,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47" (1/1) ... [2018-11-10 03:38:47,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47" (1/1) ... [2018-11-10 03:38:47,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47" (1/1) ... [2018-11-10 03:38:47,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47" (1/1) ... [2018-11-10 03:38:47,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47" (1/1) ... [2018-11-10 03:38:47,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47" (1/1) ... [2018-11-10 03:38:47,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47" (1/1) ... [2018-11-10 03:38:47,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:38:47,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:38:47,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:38:47,149 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:38:47,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:38:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-10 03:38:47,191 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-10 03:38:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 03:38:47,192 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 03:38:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-11-10 03:38:47,192 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-11-10 03:38:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-10 03:38:47,192 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-10 03:38:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:38:47,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:38:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:38:47,193 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:38:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-10 03:38:47,193 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-10 03:38:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:38:47,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:38:47,604 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:38:47,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:38:47 BoogieIcfgContainer [2018-11-10 03:38:47,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:38:47,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:38:47,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:38:47,608 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:38:47,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:38:46" (1/3) ... [2018-11-10 03:38:47,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431bbbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:38:47, skipping insertion in model container [2018-11-10 03:38:47,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:38:47" (2/3) ... [2018-11-10 03:38:47,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431bbbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:38:47, skipping insertion in model container [2018-11-10 03:38:47,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:38:47" (3/3) ... [2018-11-10 03:38:47,611 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 03:38:47,619 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:38:47,626 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:38:47,638 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:38:47,662 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:38:47,663 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:38:47,663 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:38:47,663 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:38:47,663 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:38:47,663 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:38:47,663 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:38:47,663 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:38:47,664 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:38:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-10 03:38:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 03:38:47,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:47,685 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:47,687 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:47,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:47,692 INFO L82 PathProgramCache]: Analyzing trace with hash 305391789, now seen corresponding path program 1 times [2018-11-10 03:38:47,696 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:38:47,697 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:38:47,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:47,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:38:47,823 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:38:47,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:47,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:38:47,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 03:38:47,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:38:47,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:38:47,847 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-11-10 03:38:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:47,871 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2018-11-10 03:38:47,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:38:47,872 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-10 03:38:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:47,879 INFO L225 Difference]: With dead ends: 96 [2018-11-10 03:38:47,879 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 03:38:47,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:38:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 03:38:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 03:38:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 03:38:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-10 03:38:47,916 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 29 [2018-11-10 03:38:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:47,916 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 03:38:47,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 03:38:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-10 03:38:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 03:38:47,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:47,919 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:47,919 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:47,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:47,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2050074932, now seen corresponding path program 1 times [2018-11-10 03:38:47,921 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:38:47,921 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:38:47,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:48,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:38:48,096 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:38:48,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:48,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:38:48,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:38:48,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:38:48,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:38:48,101 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 5 states. [2018-11-10 03:38:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:48,185 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-11-10 03:38:48,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:38:48,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-10 03:38:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:48,187 INFO L225 Difference]: With dead ends: 74 [2018-11-10 03:38:48,187 INFO L226 Difference]: Without dead ends: 47 [2018-11-10 03:38:48,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:38:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-10 03:38:48,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-10 03:38:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 03:38:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-10 03:38:48,195 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 31 [2018-11-10 03:38:48,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:48,195 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-10 03:38:48,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:38:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-10 03:38:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 03:38:48,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:48,196 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:48,197 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:48,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:48,197 INFO L82 PathProgramCache]: Analyzing trace with hash -770664430, now seen corresponding path program 1 times [2018-11-10 03:38:48,197 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:38:48,197 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:38:48,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:48,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:38:48,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:38:48,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:48,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:38:48,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:38:48,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:38:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:38:48,313 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2018-11-10 03:38:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:48,355 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-10 03:38:48,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:38:48,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-10 03:38:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:48,357 INFO L225 Difference]: With dead ends: 80 [2018-11-10 03:38:48,357 INFO L226 Difference]: Without dead ends: 47 [2018-11-10 03:38:48,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:38:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-10 03:38:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-10 03:38:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 03:38:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-10 03:38:48,365 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 42 [2018-11-10 03:38:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:48,365 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-10 03:38:48,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:38:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-10 03:38:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 03:38:48,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:48,368 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:48,368 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:48,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash -630115820, now seen corresponding path program 1 times [2018-11-10 03:38:48,369 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:38:48,369 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:38:48,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:48,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:38:48,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:38:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 03:38:48,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:38:48,810 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:38:48,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:48,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:49,068 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:38:49,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 03:38:49,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:49,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:49,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:49,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-10 03:38:49,155 INFO L477 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 16 treesize of output 12 [2018-11-10 03:38:49,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-10 03:38:49,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:49,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:49,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:49,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-10 03:38:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 03:38:49,195 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:38:49,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:38:49,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 6] total 17 [2018-11-10 03:38:49,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 03:38:49,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 03:38:49,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-10 03:38:49,218 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 17 states. [2018-11-10 03:38:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:50,157 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-11-10 03:38:50,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 03:38:50,159 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-11-10 03:38:50,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:50,160 INFO L225 Difference]: With dead ends: 94 [2018-11-10 03:38:50,161 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 03:38:50,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-11-10 03:38:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 03:38:50,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2018-11-10 03:38:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 03:38:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-11-10 03:38:50,171 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 42 [2018-11-10 03:38:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:50,171 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-11-10 03:38:50,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 03:38:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-10 03:38:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 03:38:50,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:50,173 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:50,173 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:50,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:50,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1069337020, now seen corresponding path program 1 times [2018-11-10 03:38:50,174 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:38:50,174 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:38:50,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:50,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:50,453 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:38:50,456 INFO L477 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 8 treesize of output 7 [2018-11-10 03:38:50,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-10 03:38:50,532 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:38:50,535 INFO L477 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 8 treesize of output 7 [2018-11-10 03:38:50,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,549 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:38:50,551 INFO L477 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 8 treesize of output 7 [2018-11-10 03:38:50,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-10 03:38:50,625 INFO L477 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 [2018-11-10 03:38:50,630 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 03:38:50,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,645 INFO L477 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 19 treesize of output 15 [2018-11-10 03:38:50,648 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-10 03:38:50,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2018-11-10 03:38:50,686 INFO L477 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 [2018-11-10 03:38:50,688 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 03:38:50,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:50,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-10 03:38:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 03:38:50,730 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:38:50,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:50,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 03:38:50,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 03:38:50,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:38:50,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:38:50,734 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 12 states. [2018-11-10 03:38:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:51,470 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-10 03:38:51,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 03:38:51,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-10 03:38:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:38:51,472 INFO L225 Difference]: With dead ends: 63 [2018-11-10 03:38:51,472 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 03:38:51,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-10 03:38:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 03:38:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-11-10 03:38:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 03:38:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-11-10 03:38:51,478 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 53 [2018-11-10 03:38:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:38:51,479 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-10 03:38:51,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 03:38:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-10 03:38:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 03:38:51,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:38:51,480 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:51,480 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:38:51,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:51,480 INFO L82 PathProgramCache]: Analyzing trace with hash 847990952, now seen corresponding path program 1 times [2018-11-10 03:38:51,481 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:38:51,481 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:38:51,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:51,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:51,887 INFO L477 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 [2018-11-10 03:38:51,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:51,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:51,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 03:38:51,916 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= (store |c_old(#valid)| |node_create_#Ultimate.alloc_#res.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-11-10 03:38:52,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:38:52,043 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:38:52,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 03:38:52,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 03:38:52,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:52,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:52,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:38:52,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:27 [2018-11-10 03:38:52,134 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:38:52,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 03:38:52,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:52,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:52,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:38:52,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2018-11-10 03:38:52,604 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:38:52,610 INFO L477 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 8 treesize of output 7 [2018-11-10 03:38:52,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:52,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:52,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 03:38:52,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:38 [2018-11-10 03:38:52,748 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:52,748 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:76, output treesize:1 [2018-11-10 03:38:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 16 not checked. [2018-11-10 03:38:52,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:38:53,239 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-10 03:38:53,483 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-10 03:38:53,585 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-10 03:38:53,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:38:53,723 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:38:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:53,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:54,139 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:38:54,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 03:38:54,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:38:54,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:54,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:38:54,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-10 03:38:54,366 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#ptr.base| (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_write~$Pointer$_#ptr.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) |node_create_write~$Pointer$_#value.base|)))) is different from true [2018-11-10 03:38:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-11-10 03:38:54,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:38:55,230 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-10 03:38:55,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:38:55,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-11-10 03:38:55,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-10 03:38:55,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-10 03:38:55,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1141, Unknown=27, NotChecked=138, Total=1406 [2018-11-10 03:38:55,636 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 36 states. [2018-11-10 03:38:56,814 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-11-10 03:39:00,400 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-10 03:39:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:02,637 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2018-11-10 03:39:02,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 03:39:02,638 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 56 [2018-11-10 03:39:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:39:02,641 INFO L225 Difference]: With dead ends: 102 [2018-11-10 03:39:02,641 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 03:39:02,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=200, Invalid=2375, Unknown=85, NotChecked=202, Total=2862 [2018-11-10 03:39:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 03:39:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2018-11-10 03:39:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 03:39:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-10 03:39:02,653 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 56 [2018-11-10 03:39:02,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:39:02,653 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-10 03:39:02,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-10 03:39:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-10 03:39:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 03:39:02,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:39:02,654 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:02,655 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:39:02,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash 551304392, now seen corresponding path program 1 times [2018-11-10 03:39:02,655 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:39:02,656 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:39:02,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:03,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:03,082 INFO L477 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 [2018-11-10 03:39:03,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:03,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:03,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 03:39:03,145 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_write~intINTTYPE4_#ptr.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |dll_create_write~intINTTYPE4_#ptr.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |dll_create_write~intINTTYPE4_#ptr.base| (_ bv1 1))))) is different from true [2018-11-10 03:39:03,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:03,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:03,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:03,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-11-10 03:39:03,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-11-10 03:39:03,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:03,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:03,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:39:03,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-11-10 03:39:03,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:39:03,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-10 03:39:03,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:03,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:03,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:39:03,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:56 [2018-11-10 03:39:04,141 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_append_~last~0.offset (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32)) (|node_create_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|dll_append_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32)) (|dll_append_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (select |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.base|)))) (let ((.cse2 (select (select .cse1 |c_dll_append_#in~head.base|) |c_dll_append_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd dll_append_~last~0.offset (_ bv4 32)) dll_append_~new_last~0.base)))))) (store .cse0 dll_append_~new_last~0.base (store (select .cse0 dll_append_~new_last~0.base) |dll_append_write~$Pointer$_#ptr.offset| |dll_append_write~$Pointer$_#value.base|))) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)))) is different from true [2018-11-10 03:39:05,536 WARN L179 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-11-10 03:39:05,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:05,583 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:05,593 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:05,594 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 03:39:05,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-10 03:39:05,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:05,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:05,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:05,959 INFO L303 Elim1Store]: Index analysis took 134 ms [2018-11-10 03:39:05,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 96 [2018-11-10 03:39:05,970 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-10 03:39:06,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 03:39:06,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 03:39:06,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:39:06,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 77 [2018-11-10 03:39:06,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-11-10 03:39:06,317 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:06,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-11-10 03:39:06,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-11-10 03:39:06,441 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-10 03:39:06,506 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:39:06,605 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:39:06,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 81 [2018-11-10 03:39:06,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-11-10 03:39:06,661 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:06,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 73 [2018-11-10 03:39:06,988 INFO L477 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 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 44 [2018-11-10 03:39:06,989 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-11-10 03:39:07,309 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 03:39:07,541 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 03:39:07,820 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 03:39:08,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 03:39:08,171 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:210, output treesize:124 [2018-11-10 03:39:08,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2018-11-10 03:39:08,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-10 03:39:08,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:08,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-10 03:39:08,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:08,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:08,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:08,346 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:4 [2018-11-10 03:39:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2018-11-10 03:39:08,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:39:09,383 WARN L179 SmtUtils]: Spent 666.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-10 03:39:09,519 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-10 03:39:09,998 WARN L179 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-10 03:39:10,207 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-10 03:39:14,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:14,777 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a64a66b2-e819-4f9b-ad15-d05f7ba6a457/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:14,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:14,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:15,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 03:39:15,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:15,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:15,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-11-10 03:39:15,548 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:39:15,551 INFO L477 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 8 treesize of output 7 [2018-11-10 03:39:15,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:15,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:15,572 INFO L477 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 03:39:15,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 03:39:15,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:15,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:15,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:15,589 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-10 03:39:17,141 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_append_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.offset| (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (select |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) |node_create_write~$Pointer$_#value.base|)))) (let ((.cse2 (select (select .cse1 |c_dll_append_#in~head.base|) |c_dll_append_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| dll_append_~new_last~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| dll_append_~new_last~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) |node_create_write~$Pointer$_#value.offset|)) |c_dll_append_#in~head.base|) |c_dll_append_#in~head.offset|) (_ bv4 32)) dll_append_~new_last~0.base)))))) (store .cse0 dll_append_~new_last~0.base (store (select .cse0 dll_append_~new_last~0.base) (_ bv8 32) |dll_append_write~$Pointer$_#value.base|)))) (= (select |c_old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)))) is different from true [2018-11-10 03:39:19,131 WARN L179 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 112 DAG size of output: 42 [2018-11-10 03:39:19,154 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:19,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:19,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 03:39:19,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:19,270 INFO L477 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 107 treesize of output 101 [2018-11-10 03:39:19,279 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 95 [2018-11-10 03:39:19,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:19,313 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:19,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:19,505 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-11-10 03:39:19,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 91 [2018-11-10 03:39:24,932 WARN L179 SmtUtils]: Spent 5.34 s on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-11-10 03:39:24,938 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 81 [2018-11-10 03:39:24,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-10 03:39:24,958 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:25,017 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:26,968 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:26,969 INFO L477 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 56 treesize of output 62 [2018-11-10 03:39:26,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:26,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-11-10 03:39:26,992 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:27,065 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:29,135 INFO L303 Elim1Store]: Index analysis took 118 ms [2018-11-10 03:39:29,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 67 [2018-11-10 03:39:29,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:29,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:29,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 03:39:29,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 50 treesize of output 74 [2018-11-10 03:39:29,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:29,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 03:39:29,236 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:29,275 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:39:29,997 INFO L477 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 55 treesize of output 54 [2018-11-10 03:39:29,997 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 03:39:30,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:30,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 67 [2018-11-10 03:39:30,827 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:39:31,028 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:31,029 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_29 term size 33 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 03:39:31,031 INFO L168 Benchmark]: Toolchain (without parser) took 44433.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.6 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -118.3 MB). Peak memory consumption was 186.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:39:31,032 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:39:31,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.25 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 918.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:39:31,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 918.6 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:39:31,033 INFO L168 Benchmark]: Boogie Preprocessor took 28.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:39:31,033 INFO L168 Benchmark]: RCFGBuilder took 456.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:39:31,034 INFO L168 Benchmark]: TraceAbstraction took 43425.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.5 MB). Peak memory consumption was 187.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:39:31,036 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 433.25 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 918.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 918.6 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 456.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43425.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.5 MB). Peak memory consumption was 187.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_29 term size 33 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_29 term size 33: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...