./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal_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_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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 a4f285607323e922caa9bbc912c8526475badf88 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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 a4f285607323e922caa9bbc912c8526475badf88 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 03:57:51,921 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:57:51,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:57:51,931 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:57:51,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:57:51,932 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:57:51,933 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:57:51,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:57:51,935 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:57:51,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:57:51,937 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:57:51,937 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:57:51,938 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:57:51,938 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:57:51,939 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:57:51,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:57:51,940 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:57:51,942 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:57:51,943 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:57:51,944 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:57:51,945 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:57:51,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:57:51,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:57:51,948 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:57:51,948 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:57:51,949 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:57:51,949 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:57:51,950 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:57:51,951 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:57:51,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:57:51,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:57:51,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:57:51,952 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:57:51,952 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:57:51,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:57:51,953 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:57:51,954 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 03:57:51,964 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:57:51,965 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:57:51,965 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:57:51,965 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:57:51,966 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 03:57:51,966 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 03:57:51,966 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 03:57:51,966 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 03:57:51,966 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 03:57:51,966 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 03:57:51,966 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 03:57:51,967 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 03:57:51,967 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 03:57:51,967 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 03:57:51,967 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 03:57:51,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:57:51,968 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:57:51,968 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 03:57:51,968 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:57:51,968 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:57:51,968 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:57:51,968 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 03:57:51,969 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 03:57:51,969 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 03:57:51,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:57:51,969 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:57:51,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:57:51,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:57:51,969 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:57:51,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:57:51,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:57:51,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:57:51,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:57:51,970 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 03:57:51,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:57:51,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 03:57:51,970 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_8de93d14-2974-4d08-a4a3-873cae9253b9/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 -> a4f285607323e922caa9bbc912c8526475badf88 [2018-12-02 03:57:51,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:57:52,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:57:52,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:57:52,006 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:57:52,006 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:57:52,007 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 03:57:52,052 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/data/40a80d05f/f369ba9680594116a70c235e4a0c55c3/FLAG62d690671 [2018-12-02 03:57:52,405 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:57:52,406 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 03:57:52,411 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/data/40a80d05f/f369ba9680594116a70c235e4a0c55c3/FLAG62d690671 [2018-12-02 03:57:52,419 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/data/40a80d05f/f369ba9680594116a70c235e4a0c55c3 [2018-12-02 03:57:52,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:57:52,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:57:52,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:57:52,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:57:52,424 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:57:52,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:57:52" (1/1) ... [2018-12-02 03:57:52,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586b3ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52, skipping insertion in model container [2018-12-02 03:57:52,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:57:52" (1/1) ... [2018-12-02 03:57:52,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:57:52,451 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:57:52,621 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:57:52,658 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:57:52,685 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:57:52,712 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:57:52,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52 WrapperNode [2018-12-02 03:57:52,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:57:52,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:57:52,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:57:52,713 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:57:52,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52" (1/1) ... [2018-12-02 03:57:52,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52" (1/1) ... [2018-12-02 03:57:52,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:57:52,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:57:52,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:57:52,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:57:52,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52" (1/1) ... [2018-12-02 03:57:52,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52" (1/1) ... [2018-12-02 03:57:52,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52" (1/1) ... [2018-12-02 03:57:52,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52" (1/1) ... [2018-12-02 03:57:52,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52" (1/1) ... [2018-12-02 03:57:52,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52" (1/1) ... [2018-12-02 03:57:52,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52" (1/1) ... [2018-12-02 03:57:52,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:57:52,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:57:52,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:57:52,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:57:52,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:57:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-02 03:57:52,785 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-02 03:57:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 03:57:52,786 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 03:57:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:57:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 03:57:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-12-02 03:57:52,786 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-12-02 03:57:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:57:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 03:57:52,786 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 03:57:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 03:57:52,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 03:57:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 03:57:52,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 03:57:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 03:57:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 03:57:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:57:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 03:57:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-02 03:57:52,787 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-02 03:57:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:57:52,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:57:53,028 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:57:53,028 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 03:57:53,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:57:53 BoogieIcfgContainer [2018-12-02 03:57:53,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:57:53,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 03:57:53,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 03:57:53,032 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 03:57:53,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:57:52" (1/3) ... [2018-12-02 03:57:53,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab68a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:57:53, skipping insertion in model container [2018-12-02 03:57:53,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:52" (2/3) ... [2018-12-02 03:57:53,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab68a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:57:53, skipping insertion in model container [2018-12-02 03:57:53,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:57:53" (3/3) ... [2018-12-02 03:57:53,034 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 03:57:53,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 03:57:53,048 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-02 03:57:53,058 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-02 03:57:53,073 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 03:57:53,073 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 03:57:53,073 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 03:57:53,073 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:57:53,073 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:57:53,073 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 03:57:53,074 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:57:53,074 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 03:57:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-12-02 03:57:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 03:57:53,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:57:53,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:57:53,091 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 03:57:53,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:57:53,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1698934950, now seen corresponding path program 1 times [2018-12-02 03:57:53,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:57:53,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:57:53,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:57:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:57:53,199 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-02 03:57:53,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:57:53,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:57:53,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:57:53,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:57:53,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:57:53,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:57:53,213 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-12-02 03:57:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:57:53,285 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2018-12-02 03:57:53,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:57:53,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 03:57:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:57:53,291 INFO L225 Difference]: With dead ends: 108 [2018-12-02 03:57:53,291 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 03:57:53,292 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-02 03:57:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 03:57:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-02 03:57:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 03:57:53,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-02 03:57:53,317 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 13 [2018-12-02 03:57:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:57:53,317 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-02 03:57:53,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:57:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-02 03:57:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 03:57:53,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:57:53,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:57:53,318 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 03:57:53,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:57:53,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1698934949, now seen corresponding path program 1 times [2018-12-02 03:57:53,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:57:53,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:57:53,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:57:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:57:53,360 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-02 03:57:53,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:57:53,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:57:53,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:57:53,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:57:53,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:57:53,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:57:53,362 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 3 states. [2018-12-02 03:57:53,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:57:53,424 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-12-02 03:57:53,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:57:53,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 03:57:53,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:57:53,425 INFO L225 Difference]: With dead ends: 98 [2018-12-02 03:57:53,425 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 03:57:53,425 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-02 03:57:53,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 03:57:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-02 03:57:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 03:57:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-02 03:57:53,430 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 13 [2018-12-02 03:57:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:57:53,430 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-02 03:57:53,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:57:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-02 03:57:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 03:57:53,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:57:53,430 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-02 03:57:53,431 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 03:57:53,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:57:53,431 INFO L82 PathProgramCache]: Analyzing trace with hash 727447706, now seen corresponding path program 1 times [2018-12-02 03:57:53,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:57:53,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:57:53,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:57:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:57:53,480 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-02 03:57:53,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:57:53,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:57:53,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:57:53,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:57:53,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:57:53,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:57:53,481 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 6 states. [2018-12-02 03:57:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:57:53,597 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-12-02 03:57:53,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:57:53,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 03:57:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:57:53,599 INFO L225 Difference]: With dead ends: 101 [2018-12-02 03:57:53,599 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 03:57:53,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:57:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 03:57:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-12-02 03:57:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 03:57:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-12-02 03:57:53,605 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 20 [2018-12-02 03:57:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:57:53,605 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-12-02 03:57:53,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:57:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-12-02 03:57:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 03:57:53,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:57:53,606 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-02 03:57:53,606 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 03:57:53,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:57:53,607 INFO L82 PathProgramCache]: Analyzing trace with hash 727447707, now seen corresponding path program 1 times [2018-12-02 03:57:53,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:57:53,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:57:53,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:57:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:57:53,653 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-02 03:57:53,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:57:53,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:57:53,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:57:53,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:57:53,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:57:53,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:57:53,654 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 6 states. [2018-12-02 03:57:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:57:53,768 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-12-02 03:57:53,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:57:53,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 03:57:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:57:53,769 INFO L225 Difference]: With dead ends: 99 [2018-12-02 03:57:53,769 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 03:57:53,769 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-02 03:57:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 03:57:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2018-12-02 03:57:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 03:57:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-12-02 03:57:53,773 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 20 [2018-12-02 03:57:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:57:53,773 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-12-02 03:57:53,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:57:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-12-02 03:57:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 03:57:53,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:57:53,774 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-02 03:57:53,774 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 03:57:53,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:57:53,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1010307422, now seen corresponding path program 1 times [2018-12-02 03:57:53,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:57:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:57:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:57:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:57:53,797 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-02 03:57:53,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:57:53,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:57:53,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:57:53,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:57:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:57:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:57:53,798 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 3 states. [2018-12-02 03:57:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:57:53,810 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-12-02 03:57:53,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:57:53,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 03:57:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:57:53,811 INFO L225 Difference]: With dead ends: 104 [2018-12-02 03:57:53,811 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 03:57:53,812 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-02 03:57:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 03:57:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-12-02 03:57:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 03:57:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-02 03:57:53,816 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 23 [2018-12-02 03:57:53,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:57:53,816 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-02 03:57:53,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:57:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-02 03:57:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 03:57:53,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:57:53,817 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-02 03:57:53,817 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 03:57:53,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:57:53,817 INFO L82 PathProgramCache]: Analyzing trace with hash 51055154, now seen corresponding path program 1 times [2018-12-02 03:57:53,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:57:53,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:57:53,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:57:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:57:53,852 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-02 03:57:53,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:57:53,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:57:53,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:57:53,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:57:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:57:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:57:53,853 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 5 states. [2018-12-02 03:57:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:57:53,870 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-12-02 03:57:53,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:57:53,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-02 03:57:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:57:53,871 INFO L225 Difference]: With dead ends: 104 [2018-12-02 03:57:53,871 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 03:57:53,871 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-02 03:57:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 03:57:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-02 03:57:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 03:57:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-12-02 03:57:53,875 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 26 [2018-12-02 03:57:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:57:53,875 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-12-02 03:57:53,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:57:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-12-02 03:57:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 03:57:53,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:57:53,876 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-02 03:57:53,876 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 03:57:53,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:57:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1204250717, now seen corresponding path program 1 times [2018-12-02 03:57:53,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:57:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:57:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:53,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:57:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:57:54,020 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-02 03:57:54,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:57:54,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:57:54,021 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-02 03:57:54,022 INFO L205 CegarAbsIntRunner]: [0], [67], [68], [74], [83], [85], [86], [89], [94], [96], [99], [101], [155], [161], [163], [166], [169], [172], [173], [174], [180], [181], [184], [185], [186] [2018-12-02 03:57:54,046 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:57:54,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:57:54,214 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:57:54,215 INFO L272 AbstractInterpreter]: Visited 25 different actions 58 times. Merged at 9 different actions 16 times. Never widened. Performed 716 root evaluator evaluations with a maximum evaluation depth of 3. Performed 716 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-02 03:57:54,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:57:54,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:57:54,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:57:54,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:57:54,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:57:54,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:57:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:57:54,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:57:54,291 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-02 03:57:54,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:57:54,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:57:54,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 03:57:54,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:57:54,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:57:54,343 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-02 03:57:54,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:57:54,349 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-02 03:57:54,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-02 03:57:54,377 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-02 03:57:54,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:57:54,773 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-02 03:57:54,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 03:57:54,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2018-12-02 03:57:54,788 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 03:57:54,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 03:57:54,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 03:57:54,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=323, Unknown=1, NotChecked=0, Total=380 [2018-12-02 03:57:54,789 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 13 states. [2018-12-02 03:57:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:57:56,824 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-12-02 03:57:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 03:57:56,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-12-02 03:57:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:57:56,825 INFO L225 Difference]: With dead ends: 116 [2018-12-02 03:57:56,825 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 03:57:56,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=578, Unknown=1, NotChecked=0, Total=702 [2018-12-02 03:57:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 03:57:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-12-02 03:57:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 03:57:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-12-02 03:57:56,829 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 38 [2018-12-02 03:57:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:57:56,829 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-12-02 03:57:56,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 03:57:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-12-02 03:57:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 03:57:56,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:57:56,830 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-02 03:57:56,830 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 03:57:56,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:57:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1204250716, now seen corresponding path program 1 times [2018-12-02 03:57:56,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:57:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:56,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:57:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:57:56,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:57:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:57:56,946 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-02 03:57:56,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:57:56,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:57:56,946 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-02 03:57:56,946 INFO L205 CegarAbsIntRunner]: [0], [67], [68], [74], [83], [85], [86], [89], [94], [97], [99], [101], [155], [161], [163], [166], [169], [172], [173], [174], [180], [181], [184], [185], [186] [2018-12-02 03:57:56,948 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:57:56,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:57:57,033 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:57:57,034 INFO L272 AbstractInterpreter]: Visited 25 different actions 58 times. Merged at 9 different actions 16 times. Never widened. Performed 724 root evaluator evaluations with a maximum evaluation depth of 3. Performed 724 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-02 03:57:57,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:57:57,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:57:57,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:57:57,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:57:57,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:57:57,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:57:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:57:57,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:57:57,082 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-02 03:57:57,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:57:57,098 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-02 03:57:57,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:57:57,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:57:57,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 03:57:57,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:57:57,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:57:57,247 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-02 03:57:57,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:57:57,257 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-02 03:57:57,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:57:57,266 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-02 03:57:57,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-12-02 03:57:57,291 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-02 03:57:57,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:57:59,364 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-12-02 03:57:59,368 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-02 03:58:09,610 WARN L180 SmtUtils]: Spent 10.08 s on a formula simplification. DAG size of input: 60 DAG size of output: 28 [2018-12-02 03:58:09,621 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 03:58:09,878 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-02 03:58:09,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 03:58:09,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 27 [2018-12-02 03:58:09,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 03:58:09,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 03:58:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 03:58:09,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2018-12-02 03:58:09,895 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 18 states. [2018-12-02 03:58:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:10,686 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-12-02 03:58:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 03:58:10,687 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-12-02 03:58:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:10,689 INFO L225 Difference]: With dead ends: 116 [2018-12-02 03:58:10,689 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 03:58:10,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 03:58:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 03:58:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2018-12-02 03:58:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 03:58:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-12-02 03:58:10,697 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 38 [2018-12-02 03:58:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:10,697 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-12-02 03:58:10,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 03:58:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-12-02 03:58:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 03:58:10,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:10,699 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-02 03:58:10,699 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 03:58:10,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -982633071, now seen corresponding path program 1 times [2018-12-02 03:58:10,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:58:10,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:58:10,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:10,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:58:10,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:58:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:10,740 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-02 03:58:10,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:58:10,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:58:10,741 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-12-02 03:58:10,741 INFO L205 CegarAbsIntRunner]: [0], [2], [67], [68], [74], [81], [83], [85], [86], [89], [99], [101], [105], [106], [107], [109], [112], [155], [161], [163], [166], [169], [172], [173], [174], [175], [176], [180], [181], [182], [183], [184], [185], [186] [2018-12-02 03:58:10,742 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:58:10,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:58:10,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:58:10,817 INFO L272 AbstractInterpreter]: Visited 34 different actions 76 times. Merged at 10 different actions 17 times. Never widened. Performed 878 root evaluator evaluations with a maximum evaluation depth of 3. Performed 878 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-02 03:58:10,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:10,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:58:10,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:58:10,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:10,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:10,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:58:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:10,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:10,862 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-02 03:58:10,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:58:10,925 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-02 03:58:10,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 03:58:10,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-12-02 03:58:10,940 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 03:58:10,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:58:10,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:58:10,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:58:10,940 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 6 states. [2018-12-02 03:58:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:10,963 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-12-02 03:58:10,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:58:10,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-12-02 03:58:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:10,964 INFO L225 Difference]: With dead ends: 110 [2018-12-02 03:58:10,964 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 03:58:10,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:58:10,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 03:58:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2018-12-02 03:58:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 03:58:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-12-02 03:58:10,967 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 41 [2018-12-02 03:58:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:10,967 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-12-02 03:58:10,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:58:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-12-02 03:58:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 03:58:10,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:10,968 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-02 03:58:10,968 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 03:58:10,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:10,968 INFO L82 PathProgramCache]: Analyzing trace with hash -971964334, now seen corresponding path program 2 times [2018-12-02 03:58:10,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:58:10,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:58:10,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:10,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:58:10,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:58:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:11,016 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-02 03:58:11,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:58:11,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:58:11,016 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 03:58:11,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 03:58:11,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:58:11,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:58:11,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 03:58:11,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 03:58:11,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 03:58:11,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:58:11,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:11,156 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-02 03:58:11,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:58:11,231 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-02 03:58:11,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 03:58:11,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-02 03:58:11,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 03:58:11,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:58:11,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:58:11,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:58:11,247 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 7 states. [2018-12-02 03:58:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:11,302 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-12-02 03:58:11,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:58:11,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-12-02 03:58:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:11,303 INFO L225 Difference]: With dead ends: 100 [2018-12-02 03:58:11,303 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 03:58:11,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:58:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 03:58:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-02 03:58:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 03:58:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-02 03:58:11,306 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 56 [2018-12-02 03:58:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:11,306 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-02 03:58:11,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:58:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-02 03:58:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 03:58:11,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:11,307 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-02 03:58:11,308 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 03:58:11,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash 152245522, now seen corresponding path program 1 times [2018-12-02 03:58:11,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:58:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:58:11,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:58:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:58:11,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:58:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 03:58:11,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:58:11,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:58:11,693 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-02 03:58:11,693 INFO L205 CegarAbsIntRunner]: [0], [2], [67], [68], [74], [81], [83], [85], [86], [89], [94], [95], [99], [101], [105], [106], [107], [109], [112], [155], [161], [163], [166], [169], [172], [173], [174], [175], [176], [180], [181], [182], [183], [184], [185], [186] [2018-12-02 03:58:11,694 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:58:11,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:58:11,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:58:11,744 INFO L272 AbstractInterpreter]: Visited 36 different actions 82 times. Merged at 12 different actions 19 times. Never widened. Performed 958 root evaluator evaluations with a maximum evaluation depth of 3. Performed 958 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 27 variables. [2018-12-02 03:58:11,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:11,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:58:11,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:58:11,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:58:11,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:11,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:58:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:11,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:11,789 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-02 03:58:11,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:11,793 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-02 03:58:11,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:11,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:11,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 03:58:12,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:12,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:12,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 03:58:12,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:12,030 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-02 03:58:12,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:12,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:12,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:12,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:12,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:12,050 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 25 treesize of output 42 [2018-12-02 03:58:12,052 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 30 treesize of output 34 [2018-12-02 03:58:12,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:12,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:12,065 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-02 03:58:12,065 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2018-12-02 03:58:15,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:15,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:15,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:15,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:15,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:15,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:15,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-02 03:58:15,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:15,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:15,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:15,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:15,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 53 [2018-12-02 03:58:15,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:15,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 03:58:15,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:36 [2018-12-02 03:58:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 03:58:15,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:58:15,789 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-02 03:58:27,816 WARN L180 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 58 DAG size of output: 22 [2018-12-02 03:58:28,697 WARN L180 SmtUtils]: Spent 455.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 03:58:28,702 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 28 [2018-12-02 03:58:28,770 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5191 conjuctions. This might take some time... [2018-12-02 03:58:28,794 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 21 conjuctions. [2018-12-02 03:58:28,798 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 21 [2018-12-02 03:58:39,733 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2018-12-02 03:58:40,008 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:58:40,009 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 39972 column 11: unknown constant v_dll_create_~head~0.base_31 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-02 03:58:40,015 INFO L168 Benchmark]: Toolchain (without parser) took 47593.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -201.2 MB). Peak memory consumption was 107.6 MB. Max. memory is 11.5 GB. [2018-12-02 03:58:40,016 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:58:40,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-02 03:58:40,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.12 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-02 03:58:40,018 INFO L168 Benchmark]: Boogie Preprocessor took 21.32 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 03:58:40,019 INFO L168 Benchmark]: RCFGBuilder took 274.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:58:40,020 INFO L168 Benchmark]: TraceAbstraction took 46984.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.4 MB). Peak memory consumption was 93.0 MB. Max. memory is 11.5 GB. [2018-12-02 03:58:40,026 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.12 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 21.32 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 274.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46984.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.4 MB). Peak memory consumption was 93.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 39972 column 11: unknown constant v_dll_create_~head~0.base_31 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 39972 column 11: unknown constant v_dll_create_~head~0.base_31: 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-02 03:58:41,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:58:41,287 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:58:41,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:58:41,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:58:41,293 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:58:41,294 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:58:41,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:58:41,295 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:58:41,296 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:58:41,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:58:41,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:58:41,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:58:41,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:58:41,298 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:58:41,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:58:41,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:58:41,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:58:41,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:58:41,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:58:41,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:58:41,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:58:41,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:58:41,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:58:41,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:58:41,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:58:41,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:58:41,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:58:41,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:58:41,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:58:41,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:58:41,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:58:41,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:58:41,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:58:41,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:58:41,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:58:41,307 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 03:58:41,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:58:41,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:58:41,315 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:58:41,315 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:58:41,315 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 03:58:41,315 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 03:58:41,315 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 03:58:41,315 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 03:58:41,315 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 03:58:41,316 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 03:58:41,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 03:58:41,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 03:58:41,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:58:41,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:58:41,316 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 03:58:41,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:58:41,316 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:58:41,316 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:58:41,316 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 03:58:41,317 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 03:58:41,317 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 03:58:41,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:58:41,317 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 03:58:41,317 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 03:58:41,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:58:41,317 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 03:58:41,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:58:41,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:58:41,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:58:41,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:58:41,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:58:41,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:58:41,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:58:41,318 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 03:58:41,318 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:58:41,318 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 03:58:41,318 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_8de93d14-2974-4d08-a4a3-873cae9253b9/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 -> a4f285607323e922caa9bbc912c8526475badf88 [2018-12-02 03:58:41,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:58:41,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:58:41,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:58:41,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:58:41,350 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:58:41,350 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 03:58:41,393 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/data/dc2fa0009/0aa18ab624904dbbb7c1a5ed9c334417/FLAG42e8e59eb [2018-12-02 03:58:41,804 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:58:41,804 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 03:58:41,811 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/data/dc2fa0009/0aa18ab624904dbbb7c1a5ed9c334417/FLAG42e8e59eb [2018-12-02 03:58:41,819 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/data/dc2fa0009/0aa18ab624904dbbb7c1a5ed9c334417 [2018-12-02 03:58:41,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:58:41,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:58:41,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:58:41,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:58:41,824 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:58:41,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:58:41" (1/1) ... [2018-12-02 03:58:41,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15605f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:41, skipping insertion in model container [2018-12-02 03:58:41,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:58:41" (1/1) ... [2018-12-02 03:58:41,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:58:41,849 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:58:42,010 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:58:42,018 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:58:42,084 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:58:42,107 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:58:42,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42 WrapperNode [2018-12-02 03:58:42,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:58:42,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:58:42,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:58:42,109 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:58:42,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42" (1/1) ... [2018-12-02 03:58:42,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42" (1/1) ... [2018-12-02 03:58:42,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:58:42,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:58:42,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:58:42,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:58:42,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42" (1/1) ... [2018-12-02 03:58:42,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42" (1/1) ... [2018-12-02 03:58:42,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42" (1/1) ... [2018-12-02 03:58:42,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42" (1/1) ... [2018-12-02 03:58:42,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42" (1/1) ... [2018-12-02 03:58:42,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42" (1/1) ... [2018-12-02 03:58:42,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42" (1/1) ... [2018-12-02 03:58:42,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:58:42,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:58:42,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:58:42,149 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:58:42,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-02 03:58:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-02 03:58:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 03:58:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 03:58:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:58:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 03:58:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-12-02 03:58:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-12-02 03:58:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 03:58:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 03:58:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 03:58:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 03:58:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 03:58:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 03:58:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 03:58:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 03:58:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:58:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 03:58:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 03:58:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-02 03:58:42,181 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-02 03:58:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:58:42,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:58:42,518 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:58:42,519 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 03:58:42,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:58:42 BoogieIcfgContainer [2018-12-02 03:58:42,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:58:42,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 03:58:42,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 03:58:42,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 03:58:42,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:58:41" (1/3) ... [2018-12-02 03:58:42,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa68136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:58:42, skipping insertion in model container [2018-12-02 03:58:42,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:42" (2/3) ... [2018-12-02 03:58:42,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa68136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:58:42, skipping insertion in model container [2018-12-02 03:58:42,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:58:42" (3/3) ... [2018-12-02 03:58:42,523 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-12-02 03:58:42,528 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 03:58:42,532 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-02 03:58:42,541 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-02 03:58:42,554 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 03:58:42,555 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 03:58:42,555 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 03:58:42,555 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 03:58:42,555 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:58:42,555 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:58:42,555 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 03:58:42,555 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:58:42,555 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 03:58:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-12-02 03:58:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 03:58:42,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:42,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:58:42,571 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 03:58:42,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:42,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1698934950, now seen corresponding path program 1 times [2018-12-02 03:58:42,577 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 03:58:42,577 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:42,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:42,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:42,669 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-02 03:58:42,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:42,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:42,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 03:58:42,681 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-02 03:58:42,682 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 03:58:42,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:58:42,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:58:42,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:58:42,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:58:42,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:58:42,696 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-12-02 03:58:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:42,867 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2018-12-02 03:58:42,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:58:42,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 03:58:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:42,877 INFO L225 Difference]: With dead ends: 108 [2018-12-02 03:58:42,877 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 03:58:42,879 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-02 03:58:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 03:58:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-02 03:58:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 03:58:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-02 03:58:42,907 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 13 [2018-12-02 03:58:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:42,908 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-02 03:58:42,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:58:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-02 03:58:42,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 03:58:42,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:42,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:58:42,908 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 03:58:42,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1698934949, now seen corresponding path program 1 times [2018-12-02 03:58:42,909 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 03:58:42,909 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:42,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:42,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:42,960 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-02 03:58:42,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:42,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:42,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 03:58:42,972 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-02 03:58:42,973 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 03:58:42,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:58:42,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:58:42,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:58:42,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:58:42,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:58:42,975 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 3 states. [2018-12-02 03:58:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:43,126 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-12-02 03:58:43,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:58:43,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 03:58:43,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:43,128 INFO L225 Difference]: With dead ends: 98 [2018-12-02 03:58:43,128 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 03:58:43,128 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-02 03:58:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 03:58:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-02 03:58:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 03:58:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-12-02 03:58:43,133 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 13 [2018-12-02 03:58:43,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:43,133 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-12-02 03:58:43,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:58:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-12-02 03:58:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 03:58:43,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:43,134 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-02 03:58:43,135 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 03:58:43,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash 727447706, now seen corresponding path program 1 times [2018-12-02 03:58:43,135 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 03:58:43,135 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:43,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:43,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:43,198 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-02 03:58:43,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:43,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:43,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 03:58:43,224 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-02 03:58:43,224 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 03:58:43,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:58:43,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:58:43,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:58:43,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:58:43,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:58:43,226 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 6 states. [2018-12-02 03:58:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:43,558 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-12-02 03:58:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:58:43,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 03:58:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:43,560 INFO L225 Difference]: With dead ends: 101 [2018-12-02 03:58:43,560 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 03:58:43,561 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-02 03:58:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 03:58:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-12-02 03:58:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 03:58:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-12-02 03:58:43,566 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 20 [2018-12-02 03:58:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:43,566 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-12-02 03:58:43,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:58:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-12-02 03:58:43,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 03:58:43,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:43,567 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-02 03:58:43,567 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 03:58:43,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:43,567 INFO L82 PathProgramCache]: Analyzing trace with hash 727447707, now seen corresponding path program 1 times [2018-12-02 03:58:43,568 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 03:58:43,568 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:43,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:43,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:43,634 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-02 03:58:43,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:43,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:43,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 03:58:43,679 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-02 03:58:43,679 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 03:58:43,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:58:43,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:58:43,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:58:43,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:58:43,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:58:43,682 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 6 states. [2018-12-02 03:58:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:44,069 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-12-02 03:58:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:58:44,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 03:58:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:44,070 INFO L225 Difference]: With dead ends: 99 [2018-12-02 03:58:44,070 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 03:58:44,070 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-02 03:58:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 03:58:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2018-12-02 03:58:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 03:58:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-12-02 03:58:44,074 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 20 [2018-12-02 03:58:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:44,074 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-12-02 03:58:44,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:58:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-12-02 03:58:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 03:58:44,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:44,075 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-02 03:58:44,075 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 03:58:44,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1010307422, now seen corresponding path program 1 times [2018-12-02 03:58:44,075 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 03:58:44,075 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:44,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:44,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:44,126 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-02 03:58:44,127 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 03:58:44,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:58:44,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:58:44,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:58:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:58:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:58:44,129 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 3 states. [2018-12-02 03:58:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:44,154 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-12-02 03:58:44,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:58:44,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 03:58:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:44,156 INFO L225 Difference]: With dead ends: 104 [2018-12-02 03:58:44,156 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 03:58:44,156 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-02 03:58:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 03:58:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-12-02 03:58:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 03:58:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-02 03:58:44,160 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 23 [2018-12-02 03:58:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:44,161 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-02 03:58:44,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:58:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-02 03:58:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 03:58:44,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:44,161 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-02 03:58:44,161 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 03:58:44,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:44,162 INFO L82 PathProgramCache]: Analyzing trace with hash 51055154, now seen corresponding path program 1 times [2018-12-02 03:58:44,162 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 03:58:44,162 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:44,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:44,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:44,239 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-02 03:58:44,239 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 03:58:44,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:58:44,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:58:44,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:58:44,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:58:44,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:58:44,241 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 5 states. [2018-12-02 03:58:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:44,267 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-12-02 03:58:44,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:58:44,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-02 03:58:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:44,269 INFO L225 Difference]: With dead ends: 104 [2018-12-02 03:58:44,269 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 03:58:44,269 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-02 03:58:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 03:58:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-02 03:58:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 03:58:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-12-02 03:58:44,274 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 26 [2018-12-02 03:58:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:44,275 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-12-02 03:58:44,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:58:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-12-02 03:58:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 03:58:44,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:44,276 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-02 03:58:44,276 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 03:58:44,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:44,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1204250717, now seen corresponding path program 1 times [2018-12-02 03:58:44,277 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 03:58:44,277 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:44,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:44,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:44,403 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-02 03:58:44,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:44,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:44,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 03:58:44,817 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-02 03:58:44,825 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-02 03:58:44,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:44,829 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-02 03:58:44,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-02 03:58:44,841 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-02 03:58:44,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:58:44,953 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-02 03:58:44,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:58:44,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:44,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:44,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:45,000 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-02 03:58:45,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:45,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:45,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 03:58:47,011 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-02 03:58:47,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:47,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:47,025 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-02 03:58:47,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:47,033 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-02 03:58:47,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-12-02 03:58:47,060 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-02 03:58:47,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:58:47,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 03:58:47,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 11 [2018-12-02 03:58:47,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 03:58:47,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 03:58:47,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=8, NotChecked=38, Total=156 [2018-12-02 03:58:47,119 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 12 states. [2018-12-02 03:58:50,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:50,426 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2018-12-02 03:58:50,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 03:58:50,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-12-02 03:58:50,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:50,428 INFO L225 Difference]: With dead ends: 134 [2018-12-02 03:58:50,428 INFO L226 Difference]: Without dead ends: 134 [2018-12-02 03:58:50,428 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-02 03:58:50,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-02 03:58:50,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2018-12-02 03:58:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 03:58:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-12-02 03:58:50,435 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 38 [2018-12-02 03:58:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:50,435 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-12-02 03:58:50,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 03:58:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-12-02 03:58:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 03:58:50,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:50,436 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-02 03:58:50,437 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 03:58:50,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:50,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1204250716, now seen corresponding path program 1 times [2018-12-02 03:58:50,438 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 03:58:50,438 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:50,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:50,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:50,576 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-02 03:58:50,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:50,583 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-02 03:58:50,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:50,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:50,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 03:58:51,530 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-02 03:58:51,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:51,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:51,543 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-02 03:58:51,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:51,553 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-02 03:58:51,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:51,560 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-02 03:58:51,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-02 03:58:51,589 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-02 03:58:51,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:58:51,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:58:51,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:51,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:51,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:51,793 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-02 03:58:51,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:51,800 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-02 03:58:51,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:51,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:51,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 03:58:51,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:51,832 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-02 03:58:51,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:51,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:51,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:51,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, 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-02 03:58:51,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:51,860 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-02 03:58:51,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-02 03:58:51,866 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-02 03:58:51,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:58:51,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:58:51,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-02 03:58:51,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 03:58:51,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 03:58:51,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=1, NotChecked=18, Total=132 [2018-12-02 03:58:51,958 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 10 states. [2018-12-02 03:58:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:53,003 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-12-02 03:58:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 03:58:53,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-12-02 03:58:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:53,004 INFO L225 Difference]: With dead ends: 116 [2018-12-02 03:58:53,004 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 03:58:53,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=60, Invalid=215, Unknown=1, NotChecked=30, Total=306 [2018-12-02 03:58:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 03:58:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2018-12-02 03:58:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 03:58:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-12-02 03:58:53,008 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 38 [2018-12-02 03:58:53,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:53,008 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-12-02 03:58:53,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 03:58:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-12-02 03:58:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 03:58:53,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:53,009 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-02 03:58:53,009 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 03:58:53,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:53,009 INFO L82 PathProgramCache]: Analyzing trace with hash -982633071, now seen corresponding path program 1 times [2018-12-02 03:58:53,009 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 03:58:53,009 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:53,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:53,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:53,144 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-02 03:58:53,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:58:53,239 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-02 03:58:53,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:58:53,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:53,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:58:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:53,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:53,340 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-02 03:58:53,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:58:53,522 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-02 03:58:53,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 03:58:53,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7] total 16 [2018-12-02 03:58:53,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 03:58:53,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 03:58:53,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-02 03:58:53,538 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 16 states. [2018-12-02 03:58:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:53,672 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-12-02 03:58:53,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:58:53,673 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-02 03:58:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:53,673 INFO L225 Difference]: With dead ends: 110 [2018-12-02 03:58:53,673 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 03:58:53,674 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-02 03:58:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 03:58:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2018-12-02 03:58:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 03:58:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2018-12-02 03:58:53,676 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 41 [2018-12-02 03:58:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:53,676 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2018-12-02 03:58:53,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 03:58:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-12-02 03:58:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 03:58:53,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:53,677 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-02 03:58:53,678 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 03:58:53,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash -971964334, now seen corresponding path program 2 times [2018-12-02 03:58:53,678 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 03:58:53,678 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:53,692 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 03:58:53,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 03:58:53,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:58:53,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:53,831 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-02 03:58:53,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:58:53,893 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-02 03:58:53,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:58:53,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:53,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 03:58:54,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 03:58:54,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:58:54,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:54,087 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-02 03:58:54,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:58:54,157 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-02 03:58:54,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 03:58:54,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7] total 7 [2018-12-02 03:58:54,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:58:54,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:58:54,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:58:54,174 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 7 states. [2018-12-02 03:58:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:58:54,373 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-12-02 03:58:54,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:58:54,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-12-02 03:58:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:58:54,374 INFO L225 Difference]: With dead ends: 100 [2018-12-02 03:58:54,374 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 03:58:54,374 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-02 03:58:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 03:58:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-02 03:58:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 03:58:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-02 03:58:54,378 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 56 [2018-12-02 03:58:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:58:54,378 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-02 03:58:54,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:58:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-02 03:58:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 03:58:54,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:58:54,379 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-02 03:58:54,379 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 03:58:54,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:58:54,379 INFO L82 PathProgramCache]: Analyzing trace with hash 152245522, now seen corresponding path program 1 times [2018-12-02 03:58:54,379 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 03:58:54,380 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:58:54,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:58:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:58:54,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:58:54,677 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-02 03:58:54,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:54,684 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-02 03:58:54,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:54,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:54,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 03:58:56,769 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-02 03:58:57,824 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-02 03:58:59,209 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-02 03:58:59,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:59,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:59,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:59,266 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-02 03:58:59,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:59,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:58:59,286 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 17 treesize of output 29 [2018-12-02 03:58:59,290 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 25 treesize of output 36 [2018-12-02 03:58:59,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:58:59,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:58:59,314 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-02 03:58:59,315 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-12-02 03:59:00,104 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-02 03:59:00,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:00,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:00,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:00,132 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-02 03:59:00,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 03:59:00,174 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-02 03:59:00,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:60 [2018-12-02 03:59:00,271 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-02 03:59:00,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:59:00,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:59:00,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 03:59:00,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:59:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:59:00,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:59:00,555 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-02 03:59:00,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:59:00,563 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-02 03:59:00,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:59:00,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:59:00,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 03:59:01,377 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-02 03:59:03,004 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-02 03:59:05,011 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_7 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_7) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| v_prenex_7 (_ bv12 32)) |node_create_#t~malloc2.base| (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_7 (_ bv1 1)) |node_create_#t~malloc2.base|)))) is different from true [2018-12-02 03:59:05,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:05,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:05,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 03:59:05,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:05,058 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-02 03:59:05,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:59:05,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:59:05,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:05,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:05,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:05,086 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-02 03:59:05,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:59:05,097 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-02 03:59:05,098 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-12-02 03:59:17,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:17,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:17,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:59:17,424 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-02 03:59:17,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 03:59:17,491 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-02 03:59:17,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:90 [2018-12-02 03:59:17,573 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-02 03:59:17,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:59:17,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:59:17,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2018-12-02 03:59:17,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 03:59:17,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 03:59:17,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=361, Unknown=13, NotChecked=308, Total=756 [2018-12-02 03:59:17,780 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 26 states. [2018-12-02 03:59:21,551 WARN L180 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-02 03:59:32,654 WARN L180 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 31 DAG size of output: 18 [2018-12-02 03:59:36,530 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_7 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_7) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| v_prenex_7 (_ bv12 32)) |node_create_#t~malloc2.base| (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_7 (_ bv1 1)) |node_create_#t~malloc2.base|)))) (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-02 03:59:47,295 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 54 [2018-12-02 04:00:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:00:13,391 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2018-12-02 04:00:13,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 04:00:13,392 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-12-02 04:00:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:00:13,392 INFO L225 Difference]: With dead ends: 152 [2018-12-02 04:00:13,392 INFO L226 Difference]: Without dead ends: 152 [2018-12-02 04:00:13,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=128, Invalid=641, Unknown=19, NotChecked=472, Total=1260 [2018-12-02 04:00:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-02 04:00:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2018-12-02 04:00:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 04:00:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2018-12-02 04:00:13,396 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 57 [2018-12-02 04:00:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:00:13,396 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2018-12-02 04:00:13,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 04:00:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2018-12-02 04:00:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 04:00:13,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:00:13,397 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-02 04:00:13,397 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 04:00:13,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:00:13,397 INFO L82 PathProgramCache]: Analyzing trace with hash 152245521, now seen corresponding path program 1 times [2018-12-02 04:00:13,398 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:00:13,398 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 04:00:13,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:00:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:00:13,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:00:13,672 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-02 04:00:13,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:00:13,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:00:13,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 04:00:15,685 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-02 04:00:16,167 WARN L180 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-02 04:00:20,037 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-02 04:00:24,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:00:24,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:00:24,786 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-02 04:00:24,791 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-02 04:00:24,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:00:24,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:00:24,806 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-02 04:00:24,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-02 04:00:25,257 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-02 04:00:25,267 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 19 treesize of output 20 [2018-12-02 04:00:25,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:00:25,275 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-02 04:00:25,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-12-02 04:00:25,303 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-02 04:00:25,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:00:33,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:00:33,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 04:00:33,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:00:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:00:34,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:00:34,002 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-02 04:00:34,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:00:34,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:00:34,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 04:00:45,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:00:45,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:00:45,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:00:45,200 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 25 treesize of output 42 [2018-12-02 04:00:45,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-12-02 04:00:45,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:00:45,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:00:45,222 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-02 04:00:45,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2018-12-02 04:00:45,360 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:00:45,360 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 25 treesize of output 33 [2018-12-02 04:00:45,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:00:45,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 04:00:45,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-12-02 04:00:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 6 times theorem prover too weak. 10 trivial. 14 not checked. [2018-12-02 04:00:45,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:00:56,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:00:56,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2018-12-02 04:00:56,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 04:00:56,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 04:00:56,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=301, Unknown=25, NotChecked=114, Total=506 [2018-12-02 04:00:56,808 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand 18 states. [2018-12-02 04:01:25,744 WARN L180 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-12-02 04:01:48,009 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-12-02 04:02:21,157 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_#t~ret3.base| (_ bv1 1))))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store .cse0 v_prenex_12 (_ bv1 1))) (= (select .cse0 v_prenex_12) (_ bv0 1)))))) is different from true [2018-12-02 04:02:43,191 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-02 04:02:44,249 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-12-02 04:07:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:07:09,573 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2018-12-02 04:07:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 04:07:09,573 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-12-02 04:07:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:07:09,574 INFO L225 Difference]: With dead ends: 166 [2018-12-02 04:07:09,574 INFO L226 Difference]: Without dead ends: 166 [2018-12-02 04:07:09,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 113 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 63.3s TimeCoverageRelationStatistics Valid=115, Invalid=515, Unknown=36, NotChecked=204, Total=870 [2018-12-02 04:07:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-02 04:07:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 129. [2018-12-02 04:07:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 04:07:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2018-12-02 04:07:09,577 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 57 [2018-12-02 04:07:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:07:09,578 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2018-12-02 04:07:09,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 04:07:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2018-12-02 04:07:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 04:07:09,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:07:09,579 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-02 04:07:09,579 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 04:07:09,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:07:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1889169239, now seen corresponding path program 1 times [2018-12-02 04:07:09,580 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:07:09,580 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 04:07:09,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:07:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:07:09,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:07:09,817 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-02 04:07:09,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:09,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:09,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 04:07:10,719 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-02 04:07:11,128 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-02 04:07:13,871 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-02 04:07:14,581 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-02 04:07:16,589 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-02 04:07:17,229 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-02 04:07:17,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:17,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:17,235 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-02 04:07:17,240 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-02 04:07:17,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:17,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:17,255 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-02 04:07:17,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2018-12-02 04:07:20,004 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-02 04:07:20,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:20,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:20,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:20,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:20,041 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-02 04:07:20,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:20,116 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-02 04:07:20,122 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-02 04:07:20,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:20,129 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-02 04:07:20,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:20,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:20,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:20,147 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-02 04:07:20,147 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:20,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:20,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:20,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:20,230 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-02 04:07:20,230 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:65, output treesize:68 [2018-12-02 04:07:20,304 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-02 04:07:20,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:20,309 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-02 04:07:20,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:20,321 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-02 04:07:20,321 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:20,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:20,340 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-02 04:07:20,340 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:74, output treesize:41 [2018-12-02 04:07:20,444 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-02 04:07:20,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:07:20,695 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-02 04:07:20,700 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-02 04:07:20,713 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-02 04:07:20,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-12-02 04:07:28,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:07:28,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 04:07:28,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:07:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:07:28,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:07:28,729 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-02 04:07:28,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:28,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:28,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 04:07:30,948 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-02 04:07:32,954 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-02 04:07:34,581 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-02 04:07:36,587 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-02 04:07:38,260 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-02 04:07:38,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:38,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:38,266 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-02 04:07:38,271 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-02 04:07:38,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:38,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:38,285 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-02 04:07:38,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-02 04:07:38,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:38,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:38,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:38,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:38,566 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-02 04:07:38,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:38,638 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-02 04:07:38,643 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-02 04:07:38,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:38,649 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-02 04:07:38,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:38,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:38,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:38,666 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-02 04:07:38,666 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:38,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:38,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:38,711 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:38,747 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-02 04:07:38,747 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:62, output treesize:64 [2018-12-02 04:07:38,848 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-02 04:07:38,853 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-02 04:07:38,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:38,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:07:38,874 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-02 04:07:38,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:07:38,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:07:38,901 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-02 04:07:38,901 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:73, output treesize:40 [2018-12-02 04:07:38,948 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-02 04:07:38,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:07:39,118 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-02 04:07:39,124 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-02 04:07:39,138 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-02 04:07:39,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:39 [2018-12-02 04:07:47,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:07:47,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 38 [2018-12-02 04:07:47,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-02 04:07:47,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-02 04:07:47,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=895, Unknown=17, NotChecked=770, Total=1806 [2018-12-02 04:07:47,658 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 39 states. [2018-12-02 04:08:03,862 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-12-02 04:08:08,068 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-02 04:08:13,449 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-02 04:08:15,457 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-02 04:08:17,013 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-02 04:08:17,612 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-02 04:08:18,084 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-02 04:08:19,544 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-02 04:08:24,527 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-12-02 04:08:26,892 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-12-02 04:09:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:09:03,442 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-12-02 04:09:03,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 04:09:03,442 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-12-02 04:09:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:09:03,443 INFO L225 Difference]: With dead ends: 167 [2018-12-02 04:09:03,443 INFO L226 Difference]: Without dead ends: 167 [2018-12-02 04:09:03,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 91 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 60.7s TimeCoverageRelationStatistics Valid=213, Invalid=1463, Unknown=24, NotChecked=1380, Total=3080 [2018-12-02 04:09:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-02 04:09:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 130. [2018-12-02 04:09:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 04:09:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2018-12-02 04:09:03,447 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 61 [2018-12-02 04:09:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:09:03,447 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2018-12-02 04:09:03,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-02 04:09:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2018-12-02 04:09:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 04:09:03,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:09:03,448 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-02 04:09:03,448 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 04:09:03,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:09:03,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1889169240, now seen corresponding path program 1 times [2018-12-02 04:09:03,449 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:09:03,449 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 04:09:03,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:09:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:09:03,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:09:03,778 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-02 04:09:03,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:03,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:03,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 04:09:05,795 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-02 04:09:05,802 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-02 04:09:05,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:05,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:05,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-02 04:09:07,357 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 04:09:08,408 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 04:09:09,116 WARN L180 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 04:09:09,995 WARN L180 SmtUtils]: Spent 855.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 04:09:10,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:10,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:10,001 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-02 04:09:10,006 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-02 04:09:10,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:10,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:10,025 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-02 04:09:10,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2018-12-02 04:09:12,595 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-02 04:09:12,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:12,612 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-02 04:09:12,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:12,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:12,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:12,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:12,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:12,776 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-02 04:09:12,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:12,907 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-02 04:09:12,913 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-02 04:09:12,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:12,922 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-02 04:09:12,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:12,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:12,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:12,942 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-02 04:09:12,943 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:12,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:12,974 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:12,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:13,070 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-02 04:09:13,077 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-02 04:09:13,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:13,086 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-02 04:09:13,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:13,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:13,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:13,103 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-02 04:09:13,104 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:13,119 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:13,132 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:13,149 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:13,194 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-02 04:09:13,195 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:108, output treesize:75 [2018-12-02 04:09:13,314 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-02 04:09:13,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:13,320 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-02 04:09:13,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:13,337 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-02 04:09:13,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:13,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:13,373 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-02 04:09:13,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:13,378 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-02 04:09:13,378 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:13,389 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-02 04:09:13,390 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:13,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:13,405 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-02 04:09:13,405 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:88, output treesize:22 [2018-12-02 04:09:13,553 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-02 04:09:13,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:09:14,647 WARN L180 SmtUtils]: Spent 698.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 04:09:14,833 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 04:09:14,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:14,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:16,658 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-02 04:09:16,679 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-02 04:09:17,512 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-02 04:09:17,548 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-02 04:09:18,083 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-02 04:09:18,110 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-02 04:09:18,431 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:18,452 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:18,642 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:09:18,661 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:09:18,830 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-02 04:09:18,830 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:220, output treesize:154 [2018-12-02 04:09:25,964 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-12-02 04:09:25,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:09:25,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 04:09:25,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:09:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:09:26,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:09:26,033 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-02 04:09:26,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:26,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:26,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 04:09:26,447 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-02 04:09:26,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:26,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:26,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-02 04:09:35,603 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-02 04:09:35,608 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-02 04:09:35,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:35,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:35,631 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-02 04:09:35,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-02 04:09:36,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,131 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-02 04:09:36,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,246 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-02 04:09:36,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,357 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-02 04:09:36,362 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-02 04:09:36,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,372 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-02 04:09:36,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,391 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-02 04:09:36,392 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,410 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,512 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-02 04:09:36,517 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-02 04:09:36,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,522 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-02 04:09:36,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,538 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-02 04:09:36,538 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,552 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,561 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,574 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,612 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-02 04:09:36,613 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:94, output treesize:70 [2018-12-02 04:09:36,813 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-02 04:09:36,816 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-02 04:09:36,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,834 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-02 04:09:36,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,877 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-02 04:09:36,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:09:36,882 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-02 04:09:36,882 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,893 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-02 04:09:36,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,898 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:36,907 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-02 04:09:36,907 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:86, output treesize:20 [2018-12-02 04:09:36,974 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-02 04:09:36,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:09:37,589 WARN L180 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 04:09:37,765 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 04:09:37,858 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-02 04:09:37,898 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-02 04:09:40,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:40,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:41,501 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:09:41,523 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:09:42,218 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-02 04:09:42,235 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-02 04:09:42,508 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-02 04:09:42,538 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-02 04:09:42,827 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:09:42,854 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:09:42,997 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-02 04:09:42,997 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:220, output treesize:154 [2018-12-02 04:09:49,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:09:49,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 38 [2018-12-02 04:09:49,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-02 04:09:49,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-02 04:09:49,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1528, Unknown=10, NotChecked=158, Total=1806 [2018-12-02 04:09:49,184 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand 39 states. [2018-12-02 04:10:04,084 WARN L180 SmtUtils]: Spent 4.15 s on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 04:10:12,758 WARN L180 SmtUtils]: Spent 8.18 s on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-12-02 04:10:14,477 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-12-02 04:10:15,967 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-12-02 04:10:19,922 WARN L180 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2018-12-02 04:10:23,681 WARN L180 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-12-02 04:10:27,470 WARN L180 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-12-02 04:10:30,247 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-02 04:10:36,468 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-02 04:10:37,181 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-02 04:10:38,753 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-12-02 04:10:39,727 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-12-02 04:10:48,715 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-12-02 04:10:49,044 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-12-02 04:10:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:10:56,417 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2018-12-02 04:10:56,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 04:10:56,418 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-12-02 04:10:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:10:56,418 INFO L225 Difference]: With dead ends: 156 [2018-12-02 04:10:56,418 INFO L226 Difference]: Without dead ends: 156 [2018-12-02 04:10:56,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 79.2s TimeCoverageRelationStatistics Valid=253, Invalid=3163, Unknown=14, NotChecked=230, Total=3660 [2018-12-02 04:10:56,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-02 04:10:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 133. [2018-12-02 04:10:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 04:10:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2018-12-02 04:10:56,421 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 61 [2018-12-02 04:10:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:10:56,422 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2018-12-02 04:10:56,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-02 04:10:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-12-02 04:10:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 04:10:56,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:10:56,422 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-02 04:10:56,422 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 04:10:56,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:10:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1570034885, now seen corresponding path program 1 times [2018-12-02 04:10:56,423 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:10:56,423 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 04:10:56,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:10:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:10:56,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:10:56,627 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-02 04:10:56,627 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:10:56,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:10:56,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:10:56,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:10:56,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:10:56,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:10:56,630 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 6 states. [2018-12-02 04:10:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:10:57,013 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2018-12-02 04:10:57,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:10:57,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-02 04:10:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:10:57,015 INFO L225 Difference]: With dead ends: 131 [2018-12-02 04:10:57,015 INFO L226 Difference]: Without dead ends: 131 [2018-12-02 04:10:57,015 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-02 04:10:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-02 04:10:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-02 04:10:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-02 04:10:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2018-12-02 04:10:57,018 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 62 [2018-12-02 04:10:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:10:57,018 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2018-12-02 04:10:57,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:10:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2018-12-02 04:10:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 04:10:57,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:10:57,019 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-02 04:10:57,019 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 04:10:57,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:10:57,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1010544140, now seen corresponding path program 1 times [2018-12-02 04:10:57,020 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:10:57,020 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 04:10:57,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:10:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:10:57,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:10:57,182 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-02 04:10:57,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:10:57,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:10:57,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 04:10:57,203 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-02 04:10:57,203 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:10:57,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:10:57,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:10:57,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:10:57,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:10:57,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:10:57,207 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 6 states. [2018-12-02 04:10:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:10:57,516 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2018-12-02 04:10:57,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:10:57,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-02 04:10:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:10:57,517 INFO L225 Difference]: With dead ends: 130 [2018-12-02 04:10:57,517 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 04:10:57,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 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-02 04:10:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 04:10:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-02 04:10:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 04:10:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-12-02 04:10:57,520 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 64 [2018-12-02 04:10:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:10:57,520 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-12-02 04:10:57,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:10:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-12-02 04:10:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 04:10:57,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:10:57,521 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-02 04:10:57,521 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 04:10:57,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:10:57,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1010544139, now seen corresponding path program 1 times [2018-12-02 04:10:57,521 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:10:57,521 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 04:10:57,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:10:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:10:57,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:10:57,707 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-02 04:10:57,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:10:57,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:10:57,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 04:10:57,745 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-02 04:10:57,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:10:57,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:10:57,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:10:57,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:10:57,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:10:57,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:10:57,749 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 6 states. [2018-12-02 04:10:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:10:58,089 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2018-12-02 04:10:58,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:10:58,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-02 04:10:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:10:58,090 INFO L225 Difference]: With dead ends: 129 [2018-12-02 04:10:58,090 INFO L226 Difference]: Without dead ends: 129 [2018-12-02 04:10:58,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 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-02 04:10:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-02 04:10:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-02 04:10:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 04:10:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2018-12-02 04:10:58,092 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 64 [2018-12-02 04:10:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:10:58,092 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2018-12-02 04:10:58,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:10:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2018-12-02 04:10:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 04:10:58,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:10:58,093 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-02 04:10:58,093 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 04:10:58,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:10:58,093 INFO L82 PathProgramCache]: Analyzing trace with hash -715457936, now seen corresponding path program 1 times [2018-12-02 04:10:58,093 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:10:58,093 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/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-02 04:10:58,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:10:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:10:58,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:10:58,266 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-02 04:10:58,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:10:58,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:10:58,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 04:10:58,312 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-02 04:10:58,313 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-02 04:10:58,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:10:58,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:10:58,320 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-02 04:10:58,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2018-12-02 04:10:58,349 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-02 04:10:58,350 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-02 04:10:58,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:10:58,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:10:58,352 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-02 04:10:58,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-02 04:10:58,377 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-02 04:10:58,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:10:58,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:10:58,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 04:10:58,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 04:10:58,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 04:10:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 04:10:58,381 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 12 states. [2018-12-02 04:10:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:10:59,177 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2018-12-02 04:10:59,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 04:10:59,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-12-02 04:10:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:10:59,178 INFO L225 Difference]: With dead ends: 153 [2018-12-02 04:10:59,178 INFO L226 Difference]: Without dead ends: 153 [2018-12-02 04:10:59,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 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-02 04:10:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-02 04:10:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2018-12-02 04:10:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-02 04:10:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2018-12-02 04:10:59,180 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 65 [2018-12-02 04:10:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:10:59,181 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2018-12-02 04:10:59,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 04:10:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2018-12-02 04:10:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 04:10:59,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:10:59,181 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-02 04:10:59,181 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 04:10:59,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:10:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash -715457935, now seen corresponding path program 1 times [2018-12-02 04:10:59,182 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:10:59,182 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:10:59,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:10:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:10:59,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:10:59,380 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-02 04:10:59,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:10:59,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:10:59,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 04:10:59,453 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-02 04:10:59,455 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-02 04:10:59,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:10:59,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:10:59,472 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-02 04:10:59,473 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-02 04:10:59,474 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:10:59,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:10:59,484 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-02 04:10:59,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-02 04:10:59,521 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-02 04:10:59,523 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-02 04:10:59,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:10:59,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:10:59,533 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-02 04:10:59,534 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-02 04:10:59,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:10:59,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:10:59,539 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-02 04:10:59,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-02 04:10:59,574 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-02 04:10:59,574 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 04:10:59,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:10:59,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 04:10:59,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 04:10:59,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 04:10:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 04:10:59,578 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand 12 states. [2018-12-02 04:11:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:11:00,491 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2018-12-02 04:11:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 04:11:00,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-12-02 04:11:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:11:00,492 INFO L225 Difference]: With dead ends: 159 [2018-12-02 04:11:00,492 INFO L226 Difference]: Without dead ends: 159 [2018-12-02 04:11:00,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 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-02 04:11:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-02 04:11:00,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2018-12-02 04:11:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-02 04:11:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2018-12-02 04:11:00,496 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 65 [2018-12-02 04:11:00,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:11:00,496 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2018-12-02 04:11:00,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 04:11:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2018-12-02 04:11:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 04:11:00,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:11:00,497 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-02 04:11:00,497 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-02 04:11:00,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:11:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1262044531, now seen corresponding path program 1 times [2018-12-02 04:11:00,498 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 04:11:00,498 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 04:11:00,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:11:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:11:00,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:11:00,826 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-02 04:11:00,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:00,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:00,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 04:11:01,051 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-02 04:11:01,053 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-02 04:11:01,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:01,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:01,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:01,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-12-02 04:11:01,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:01,145 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-02 04:11:01,148 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-02 04:11:01,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:01,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:01,181 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-02 04:11:01,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:59 [2018-12-02 04:11:01,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:01,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:01,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:01,543 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-02 04:11:01,547 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-02 04:11:01,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:01,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:01,587 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-02 04:11:01,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:60 [2018-12-02 04:11:04,661 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-02 04:11:04,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:04,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:04,686 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 04:11:04,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 111 [2018-12-02 04:11:04,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:04,886 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-02 04:11:04,896 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-02 04:11:04,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:04,910 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-02 04:11:04,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:04,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:04,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:04,940 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-02 04:11:04,940 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:04,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:04,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:05,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:05,175 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 129 treesize of output 120 [2018-12-02 04:11:05,182 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-02 04:11:05,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:05,192 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-02 04:11:05,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:05,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:05,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:05,213 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-02 04:11:05,213 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:05,232 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:05,245 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:05,289 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:05,356 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-02 04:11:05,357 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:159, output treesize:165 [2018-12-02 04:11:05,570 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-02 04:11:05,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:05,584 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-02 04:11:05,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:05,618 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-02 04:11:05,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:05,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:05,723 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-02 04:11:05,723 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:178, output treesize:149 [2018-12-02 04:11:06,049 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 133 treesize of output 88 [2018-12-02 04:11:06,059 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-02 04:11:06,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:06,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:06,112 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-02 04:11:06,112 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:06,136 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 30 treesize of output 22 [2018-12-02 04:11:06,136 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-02 04:11:06,152 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 33 treesize of output 20 [2018-12-02 04:11:06,152 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:06,167 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-02 04:11:06,187 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-02 04:11:06,187 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:150, output treesize:52 [2018-12-02 04:11:06,448 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-02 04:11:06,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:11:07,682 WARN L180 SmtUtils]: Spent 752.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-02 04:11:07,848 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-02 04:11:07,937 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-02 04:11:07,958 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-02 04:11:08,013 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-02 04:11:08,025 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-02 04:11:08,055 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-02 04:11:08,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:83 [2018-12-02 04:11:27,543 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-02 04:11:27,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:11:27,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8de93d14-2974-4d08-a4a3-873cae9253b9/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:11:27,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:11:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:11:27,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:11:27,623 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-02 04:11:27,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:27,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:27,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 04:11:28,600 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-02 04:11:28,602 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-02 04:11:28,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:28,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:28,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:28,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:30 [2018-12-02 04:11:28,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:28,798 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-02 04:11:28,801 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-02 04:11:28,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:28,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:28,830 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-02 04:11:28,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:48 [2018-12-02 04:11:29,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:29,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:29,518 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-02 04:11:29,523 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-02 04:11:29,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:29,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:29,559 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-02 04:11:29,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:54 [2018-12-02 04:11:34,660 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-02 04:11:34,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:34,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:34,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:34,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:34,719 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-02 04:11:34,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:34,987 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-12-02 04:11:34,990 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-02 04:11:34,997 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-02 04:11:35,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:35,008 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-02 04:11:35,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:35,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:35,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:35,035 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-02 04:11:35,035 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:35,061 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:35,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:35,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:35,250 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-02 04:11:35,257 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-02 04:11:35,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:35,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-02 04:11:35,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:35,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:35,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:35,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-02 04:11:35,287 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:35,306 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:35,320 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:35,340 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:35,402 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-02 04:11:35,402 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:141, output treesize:145 [2018-12-02 04:11:35,696 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-02 04:11:35,703 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-02 04:11:35,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:35,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:35,730 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-02 04:11:35,731 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:35,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:11:35,823 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-02 04:11:35,824 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:161, output treesize:132 [2018-12-02 04:11:36,684 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-02 04:11:36,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:36,694 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 73 treesize of output 67 [2018-12-02 04:11:36,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:36,805 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 55 treesize of output 41 [2018-12-02 04:11:36,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:11:36,888 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 38 treesize of output 27 [2018-12-02 04:11:36,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:36,968 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-02 04:11:36,968 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:37,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 04:11:37,036 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-02 04:11:37,036 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:37,096 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-02 04:11:37,097 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:11:37,133 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-02 04:11:37,133 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 04:11:37,160 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-02 04:11:37,200 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-02 04:11:37,200 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:133, output treesize:91 [2018-12-02 04:11:37,619 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-02 04:11:37,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:11:40,681 WARN L180 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-02 04:11:40,905 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-02 04:11:40,915 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-02 04:11:40,955 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-02 04:11:40,977 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-02 04:11:41,007 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-02 04:11:41,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:113 [2018-12-02 04:11:42,158 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-02 04:11:42,359 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:11:42,360 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-02 04:11:42,365 INFO L168 Benchmark]: Toolchain (without parser) took 780544.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 939.3 MB in the beginning and 895.9 MB in the end (delta: 43.5 MB). Peak memory consumption was 261.1 MB. Max. memory is 11.5 GB. [2018-12-02 04:11:42,366 INFO L168 Benchmark]: CDTParser took 0.18 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-02 04:11:42,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:11:42,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.84 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-02 04:11:42,367 INFO L168 Benchmark]: Boogie Preprocessor took 21.73 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 04:11:42,367 INFO L168 Benchmark]: RCFGBuilder took 369.67 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-12-02 04:11:42,367 INFO L168 Benchmark]: TraceAbstraction took 779844.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 895.9 MB in the end (delta: 173.8 MB). Peak memory consumption was 253.5 MB. Max. memory is 11.5 GB. [2018-12-02 04:11:42,368 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.84 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 21.73 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 369.67 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 779844.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 895.9 MB in the end (delta: 173.8 MB). Peak memory consumption was 253.5 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...