./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b873ab0fa5dbe521b35ba5285456d1a3fc5a6f41 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b873ab0fa5dbe521b35ba5285456d1a3fc5a6f41 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:17:12,734 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:17:12,735 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:17:12,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:17:12,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:17:12,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:17:12,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:17:12,743 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:17:12,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:17:12,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:17:12,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:17:12,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:17:12,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:17:12,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:17:12,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:17:12,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:17:12,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:17:12,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:17:12,749 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:17:12,750 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:17:12,750 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:17:12,751 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:17:12,752 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:17:12,752 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:17:12,752 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:17:12,753 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:17:12,753 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:17:12,754 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:17:12,754 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:17:12,755 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:17:12,755 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:17:12,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:17:12,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:17:12,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:17:12,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:17:12,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:17:12,757 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 19:17:12,764 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:17:12,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:17:12,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:17:12,764 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:17:12,764 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:17:12,765 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:17:12,765 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:17:12,765 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:17:12,765 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:17:12,765 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:17:12,765 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:17:12,765 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:17:12,765 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:17:12,766 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 19:17:12,766 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 19:17:12,766 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:17:12,766 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:17:12,766 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 19:17:12,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:17:12,767 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:17:12,767 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:17:12,767 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 19:17:12,767 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 19:17:12,767 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 19:17:12,767 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:17:12,767 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:17:12,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:17:12,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:17:12,768 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:17:12,768 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:17:12,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:17:12,768 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:17:12,768 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:17:12,768 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:17:12,769 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:17:12,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:17:12,769 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_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> b873ab0fa5dbe521b35ba5285456d1a3fc5a6f41 [2018-12-09 19:17:12,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:17:12,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:17:12,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:17:12,796 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:17:12,796 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:17:12,796 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:17:12,829 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/data/d0462c94a/6b6c096c31864ce3ad1b558ba4eeee24/FLAG5371e63ef [2018-12-09 19:17:13,273 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:17:13,274 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:17:13,280 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/data/d0462c94a/6b6c096c31864ce3ad1b558ba4eeee24/FLAG5371e63ef [2018-12-09 19:17:13,288 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/data/d0462c94a/6b6c096c31864ce3ad1b558ba4eeee24 [2018-12-09 19:17:13,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:17:13,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:17:13,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:17:13,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:17:13,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:17:13,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:17:13" (1/1) ... [2018-12-09 19:17:13,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665b4d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13, skipping insertion in model container [2018-12-09 19:17:13,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:17:13" (1/1) ... [2018-12-09 19:17:13,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:17:13,319 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:17:13,471 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:17:13,513 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:17:13,540 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:17:13,562 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:17:13,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13 WrapperNode [2018-12-09 19:17:13,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:17:13,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:17:13,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:17:13,563 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:17:13,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13" (1/1) ... [2018-12-09 19:17:13,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13" (1/1) ... [2018-12-09 19:17:13,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:17:13,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:17:13,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:17:13,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:17:13,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13" (1/1) ... [2018-12-09 19:17:13,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13" (1/1) ... [2018-12-09 19:17:13,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13" (1/1) ... [2018-12-09 19:17:13,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13" (1/1) ... [2018-12-09 19:17:13,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13" (1/1) ... [2018-12-09 19:17:13,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13" (1/1) ... [2018-12-09 19:17:13,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13" (1/1) ... [2018-12-09 19:17:13,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:17:13,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:17:13,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:17:13,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:17:13,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/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-12-09 19:17:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-09 19:17:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-09 19:17:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 19:17:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 19:17:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:17:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 19:17:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-12-09 19:17:13,637 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-12-09 19:17:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:17:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 19:17:13,637 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 19:17:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:17:13,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:17:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:17:13,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:17:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:17:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:17:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:17:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 19:17:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-09 19:17:13,638 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-09 19:17:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:17:13,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:17:13,892 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:17:13,892 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 19:17:13,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:17:13 BoogieIcfgContainer [2018-12-09 19:17:13,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:17:13,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:17:13,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:17:13,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:17:13,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:17:13" (1/3) ... [2018-12-09 19:17:13,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c02c5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:17:13, skipping insertion in model container [2018-12-09 19:17:13,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:13" (2/3) ... [2018-12-09 19:17:13,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c02c5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:17:13, skipping insertion in model container [2018-12-09 19:17:13,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:17:13" (3/3) ... [2018-12-09 19:17:13,897 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:17:13,902 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:17:13,907 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-12-09 19:17:13,916 INFO L257 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2018-12-09 19:17:13,931 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:17:13,931 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 19:17:13,931 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:17:13,931 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:17:13,931 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:17:13,931 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:17:13,931 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:17:13,931 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:17:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-12-09 19:17:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 19:17:13,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:13,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:13,949 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:17:13,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:13,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1762524930, now seen corresponding path program 1 times [2018-12-09 19:17:13,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:17:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:13,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:13,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:17:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:14,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:14,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:17:14,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:17:14,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:17:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:17:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:17:14,066 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2018-12-09 19:17:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:14,157 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2018-12-09 19:17:14,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:17:14,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 19:17:14,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:14,164 INFO L225 Difference]: With dead ends: 119 [2018-12-09 19:17:14,164 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 19:17:14,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:17:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 19:17:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-09 19:17:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 19:17:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-12-09 19:17:14,191 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 13 [2018-12-09 19:17:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:14,191 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-12-09 19:17:14,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:17:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-12-09 19:17:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 19:17:14,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:14,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:14,192 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:17:14,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:14,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1762524931, now seen corresponding path program 1 times [2018-12-09 19:17:14,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:17:14,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:14,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:17:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:14,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:14,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:17:14,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:17:14,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:17:14,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:17:14,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:17:14,240 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 3 states. [2018-12-09 19:17:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:14,288 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-12-09 19:17:14,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:17:14,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 19:17:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:14,289 INFO L225 Difference]: With dead ends: 109 [2018-12-09 19:17:14,289 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 19:17:14,289 INFO L631 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-12-09 19:17:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 19:17:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-09 19:17:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 19:17:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-12-09 19:17:14,294 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 13 [2018-12-09 19:17:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:14,294 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-12-09 19:17:14,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:17:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-12-09 19:17:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:17:14,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:14,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:14,295 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:17:14,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:14,295 INFO L82 PathProgramCache]: Analyzing trace with hash 782083206, now seen corresponding path program 1 times [2018-12-09 19:17:14,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:17:14,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:14,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:17:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:14,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:14,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:17:14,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:17:14,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:17:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:17:14,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:17:14,332 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 6 states. [2018-12-09 19:17:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:14,469 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-12-09 19:17:14,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:17:14,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 19:17:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:14,471 INFO L225 Difference]: With dead ends: 112 [2018-12-09 19:17:14,471 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 19:17:14,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:17:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 19:17:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2018-12-09 19:17:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 19:17:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-12-09 19:17:14,478 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 20 [2018-12-09 19:17:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:14,478 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-12-09 19:17:14,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:17:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-12-09 19:17:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:17:14,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:14,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:14,479 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:17:14,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:14,479 INFO L82 PathProgramCache]: Analyzing trace with hash 782083207, now seen corresponding path program 1 times [2018-12-09 19:17:14,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:17:14,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:14,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:17:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:14,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:14,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:17:14,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:17:14,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:17:14,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:17:14,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:17:14,565 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 6 states. [2018-12-09 19:17:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:14,690 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-12-09 19:17:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:17:14,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 19:17:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:14,692 INFO L225 Difference]: With dead ends: 110 [2018-12-09 19:17:14,692 INFO L226 Difference]: Without dead ends: 110 [2018-12-09 19:17:14,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:17:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-09 19:17:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-12-09 19:17:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 19:17:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-12-09 19:17:14,696 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 20 [2018-12-09 19:17:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:14,696 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-12-09 19:17:14,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:17:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-12-09 19:17:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:17:14,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:14,697 INFO L402 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] [2018-12-09 19:17:14,697 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:17:14,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:14,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1156712246, now seen corresponding path program 1 times [2018-12-09 19:17:14,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:17:14,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:14,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:17:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:14,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:14,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:17:14,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:17:14,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:17:14,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:17:14,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:17:14,732 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 3 states. [2018-12-09 19:17:14,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:14,745 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-12-09 19:17:14,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:17:14,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 19:17:14,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:14,747 INFO L225 Difference]: With dead ends: 115 [2018-12-09 19:17:14,747 INFO L226 Difference]: Without dead ends: 115 [2018-12-09 19:17:14,747 INFO L631 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-12-09 19:17:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-09 19:17:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-12-09 19:17:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 19:17:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-12-09 19:17:14,752 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 23 [2018-12-09 19:17:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:14,752 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-12-09 19:17:14,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:17:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-12-09 19:17:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:17:14,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:14,753 INFO L402 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] [2018-12-09 19:17:14,753 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:17:14,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:14,754 INFO L82 PathProgramCache]: Analyzing trace with hash -581993423, now seen corresponding path program 1 times [2018-12-09 19:17:14,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:17:14,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:14,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:17:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:14,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:14,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:17:14,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:17:14,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:17:14,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:17:14,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:17:14,785 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 5 states. [2018-12-09 19:17:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:14,804 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-12-09 19:17:14,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:17:14,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-09 19:17:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:14,806 INFO L225 Difference]: With dead ends: 115 [2018-12-09 19:17:14,806 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 19:17:14,806 INFO L631 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-12-09 19:17:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 19:17:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-12-09 19:17:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 19:17:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-12-09 19:17:14,810 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 26 [2018-12-09 19:17:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:14,810 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-12-09 19:17:14,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:17:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-12-09 19:17:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 19:17:14,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:14,811 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:14,811 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:17:14,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash 336148239, now seen corresponding path program 1 times [2018-12-09 19:17:14,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:17:14,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:14,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:14,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:17:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:14,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:14,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:17:14,949 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-09 19:17:14,950 INFO L205 CegarAbsIntRunner]: [0], [87], [88], [94], [103], [105], [106], [109], [114], [116], [119], [121], [175], [181], [183], [186], [189], [192], [193], [194], [200], [201], [204], [205], [206] [2018-12-09 19:17:14,971 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:17:14,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:17:15,096 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:17:15,097 INFO L272 AbstractInterpreter]: Visited 25 different actions 40 times. Merged at 6 different actions 6 times. Never widened. Performed 360 root evaluator evaluations with a maximum evaluation depth of 3. Performed 360 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-09 19:17:15,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:15,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:17:15,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:15,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/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-12-09 19:17:15,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:15,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:17:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:15,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:15,171 INFO L478 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-12-09 19:17:15,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:15,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:15,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:17:15,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:15,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:15,224 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 19:17:15,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:15,229 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-12-09 19:17:15,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-09 19:17:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:15,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:15,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:17:15,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2018-12-09 19:17:15,991 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:17:15,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:17:15,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:17:15,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=322, Unknown=2, NotChecked=0, Total=380 [2018-12-09 19:17:15,992 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 13 states. [2018-12-09 19:17:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:17,864 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-12-09 19:17:17,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:17:17,864 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-12-09 19:17:17,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:17,865 INFO L225 Difference]: With dead ends: 127 [2018-12-09 19:17:17,865 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 19:17:17,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=577, Unknown=2, NotChecked=0, Total=702 [2018-12-09 19:17:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 19:17:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2018-12-09 19:17:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-09 19:17:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-12-09 19:17:17,871 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 38 [2018-12-09 19:17:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:17,871 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-12-09 19:17:17,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:17:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-12-09 19:17:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 19:17:17,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:17,872 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:17,872 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:17:17,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:17,873 INFO L82 PathProgramCache]: Analyzing trace with hash 336148240, now seen corresponding path program 1 times [2018-12-09 19:17:17,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:17:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:17,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:17,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:17:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:17,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:17,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:17:17,990 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-09 19:17:17,991 INFO L205 CegarAbsIntRunner]: [0], [87], [88], [94], [103], [105], [106], [109], [114], [117], [119], [121], [175], [181], [183], [186], [189], [192], [193], [194], [200], [201], [204], [205], [206] [2018-12-09 19:17:17,992 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:17:17,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:17:18,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:17:18,045 INFO L272 AbstractInterpreter]: Visited 25 different actions 40 times. Merged at 6 different actions 6 times. Never widened. Performed 361 root evaluator evaluations with a maximum evaluation depth of 3. Performed 361 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-09 19:17:18,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:18,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:17:18,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:18,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/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-12-09 19:17:18,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:18,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:17:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:18,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:18,091 INFO L478 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-12-09 19:17:18,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:18,097 INFO L478 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-12-09 19:17:18,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:18,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:18,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:17:18,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:18,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:18,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 19:17:18,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:18,228 INFO L478 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 12 treesize of output 15 [2018-12-09 19:17:18,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:18,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:18,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-12-09 19:17:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:18,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:18,355 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-09 19:17:25,328 WARN L180 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 60 DAG size of output: 23 [2018-12-09 19:17:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:25,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:17:25,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 27 [2018-12-09 19:17:25,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:17:25,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 19:17:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 19:17:25,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=666, Unknown=2, NotChecked=0, Total=756 [2018-12-09 19:17:25,570 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 18 states. [2018-12-09 19:17:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:26,982 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-12-09 19:17:26,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:17:26,983 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-12-09 19:17:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:26,983 INFO L225 Difference]: With dead ends: 127 [2018-12-09 19:17:26,983 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 19:17:26,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=177, Invalid=1081, Unknown=2, NotChecked=0, Total=1260 [2018-12-09 19:17:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 19:17:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2018-12-09 19:17:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 19:17:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-12-09 19:17:26,987 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 38 [2018-12-09 19:17:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:26,987 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-12-09 19:17:26,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 19:17:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-12-09 19:17:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 19:17:26,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:26,988 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:26,989 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:17:26,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:26,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1161634868, now seen corresponding path program 1 times [2018-12-09 19:17:26,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:17:26,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:26,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:26,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:26,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:17:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:17:27,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:27,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:17:27,018 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-12-09 19:17:27,018 INFO L205 CegarAbsIntRunner]: [0], [2], [87], [88], [94], [101], [103], [105], [106], [109], [119], [121], [125], [126], [127], [129], [131], [175], [181], [183], [186], [189], [192], [193], [194], [195], [196], [200], [201], [202], [203], [204], [205], [206] [2018-12-09 19:17:27,019 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:17:27,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:17:27,048 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:17:27,049 INFO L272 AbstractInterpreter]: Visited 24 different actions 39 times. Merged at 6 different actions 6 times. Never widened. Performed 354 root evaluator evaluations with a maximum evaluation depth of 3. Performed 354 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-12-09 19:17:27,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:27,050 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:17:27,095 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 74.47% of their original sizes. [2018-12-09 19:17:27,095 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:17:27,168 INFO L418 sIntCurrentIteration]: We unified 40 AI predicates to 40 [2018-12-09 19:17:27,168 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:17:27,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:17:27,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-12-09 19:17:27,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:17:27,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 19:17:27,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 19:17:27,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:17:27,170 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 15 states. [2018-12-09 19:17:27,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:27,950 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-12-09 19:17:27,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:17:27,950 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-12-09 19:17:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:27,951 INFO L225 Difference]: With dead ends: 126 [2018-12-09 19:17:27,951 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 19:17:27,951 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-12-09 19:17:27,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 19:17:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-12-09 19:17:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-09 19:17:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-12-09 19:17:27,954 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 41 [2018-12-09 19:17:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:27,954 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-12-09 19:17:27,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 19:17:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-12-09 19:17:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 19:17:27,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:27,956 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-12-09 19:17:27,956 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:17:27,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2112094387, now seen corresponding path program 1 times [2018-12-09 19:17:27,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:17:27,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:27,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:27,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:17:27,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:17:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:17:28,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:28,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:17:28,104 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-09 19:17:28,105 INFO L205 CegarAbsIntRunner]: [0], [2], [87], [88], [94], [101], [103], [105], [106], [109], [114], [115], [119], [121], [125], [126], [127], [129], [131], [175], [181], [183], [186], [189], [192], [193], [194], [195], [196], [200], [201], [202], [203], [204], [205], [206] [2018-12-09 19:17:28,106 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:17:28,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:17:28,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:17:28,142 INFO L272 AbstractInterpreter]: Visited 36 different actions 78 times. Merged at 8 different actions 15 times. Never widened. Performed 710 root evaluator evaluations with a maximum evaluation depth of 3. Performed 710 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-09 19:17:28,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:28,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:17:28,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:28,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:17:28,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:28,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:17:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:28,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:28,196 INFO L478 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-12-09 19:17:28,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:28,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:28,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:17:28,446 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (= (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) |c_#valid|)) is different from true [2018-12-09 19:17:30,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:30,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:30,497 INFO L478 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-12-09 19:17:30,500 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-09 19:17:30,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:30,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:30,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:30,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-12-09 19:17:30,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-09 19:17:30,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:30,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:30,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-12-09 19:17:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2018-12-09 19:17:30,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:32,113 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:17:32,114 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 33859 column 11: unknown constant v_node_create_#t~malloc2.base_33 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:114) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:120) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.checkEqualityStatus(Elim1Store.java:668) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:760) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) 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.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:418) 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:214) 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:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-09 19:17:32,119 INFO L168 Benchmark]: Toolchain (without parser) took 18828.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 948.1 MB in the beginning and 890.0 MB in the end (delta: 58.1 MB). Peak memory consumption was 215.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:17:32,119 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:17:32,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:17:32,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:17:32,120 INFO L168 Benchmark]: Boogie Preprocessor took 21.31 ms. Allocated memory is still 1.1 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-12-09 19:17:32,121 INFO L168 Benchmark]: RCFGBuilder took 289.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:17:32,121 INFO L168 Benchmark]: TraceAbstraction took 18225.03 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 890.0 MB in the end (delta: 164.0 MB). Peak memory consumption was 212.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:17:32,123 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.31 ms. Allocated memory is still 1.1 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 289.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18225.03 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 890.0 MB in the end (delta: 164.0 MB). Peak memory consumption was 212.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 33859 column 11: unknown constant v_node_create_#t~malloc2.base_33 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 33859 column 11: unknown constant v_node_create_#t~malloc2.base_33: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:17:33,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:17:33,445 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:17:33,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:17:33,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:17:33,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:17:33,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:17:33,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:17:33,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:17:33,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:17:33,455 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:17:33,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:17:33,455 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:17:33,456 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:17:33,456 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:17:33,457 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:17:33,457 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:17:33,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:17:33,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:17:33,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:17:33,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:17:33,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:17:33,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:17:33,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:17:33,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:17:33,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:17:33,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:17:33,464 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:17:33,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:17:33,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:17:33,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:17:33,465 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:17:33,466 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:17:33,466 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:17:33,466 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:17:33,467 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:17:33,467 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 19:17:33,474 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:17:33,475 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:17:33,475 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:17:33,475 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:17:33,475 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:17:33,476 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:17:33,476 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:17:33,476 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:17:33,476 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:17:33,476 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:17:33,476 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 19:17:33,476 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 19:17:33,477 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:17:33,477 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:17:33,477 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 19:17:33,477 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:17:33,477 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:17:33,477 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:17:33,477 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 19:17:33,477 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 19:17:33,477 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 19:17:33,478 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:17:33,478 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 19:17:33,478 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 19:17:33,478 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:17:33,478 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 19:17:33,478 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:17:33,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:17:33,478 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:17:33,479 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:17:33,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:17:33,479 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:17:33,479 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:17:33,479 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 19:17:33,479 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:17:33,479 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 19:17:33,479 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> b873ab0fa5dbe521b35ba5285456d1a3fc5a6f41 [2018-12-09 19:17:33,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:17:33,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:17:33,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:17:33,508 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:17:33,508 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:17:33,508 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:17:33,544 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/data/9e1b83e6b/bfac6799f02e4c889982cccfab824c59/FLAG1c53efa1a [2018-12-09 19:17:33,996 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:17:33,997 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:17:34,003 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/data/9e1b83e6b/bfac6799f02e4c889982cccfab824c59/FLAG1c53efa1a [2018-12-09 19:17:34,011 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/data/9e1b83e6b/bfac6799f02e4c889982cccfab824c59 [2018-12-09 19:17:34,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:17:34,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:17:34,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:17:34,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:17:34,017 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:17:34,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:17:34" (1/1) ... [2018-12-09 19:17:34,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49da4dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34, skipping insertion in model container [2018-12-09 19:17:34,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:17:34" (1/1) ... [2018-12-09 19:17:34,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:17:34,053 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:17:34,235 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:17:34,242 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:17:34,304 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:17:34,336 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:17:34,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34 WrapperNode [2018-12-09 19:17:34,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:17:34,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:17:34,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:17:34,337 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:17:34,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34" (1/1) ... [2018-12-09 19:17:34,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34" (1/1) ... [2018-12-09 19:17:34,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:17:34,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:17:34,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:17:34,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:17:34,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34" (1/1) ... [2018-12-09 19:17:34,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34" (1/1) ... [2018-12-09 19:17:34,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34" (1/1) ... [2018-12-09 19:17:34,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34" (1/1) ... [2018-12-09 19:17:34,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34" (1/1) ... [2018-12-09 19:17:34,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34" (1/1) ... [2018-12-09 19:17:34,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34" (1/1) ... [2018-12-09 19:17:34,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:17:34,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:17:34,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:17:34,381 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:17:34,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/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-12-09 19:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-09 19:17:34,413 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-09 19:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 19:17:34,413 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 19:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:17:34,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 19:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-12-09 19:17:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-12-09 19:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 19:17:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 19:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:17:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:17:34,414 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 19:17:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 19:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-09 19:17:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-09 19:17:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:17:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:17:34,820 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:17:34,820 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 19:17:34,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:17:34 BoogieIcfgContainer [2018-12-09 19:17:34,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:17:34,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:17:34,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:17:34,823 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:17:34,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:17:34" (1/3) ... [2018-12-09 19:17:34,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b17586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:17:34, skipping insertion in model container [2018-12-09 19:17:34,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:34" (2/3) ... [2018-12-09 19:17:34,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b17586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:17:34, skipping insertion in model container [2018-12-09 19:17:34,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:17:34" (3/3) ... [2018-12-09 19:17:34,825 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:17:34,833 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:17:34,838 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-12-09 19:17:34,849 INFO L257 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2018-12-09 19:17:34,865 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 19:17:34,866 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:17:34,866 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 19:17:34,866 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:17:34,866 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:17:34,866 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:17:34,866 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:17:34,866 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:17:34,866 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:17:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-12-09 19:17:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 19:17:34,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:34,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:34,882 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:17:34,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:34,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1762524930, now seen corresponding path program 1 times [2018-12-09 19:17:34,887 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:34,888 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:34,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:34,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:34,973 INFO L478 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-12-09 19:17:34,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:34,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:34,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:17:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:34,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:17:34,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:34,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:17:34,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:17:34,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:17:34,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:17:34,999 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2018-12-09 19:17:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:35,152 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2018-12-09 19:17:35,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:17:35,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 19:17:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:35,159 INFO L225 Difference]: With dead ends: 119 [2018-12-09 19:17:35,159 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 19:17:35,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-12-09 19:17:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 19:17:35,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-09 19:17:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 19:17:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-12-09 19:17:35,187 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 13 [2018-12-09 19:17:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:35,187 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-12-09 19:17:35,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:17:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-12-09 19:17:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 19:17:35,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:35,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:35,188 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:17:35,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1762524931, now seen corresponding path program 1 times [2018-12-09 19:17:35,189 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:35,189 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:35,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:35,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:35,238 INFO L478 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-12-09 19:17:35,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:35,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:35,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:17:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:35,249 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:17:35,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:35,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:17:35,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:17:35,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:17:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:17:35,252 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 3 states. [2018-12-09 19:17:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:35,407 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-12-09 19:17:35,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:17:35,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 19:17:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:35,408 INFO L225 Difference]: With dead ends: 109 [2018-12-09 19:17:35,408 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 19:17:35,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-12-09 19:17:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 19:17:35,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-09 19:17:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 19:17:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-12-09 19:17:35,414 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 13 [2018-12-09 19:17:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:35,415 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-12-09 19:17:35,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:17:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-12-09 19:17:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:17:35,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:35,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:35,415 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:17:35,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:35,416 INFO L82 PathProgramCache]: Analyzing trace with hash 782083206, now seen corresponding path program 1 times [2018-12-09 19:17:35,416 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:35,416 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:35,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:35,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:35,476 INFO L478 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-12-09 19:17:35,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:35,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:35,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:17:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:35,496 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:17:35,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:35,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:17:35,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:17:35,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:17:35,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:17:35,498 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 6 states. [2018-12-09 19:17:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:35,878 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-12-09 19:17:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:17:35,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 19:17:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:35,881 INFO L225 Difference]: With dead ends: 112 [2018-12-09 19:17:35,881 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 19:17:35,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:17:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 19:17:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2018-12-09 19:17:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 19:17:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-12-09 19:17:35,890 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 20 [2018-12-09 19:17:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:35,890 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-12-09 19:17:35,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:17:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-12-09 19:17:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:17:35,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:35,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:35,891 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:17:35,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:35,892 INFO L82 PathProgramCache]: Analyzing trace with hash 782083207, now seen corresponding path program 1 times [2018-12-09 19:17:35,892 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:35,892 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:35,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:35,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:35,958 INFO L478 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-12-09 19:17:35,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:35,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:35,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:17:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:36,010 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:17:36,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:36,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:17:36,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:17:36,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:17:36,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:17:36,012 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 6 states. [2018-12-09 19:17:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:36,422 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-12-09 19:17:36,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:17:36,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 19:17:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:36,424 INFO L225 Difference]: With dead ends: 110 [2018-12-09 19:17:36,424 INFO L226 Difference]: Without dead ends: 110 [2018-12-09 19:17:36,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:17:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-09 19:17:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-12-09 19:17:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 19:17:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-12-09 19:17:36,428 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 20 [2018-12-09 19:17:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:36,429 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-12-09 19:17:36,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:17:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-12-09 19:17:36,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:17:36,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:36,429 INFO L402 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] [2018-12-09 19:17:36,430 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:17:36,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:36,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1156712246, now seen corresponding path program 1 times [2018-12-09 19:17:36,430 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:36,430 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:36,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:36,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:36,482 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:17:36,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:36,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:17:36,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:17:36,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:17:36,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:17:36,484 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 3 states. [2018-12-09 19:17:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:36,513 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-12-09 19:17:36,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:17:36,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 19:17:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:36,514 INFO L225 Difference]: With dead ends: 115 [2018-12-09 19:17:36,515 INFO L226 Difference]: Without dead ends: 115 [2018-12-09 19:17:36,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-12-09 19:17:36,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-09 19:17:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-12-09 19:17:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 19:17:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-12-09 19:17:36,520 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 23 [2018-12-09 19:17:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:36,520 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-12-09 19:17:36,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:17:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-12-09 19:17:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:17:36,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:36,521 INFO L402 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] [2018-12-09 19:17:36,521 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:17:36,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:36,521 INFO L82 PathProgramCache]: Analyzing trace with hash -581993423, now seen corresponding path program 1 times [2018-12-09 19:17:36,521 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:36,521 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:36,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:36,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:36,602 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:17:36,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:36,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:17:36,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:17:36,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:17:36,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:17:36,604 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 5 states. [2018-12-09 19:17:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:36,629 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-12-09 19:17:36,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:17:36,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-09 19:17:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:36,630 INFO L225 Difference]: With dead ends: 115 [2018-12-09 19:17:36,630 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 19:17:36,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-12-09 19:17:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 19:17:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-12-09 19:17:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 19:17:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-12-09 19:17:36,634 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 26 [2018-12-09 19:17:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:36,634 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-12-09 19:17:36,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:17:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-12-09 19:17:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 19:17:36,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:36,635 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:36,635 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:17:36,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:36,635 INFO L82 PathProgramCache]: Analyzing trace with hash 336148239, now seen corresponding path program 1 times [2018-12-09 19:17:36,636 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:36,636 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:36,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:36,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:36,752 INFO L478 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-12-09 19:17:36,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:36,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:36,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:17:37,165 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-09 19:17:37,173 INFO L478 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 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 19:17:37,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:37,178 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-12-09 19:17:37,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-09 19:17:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 19:17:37,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 4 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:37,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:37,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/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-12-09 19:17:37,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:37,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:39,383 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-09 19:17:39,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:39,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:39,393 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 19:17:39,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:39,400 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-12-09 19:17:39,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-12-09 19:17:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-12-09 19:17:39,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:39,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:17:39,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 11 [2018-12-09 19:17:39,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:17:39,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:17:39,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=8, NotChecked=38, Total=156 [2018-12-09 19:17:39,471 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 12 states. [2018-12-09 19:17:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:42,698 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2018-12-09 19:17:42,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:17:42,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-12-09 19:17:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:42,700 INFO L225 Difference]: With dead ends: 153 [2018-12-09 19:17:42,700 INFO L226 Difference]: Without dead ends: 153 [2018-12-09 19:17:42,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=73, Invalid=264, Unknown=13, NotChecked=70, Total=420 [2018-12-09 19:17:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-09 19:17:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 110. [2018-12-09 19:17:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-09 19:17:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-12-09 19:17:42,704 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 38 [2018-12-09 19:17:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:42,704 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-12-09 19:17:42,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:17:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-12-09 19:17:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 19:17:42,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:42,705 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:42,705 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:17:42,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash 336148240, now seen corresponding path program 1 times [2018-12-09 19:17:42,706 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:42,706 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:42,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:42,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:42,842 INFO L478 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-12-09 19:17:42,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:42,849 INFO L478 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-12-09 19:17:42,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:42,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:42,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:17:44,159 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))))) is different from true [2018-12-09 19:17:44,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:44,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:44,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 19:17:44,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:44,181 INFO L478 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 17 [2018-12-09 19:17:44,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:44,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:44,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-09 19:17:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 19:17:44,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:44,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:44,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/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-12-09 19:17:44,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:44,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:44,401 INFO L478 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-12-09 19:17:44,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:44,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:44,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:17:44,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:44,452 INFO L478 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 17 [2018-12-09 19:17:44,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:44,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:44,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:44,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 19:17:44,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:44,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:44,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-09 19:17:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 19:17:44,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:44,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:17:44,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-12-09 19:17:44,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:17:44,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:17:44,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2018-12-09 19:17:44,567 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 11 states. [2018-12-09 19:17:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:45,655 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-12-09 19:17:45,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:17:45,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-12-09 19:17:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:45,656 INFO L225 Difference]: With dead ends: 127 [2018-12-09 19:17:45,656 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 19:17:45,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=65, Invalid=244, Unknown=1, NotChecked=32, Total=342 [2018-12-09 19:17:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 19:17:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2018-12-09 19:17:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 19:17:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-12-09 19:17:45,661 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 38 [2018-12-09 19:17:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:45,661 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-12-09 19:17:45,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:17:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-12-09 19:17:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 19:17:45,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:45,662 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:17:45,662 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:17:45,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1161634868, now seen corresponding path program 1 times [2018-12-09 19:17:45,662 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:45,662 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:45,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:45,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:45,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:17:45,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:45,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:17:45,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:45,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:45,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:17:46,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:17:46,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7] total 16 [2018-12-09 19:17:46,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 19:17:46,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 19:17:46,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:17:46,207 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 16 states. [2018-12-09 19:17:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:46,357 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2018-12-09 19:17:46,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:17:46,358 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-09 19:17:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:46,359 INFO L225 Difference]: With dead ends: 121 [2018-12-09 19:17:46,359 INFO L226 Difference]: Without dead ends: 118 [2018-12-09 19:17:46,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:17:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-09 19:17:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2018-12-09 19:17:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 19:17:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-12-09 19:17:46,363 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 41 [2018-12-09 19:17:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:46,363 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-12-09 19:17:46,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 19:17:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-12-09 19:17:46,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 19:17:46,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:46,365 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-12-09 19:17:46,365 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:17:46,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:46,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1651051823, now seen corresponding path program 2 times [2018-12-09 19:17:46,366 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:46,366 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:46,382 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 19:17:46,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:17:46,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:17:46,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:17:46,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 19:17:46,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:46,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:17:46,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 19:17:46,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:17:46,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:17:46,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:17:46,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 19:17:46,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:17:46,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7] total 7 [2018-12-09 19:17:46,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:17:46,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:17:46,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:17:46,804 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 7 states. [2018-12-09 19:17:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:46,994 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-12-09 19:17:46,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:17:46,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-12-09 19:17:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:46,994 INFO L225 Difference]: With dead ends: 111 [2018-12-09 19:17:46,995 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 19:17:46,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:17:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 19:17:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-09 19:17:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 19:17:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-12-09 19:17:46,997 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 56 [2018-12-09 19:17:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:46,997 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-12-09 19:17:46,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:17:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-12-09 19:17:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 19:17:46,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:46,998 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-12-09 19:17:46,998 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:17:46,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2112094387, now seen corresponding path program 1 times [2018-12-09 19:17:46,998 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:46,998 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:47,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:17:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:47,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:47,274 INFO L478 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-12-09 19:17:47,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:47,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:47,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:17:49,285 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-09 19:17:51,302 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-09 19:17:54,511 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) is different from true [2018-12-09 19:18:00,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:18:00,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:18:00,293 INFO L478 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 22 treesize of output 29 [2018-12-09 19:18:00,298 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-09 19:18:00,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:00,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:00,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:00,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-09 19:18:00,759 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-09 19:18:00,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-09 19:18:00,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:00,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:00,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-12-09 19:18:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 8 times theorem prover too weak. 3 trivial. 19 not checked. [2018-12-09 19:18:00,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:18:08,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:18:08,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:18:08,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:08,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:18:08,397 INFO L478 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-12-09 19:18:08,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:08,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:08,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:18:23,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:18:23,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:18:23,383 INFO L478 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 22 treesize of output 29 [2018-12-09 19:18:23,389 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-09 19:18:23,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:23,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:23,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:23,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-09 19:18:23,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-09 19:18:23,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:23,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:23,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2018-12-09 19:18:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 20 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 19:18:23,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:18:36,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:18:36,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 14 [2018-12-09 19:18:36,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 19:18:36,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 19:18:36,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=198, Unknown=28, NotChecked=96, Total=380 [2018-12-09 19:18:36,062 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 15 states. [2018-12-09 19:18:54,296 WARN L180 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-12-09 19:19:06,147 WARN L180 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-12-09 19:19:23,994 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |c_#valid|))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1)))))) is different from true [2018-12-09 19:20:01,996 WARN L180 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2018-12-09 19:20:05,432 WARN L180 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 18 [2018-12-09 19:23:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:23:16,737 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2018-12-09 19:23:16,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:23:16,738 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-12-09 19:23:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:23:16,739 INFO L225 Difference]: With dead ends: 192 [2018-12-09 19:23:16,739 INFO L226 Difference]: Without dead ends: 192 [2018-12-09 19:23:16,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 114 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 66.9s TimeCoverageRelationStatistics Valid=121, Invalid=403, Unknown=44, NotChecked=188, Total=756 [2018-12-09 19:23:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-09 19:23:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 140. [2018-12-09 19:23:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-09 19:23:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-12-09 19:23:16,743 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 57 [2018-12-09 19:23:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:23:16,744 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-12-09 19:23:16,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 19:23:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-12-09 19:23:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 19:23:16,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:23:16,745 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-12-09 19:23:16,745 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:23:16,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:23:16,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2112094386, now seen corresponding path program 1 times [2018-12-09 19:23:16,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:23:16,746 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:23:16,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:23:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:23:17,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:23:17,040 INFO L478 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-12-09 19:23:17,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:23:17,049 INFO L478 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-12-09 19:23:17,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:23:17,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:23:17,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:23:17,980 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)) (= |c_#length| (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32))))) is different from true [2018-12-09 19:23:19,366 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) |c_dll_create_#t~ret3.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32)) |c_dll_create_#t~ret3.base| (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-09 19:23:20,871 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32)) dll_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-09 19:23:20,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:20,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:20,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:20,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 19:23:20,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:23:20,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:20,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 19:23:20,944 INFO L478 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 23 treesize of output 34 [2018-12-09 19:23:20,944 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:23:20,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:23:20,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:23:20,973 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-12-09 19:23:21,806 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)))) is different from true [2018-12-09 19:23:21,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:21,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:21,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:21,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 37 [2018-12-09 19:23:21,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 19:23:21,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-09 19:23:21,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:60 [2018-12-09 19:23:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 23 not checked. [2018-12-09 19:23:21,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:23:22,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:23:22,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:23:22,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:23:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:23:22,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:23:22,245 INFO L478 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-12-09 19:23:22,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:23:22,253 INFO L478 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-12-09 19:23:22,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:23:22,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:23:22,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:23:24,264 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-09 19:23:25,047 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))))) is different from true [2018-12-09 19:23:26,890 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_8 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_8 (_ bv1 1)) |node_create_#t~malloc2.base|)) (= |c_#length| (store (store |c_old(#length)| v_prenex_8 (_ bv12 32)) |node_create_#t~malloc2.base| (_ bv12 32))) (= (select |c_old(#valid)| v_prenex_8) (_ bv0 1)))) is different from true [2018-12-09 19:23:26,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:26,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:26,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:26,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-09 19:23:26,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:23:26,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:26,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 19:23:26,961 INFO L478 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 23 treesize of output 34 [2018-12-09 19:23:26,961 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:23:26,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:23:26,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:23:26,981 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-12-09 19:23:40,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:40,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:40,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:23:40,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-09 19:23:40,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 19:23:40,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-12-09 19:23:40,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:90 [2018-12-09 19:23:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 30 not checked. [2018-12-09 19:23:41,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:23:41,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:23:41,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 24 [2018-12-09 19:23:41,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 19:23:41,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 19:23:41,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=323, Unknown=14, NotChecked=294, Total=702 [2018-12-09 19:23:41,265 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand 25 states. [2018-12-09 19:23:48,305 WARN L180 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-12-09 19:23:53,134 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_8 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_8 (_ bv1 1)) |node_create_#t~malloc2.base|)) (= |c_#length| (store (store |c_old(#length)| v_prenex_8 (_ bv12 32)) |node_create_#t~malloc2.base| (_ bv12 32))) (= (select |c_old(#valid)| v_prenex_8) (_ bv0 1)))) (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) |c_dll_create_#t~ret3.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32)) |c_dll_create_#t~ret3.base| (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base))))) is different from true [2018-12-09 19:23:54,294 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_8 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_8 (_ bv1 1)) |node_create_#t~malloc2.base|)) (= |c_#length| (store (store |c_old(#length)| v_prenex_8 (_ bv12 32)) |node_create_#t~malloc2.base| (_ bv12 32))) (= (select |c_old(#valid)| v_prenex_8) (_ bv0 1)))) (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32)) dll_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base))))) is different from true [2018-12-09 19:24:00,469 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-09 19:25:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:20,414 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2018-12-09 19:25:20,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:25:20,415 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-12-09 19:25:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:20,416 INFO L225 Difference]: With dead ends: 160 [2018-12-09 19:25:20,416 INFO L226 Difference]: Without dead ends: 160 [2018-12-09 19:25:20,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=116, Invalid=504, Unknown=16, NotChecked=486, Total=1122 [2018-12-09 19:25:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-09 19:25:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2018-12-09 19:25:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-09 19:25:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-12-09 19:25:20,419 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 57 [2018-12-09 19:25:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:20,419 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-12-09 19:25:20,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 19:25:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-12-09 19:25:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:25:20,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:20,420 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-12-09 19:25:20,420 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:25:20,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash 175456403, now seen corresponding path program 1 times [2018-12-09 19:25:20,421 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:25:20,421 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:25:20,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:20,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:20,652 INFO L478 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-12-09 19:25:20,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:20,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:20,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:25:21,280 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-09 19:25:23,294 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-09 19:25:27,231 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) is different from true [2018-12-09 19:25:29,235 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_create_~new_head~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 19:25:31,241 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_create_~head~0.base (_ bv1 1))))) is different from true [2018-12-09 19:25:33,247 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#res.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 19:25:33,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:33,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:33,254 INFO L478 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 22 treesize of output 29 [2018-12-09 19:25:33,259 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-09 19:25:33,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:33,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:33,274 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-12-09 19:25:33,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2018-12-09 19:25:36,007 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 19:25:36,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:36,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:36,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:36,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:36,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 53 [2018-12-09 19:25:36,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:36,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-12-09 19:25:36,130 INFO L478 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 22 treesize of output 25 [2018-12-09 19:25:36,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:36,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 19:25:36,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:36,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:36,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:36,154 INFO L478 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 27 treesize of output 39 [2018-12-09 19:25:36,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:36,172 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:36,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:36,199 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:36,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:36,242 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:65, output treesize:68 [2018-12-09 19:25:36,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-09 19:25:36,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:36,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 19:25:36,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:36,340 INFO L478 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 19 treesize of output 10 [2018-12-09 19:25:36,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:36,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:36,359 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-12-09 19:25:36,360 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:74, output treesize:41 [2018-12-09 19:25:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 2 refuted. 3 times theorem prover too weak. 1 trivial. 21 not checked. [2018-12-09 19:25:36,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:36,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:36,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:36,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:36,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-12-09 19:25:45,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:45,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:45,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:45,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:45,920 INFO L478 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-12-09 19:25:45,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:45,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:45,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:25:48,127 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-09 19:25:50,225 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)) (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) is different from true [2018-12-09 19:25:51,011 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) c_dll_create_~new_head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-09 19:25:51,683 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_1 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_subst_1)) (= |c_#valid| (store (store |c_old(#valid)| v_subst_1 (_ bv1 1)) c_dll_create_~head~0.base (_ bv1 1))))) is different from true [2018-12-09 19:25:53,688 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_1 (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| v_subst_1 (_ bv1 1)) |c_dll_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| v_subst_1)))) is different from true [2018-12-09 19:25:53,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:53,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:53,697 INFO L478 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 22 treesize of output 29 [2018-12-09 19:25:53,702 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-09 19:25:53,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:53,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:53,715 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-12-09 19:25:53,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-09 19:25:56,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:56,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:56,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:56,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:56,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 53 [2018-12-09 19:25:56,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:56,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-12-09 19:25:56,092 INFO L478 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 22 treesize of output 25 [2018-12-09 19:25:56,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:56,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 19:25:56,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:56,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:56,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:56,111 INFO L478 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 27 treesize of output 39 [2018-12-09 19:25:56,112 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:56,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:56,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:56,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:56,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:56,194 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:62, output treesize:64 [2018-12-09 19:25:56,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-09 19:25:56,308 INFO L478 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 19 treesize of output 10 [2018-12-09 19:25:56,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:56,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:56,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 19:25:56,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:56,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:56,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:56,350 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:73, output treesize:40 [2018-12-09 19:25:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2018-12-09 19:25:56,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:56,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:56,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:56,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:56,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-12-09 19:26:05,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:26:05,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 38 [2018-12-09 19:26:05,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-09 19:26:05,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-09 19:26:05,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=894, Unknown=18, NotChecked=770, Total=1806 [2018-12-09 19:26:05,098 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 39 states. [2018-12-09 19:26:23,304 WARN L180 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-12-09 19:26:27,509 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-09 19:26:33,150 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)) (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1)))))) is different from true [2018-12-09 19:26:33,999 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) c_dll_create_~new_head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_create_~new_head~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-09 19:26:35,156 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_create_~head~0.base (_ bv1 1))))) (exists ((v_subst_1 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_subst_1)) (= |c_#valid| (store (store |c_old(#valid)| v_subst_1 (_ bv1 1)) c_dll_create_~head~0.base (_ bv1 1)))))) is different from true [2018-12-09 19:26:36,101 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_subst_1 (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| v_subst_1 (_ bv1 1)) |c_dll_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| v_subst_1)))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#res.base| (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-09 19:26:36,574 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-09 19:26:37,732 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-09 19:26:38,210 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-12-09 19:26:42,877 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-12-09 19:26:43,155 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-12-09 19:27:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:28,536 INFO L93 Difference]: Finished difference Result 189 states and 206 transitions. [2018-12-09 19:27:28,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 19:27:28,537 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-12-09 19:27:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:28,537 INFO L225 Difference]: With dead ends: 189 [2018-12-09 19:27:28,538 INFO L226 Difference]: Without dead ends: 189 [2018-12-09 19:27:28,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 65.5s TimeCoverageRelationStatistics Valid=213, Invalid=1462, Unknown=25, NotChecked=1380, Total=3080 [2018-12-09 19:27:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-09 19:27:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 141. [2018-12-09 19:27:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 19:27:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2018-12-09 19:27:28,543 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 61 [2018-12-09 19:27:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:28,543 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2018-12-09 19:27:28,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-09 19:27:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2018-12-09 19:27:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:27:28,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:28,544 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-12-09 19:27:28,544 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:27:28,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash 175456404, now seen corresponding path program 1 times [2018-12-09 19:27:28,545 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:27:28,545 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:27:28,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:28,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:27:28,866 INFO L478 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-12-09 19:27:28,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:28,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:28,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:27:29,493 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-09 19:27:29,499 INFO L478 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-12-09 19:27:29,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:29,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:29,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-09 19:27:30,329 WARN L180 SmtUtils]: Spent 790.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-09 19:27:32,354 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 19:27:33,275 WARN L180 SmtUtils]: Spent 899.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-09 19:27:34,125 WARN L180 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 19:27:34,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:34,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:34,130 INFO L478 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 22 treesize of output 29 [2018-12-09 19:27:34,135 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-09 19:27:34,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:34,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:34,155 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-12-09 19:27:34,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2018-12-09 19:27:36,744 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32))) (.cse1 (bvadd node_create_~temp~0.offset (_ bv8 32)))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv12 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base))))) is different from true [2018-12-09 19:27:36,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:36,765 INFO L478 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 18 treesize of output 25 [2018-12-09 19:27:36,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:36,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:36,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:36,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:36,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:36,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-09 19:27:36,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-12-09 19:27:37,088 INFO L478 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 22 treesize of output 25 [2018-12-09 19:27:37,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:37,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 19:27:37,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:37,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:37,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:37,117 INFO L478 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 27 treesize of output 39 [2018-12-09 19:27:37,118 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,138 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,152 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-09 19:27:37,262 INFO L478 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 22 treesize of output 25 [2018-12-09 19:27:37,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:37,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 19:27:37,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:37,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:37,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:37,288 INFO L478 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 27 treesize of output 39 [2018-12-09 19:27:37,288 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,304 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,315 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,329 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:37,374 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:108, output treesize:75 [2018-12-09 19:27:37,491 INFO L478 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 33 treesize of output 29 [2018-12-09 19:27:37,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:37,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 19:27:37,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,512 INFO L478 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-12-09 19:27:37,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,546 INFO L478 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 45 treesize of output 39 [2018-12-09 19:27:37,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:37,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 19:27:37,551 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,562 INFO L478 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 21 treesize of output 12 [2018-12-09 19:27:37,563 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:37,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:37,577 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:88, output treesize:22 [2018-12-09 19:27:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 25 not checked. [2018-12-09 19:27:37,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:27:38,753 WARN L180 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 19:27:38,937 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 19:27:39,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:39,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:40,637 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:40,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:41,484 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:41,510 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:42,230 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:42,257 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:42,768 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:42,790 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:42,986 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:43,005 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:43,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-12-09 19:27:43,168 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:220, output treesize:154 [2018-12-09 19:27:50,604 WARN L180 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 80 [2018-12-09 19:27:50,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:27:50,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:27:50,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:50,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:27:50,675 INFO L478 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-12-09 19:27:50,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:50,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:50,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:27:51,146 INFO L478 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-12-09 19:27:51,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-09 19:28:02,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-09 19:28:02,461 INFO L478 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 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-09 19:28:02,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:02,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:02,473 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-12-09 19:28:02,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-09 19:28:03,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,015 INFO L478 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-12-09 19:28:03,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-12-09 19:28:03,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-12-09 19:28:03,259 INFO L478 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 22 treesize of output 25 [2018-12-09 19:28:03,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 19:28:03,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,287 INFO L478 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 27 treesize of output 39 [2018-12-09 19:28:03,288 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-09 19:28:03,417 INFO L478 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 22 treesize of output 25 [2018-12-09 19:28:03,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 19:28:03,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,439 INFO L478 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 27 treesize of output 39 [2018-12-09 19:28:03,439 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,454 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,463 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,475 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:03,506 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:94, output treesize:70 [2018-12-09 19:28:03,722 INFO L478 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 33 treesize of output 29 [2018-12-09 19:28:03,726 INFO L478 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-12-09 19:28:03,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 19:28:03,743 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,785 INFO L478 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 43 treesize of output 37 [2018-12-09 19:28:03,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:28:03,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 19:28:03,791 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,802 INFO L478 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 19 treesize of output 10 [2018-12-09 19:28:03,803 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:03,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:03,816 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:86, output treesize:20 [2018-12-09 19:28:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-09 19:28:03,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:28:04,436 WARN L180 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 19:28:04,627 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 19:28:04,717 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:04,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:07,442 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:07,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:08,520 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:08,542 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:09,207 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:09,241 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:09,609 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:09,639 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:09,878 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:09,893 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:10,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-12-09 19:28:10,063 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:220, output treesize:154 [2018-12-09 19:28:14,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:28:14,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 38 [2018-12-09 19:28:14,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-09 19:28:14,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-09 19:28:14,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1530, Unknown=8, NotChecked=158, Total=1806 [2018-12-09 19:28:14,518 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand 39 states. [2018-12-09 19:28:29,133 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 19:28:37,763 WARN L180 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-12-09 19:28:40,712 WARN L180 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-12-09 19:28:42,832 WARN L180 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-12-09 19:28:47,044 WARN L180 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2018-12-09 19:28:51,258 WARN L180 SmtUtils]: Spent 3.72 s on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-12-09 19:28:54,024 WARN L180 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-12-09 19:28:57,345 WARN L180 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-09 19:29:03,564 WARN L180 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-09 19:29:04,286 WARN L180 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 19:29:05,893 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-12-09 19:29:15,004 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-12-09 19:29:15,686 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-12-09 19:29:16,025 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-12-09 19:29:20,616 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-12-09 19:29:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:25,369 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2018-12-09 19:29:25,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 19:29:25,370 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-12-09 19:29:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:25,370 INFO L225 Difference]: With dead ends: 167 [2018-12-09 19:29:25,370 INFO L226 Difference]: Without dead ends: 167 [2018-12-09 19:29:25,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 81.4s TimeCoverageRelationStatistics Valid=253, Invalid=3165, Unknown=12, NotChecked=230, Total=3660 [2018-12-09 19:29:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-09 19:29:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2018-12-09 19:29:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-09 19:29:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2018-12-09 19:29:25,373 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 61 [2018-12-09 19:29:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:25,373 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2018-12-09 19:29:25,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-09 19:29:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2018-12-09 19:29:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:29:25,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:25,374 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-12-09 19:29:25,374 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:29:25,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:25,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1139442047, now seen corresponding path program 1 times [2018-12-09 19:29:25,374 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:29:25,375 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:29:25,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:25,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 19:29:25,583 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:29:25,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:25,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:29:25,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:29:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:29:25,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:29:25,586 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand 6 states. [2018-12-09 19:29:25,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:25,981 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2018-12-09 19:29:25,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:29:25,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 19:29:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:25,982 INFO L225 Difference]: With dead ends: 142 [2018-12-09 19:29:25,982 INFO L226 Difference]: Without dead ends: 142 [2018-12-09 19:29:25,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:29:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-09 19:29:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-09 19:29:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-09 19:29:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2018-12-09 19:29:25,986 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 62 [2018-12-09 19:29:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:25,986 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2018-12-09 19:29:25,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:29:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2018-12-09 19:29:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 19:29:25,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:25,987 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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-12-09 19:29:25,987 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:29:25,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:25,987 INFO L82 PathProgramCache]: Analyzing trace with hash -212855009, now seen corresponding path program 1 times [2018-12-09 19:29:25,988 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:29:25,988 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:29:26,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:26,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:26,162 INFO L478 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-12-09 19:29:26,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:26,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:26,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:29:26,209 INFO L478 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-12-09 19:29:26,211 INFO L478 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-12-09 19:29:26,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:26,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:26,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:26,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2018-12-09 19:29:26,253 INFO L478 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-12-09 19:29:26,255 INFO L478 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-12-09 19:29:26,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:26,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:26,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:26,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-09 19:29:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 19:29:26,283 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:29:26,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:26,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:29:26,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:29:26,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:29:26,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:29:26,286 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand 12 states. [2018-12-09 19:29:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:27,254 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2018-12-09 19:29:27,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:29:27,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-12-09 19:29:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:27,255 INFO L225 Difference]: With dead ends: 169 [2018-12-09 19:29:27,255 INFO L226 Difference]: Without dead ends: 169 [2018-12-09 19:29:27,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:29:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-09 19:29:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2018-12-09 19:29:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-09 19:29:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2018-12-09 19:29:27,258 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 64 [2018-12-09 19:29:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:27,258 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2018-12-09 19:29:27,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:29:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2018-12-09 19:29:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 19:29:27,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:27,258 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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-12-09 19:29:27,258 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:29:27,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:27,259 INFO L82 PathProgramCache]: Analyzing trace with hash -212855008, now seen corresponding path program 1 times [2018-12-09 19:29:27,259 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:29:27,259 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:29:27,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:27,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:27,464 INFO L478 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-12-09 19:29:27,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:29:27,535 INFO L478 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-12-09 19:29:27,538 INFO L478 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-12-09 19:29:27,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,554 INFO L478 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-12-09 19:29:27,556 INFO L478 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-12-09 19:29:27,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-09 19:29:27,608 INFO L478 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-12-09 19:29:27,610 INFO L478 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-12-09 19:29:27,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,620 INFO L478 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 17 treesize of output 13 [2018-12-09 19:29:27,622 INFO L478 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 13 treesize of output 5 [2018-12-09 19:29:27,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:27,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-09 19:29:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 19:29:27,669 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:29:27,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:27,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:29:27,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:29:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:29:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:29:27,673 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand 12 states. [2018-12-09 19:29:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:28,668 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2018-12-09 19:29:28,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:29:28,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-12-09 19:29:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:28,669 INFO L225 Difference]: With dead ends: 179 [2018-12-09 19:29:28,669 INFO L226 Difference]: Without dead ends: 179 [2018-12-09 19:29:28,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:29:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-09 19:29:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 153. [2018-12-09 19:29:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-09 19:29:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2018-12-09 19:29:28,672 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 64 [2018-12-09 19:29:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:28,672 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2018-12-09 19:29:28,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:29:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2018-12-09 19:29:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:29:28,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:28,673 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1] [2018-12-09 19:29:28,673 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION]=== [2018-12-09 19:29:28,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:28,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1445458633, now seen corresponding path program 1 times [2018-12-09 19:29:28,673 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:29:28,673 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:29:28,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:29,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:29,012 INFO L478 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-12-09 19:29:29,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:29,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:29,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:29:29,217 INFO L478 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 13 treesize of output 10 [2018-12-09 19:29:29,220 INFO L478 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 10 treesize of output 9 [2018-12-09 19:29:29,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:29,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:29,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:29,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-12-09 19:29:29,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:29,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-12-09 19:29:29,312 INFO L478 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 16 treesize of output 15 [2018-12-09 19:29:29,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:29,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:29,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:29,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:59 [2018-12-09 19:29:29,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:29,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:29,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:29,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2018-12-09 19:29:29,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 48 [2018-12-09 19:29:29,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:29,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:29,752 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-12-09 19:29:29,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:60 [2018-12-09 19:29:32,877 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32))) (.cse1 (bvadd node_create_~temp~0.offset (_ bv8 32)))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-09 19:29:32,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:32,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:32,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:32,911 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:29:32,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 123 [2018-12-09 19:29:32,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-09 19:29:33,134 INFO L478 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 22 treesize of output 25 [2018-12-09 19:29:33,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:33,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 19:29:33,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:33,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:33,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:33,175 INFO L478 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 27 treesize of output 39 [2018-12-09 19:29:33,175 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 117 [2018-12-09 19:29:33,425 INFO L478 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 22 treesize of output 25 [2018-12-09 19:29:33,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:33,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 19:29:33,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:33,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:33,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:33,453 INFO L478 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 27 treesize of output 39 [2018-12-09 19:29:33,454 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,473 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,489 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,529 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:33,600 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:157, output treesize:162 [2018-12-09 19:29:33,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-09 19:29:33,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:33,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 19:29:33,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,882 INFO L478 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-12-09 19:29:33,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:33,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:33,967 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:175, output treesize:146 [2018-12-09 19:29:34,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 85 [2018-12-09 19:29:34,289 INFO L478 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 9 treesize of output 1 [2018-12-09 19:29:34,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:34,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:34,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 19:29:34,338 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:34,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 28 treesize of output 20 [2018-12-09 19:29:34,360 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:34,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 32 treesize of output 19 [2018-12-09 19:29:34,383 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:34,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:34,417 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-12-09 19:29:34,417 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:147, output treesize:49 [2018-12-09 19:29:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-09 19:29:34,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:29:36,073 WARN L180 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 19:29:36,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:36,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:36,353 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:36,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:36,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:36,392 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:85 [2018-12-09 19:29:53,082 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 19:29:53,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:53,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce88502-8f2f-4dd3-9192-67ebcfbb7b2e/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:29:53,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:53,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:53,170 INFO L478 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-12-09 19:29:53,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:53,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:53,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:29:54,266 INFO L478 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 13 treesize of output 10 [2018-12-09 19:29:54,268 INFO L478 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 10 treesize of output 9 [2018-12-09 19:29:54,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:54,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:54,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:54,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:30 [2018-12-09 19:29:54,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:54,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 72 [2018-12-09 19:29:54,477 INFO L478 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 16 treesize of output 15 [2018-12-09 19:29:54,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:54,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:54,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:54,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:48 [2018-12-09 19:29:55,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:55,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:55,197 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-12-09 19:29:55,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-12-09 19:29:55,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:55,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:55,247 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-12-09 19:29:55,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:54 [2018-12-09 19:29:58,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 87 [2018-12-09 19:29:58,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,786 INFO L303 Elim1Store]: Index analysis took 111 ms [2018-12-09 19:29:58,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 108 [2018-12-09 19:29:58,797 INFO L478 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 22 treesize of output 25 [2018-12-09 19:29:58,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 19:29:58,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,836 INFO L478 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 27 treesize of output 39 [2018-12-09 19:29:58,836 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,948 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:59,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-09 19:29:59,060 INFO L478 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 22 treesize of output 25 [2018-12-09 19:29:59,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:59,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-09 19:29:59,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:59,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:59,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:59,094 INFO L478 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 27 treesize of output 39 [2018-12-09 19:29:59,094 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:59,112 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:59,128 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:59,146 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:59,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:59,209 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:141, output treesize:145 [2018-12-09 19:29:59,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-09 19:29:59,517 INFO L478 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-12-09 19:29:59,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:59,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:59,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 19:29:59,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:59,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:59,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:59,635 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:161, output treesize:132 [2018-12-09 19:30:02,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 86 [2018-12-09 19:30:02,591 INFO L478 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 73 treesize of output 62 [2018-12-09 19:30:02,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:30:02,699 INFO L478 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 73 treesize of output 64 [2018-12-09 19:30:02,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:30:02,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:30:02,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-12-09 19:30:02,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:30:02,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 [2018-12-09 19:30:02,874 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:02,949 INFO L478 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 42 treesize of output 31 [2018-12-09 19:30:02,949 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:30:03,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:30:03,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-12-09 19:30:03,032 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 19:30:03,088 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2018-12-09 19:30:03,088 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:03,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 19:30:03,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-09 19:30:03,157 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:133, output treesize:91 [2018-12-09 19:30:04,451 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2018-12-09 19:30:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-09 19:30:04,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:30:08,490 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-09 19:30:08,662 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 19:30:08,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:08,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:08,815 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:08,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:08,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:08,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:111 [2018-12-09 19:30:21,072 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 19:30:21,273 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:30:21,274 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:893) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) 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.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) 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:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-09 19:30:21,279 INFO L168 Benchmark]: Toolchain (without parser) took 767266.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:30:21,280 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:30:21,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:30:21,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.11 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-12-09 19:30:21,281 INFO L168 Benchmark]: Boogie Preprocessor took 22.12 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:30:21,281 INFO L168 Benchmark]: RCFGBuilder took 439.88 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: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:30:21,281 INFO L168 Benchmark]: TraceAbstraction took 766457.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -46.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:30:21,283 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.11 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. * Boogie Preprocessor took 22.12 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 439.88 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: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 766457.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -46.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...