./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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 1eb62d582bb1f498de7f5f7de60817c0efb48782 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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 1eb62d582bb1f498de7f5f7de60817c0efb48782 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-03 02:46:27,897 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:46:27,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:46:27,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:46:27,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:46:27,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:46:27,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:46:27,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:46:27,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:46:27,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:46:27,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:46:27,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:46:27,910 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:46:27,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:46:27,911 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:46:27,912 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:46:27,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:46:27,913 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:46:27,914 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:46:27,914 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:46:27,915 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:46:27,915 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:46:27,916 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:46:27,917 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:46:27,917 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:46:27,917 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:46:27,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:46:27,918 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:46:27,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:46:27,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:46:27,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:46:27,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:46:27,919 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:46:27,919 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:46:27,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:46:27,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:46:27,920 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 02:46:27,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:46:27,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:46:27,929 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:46:27,929 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:46:27,930 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:46:27,930 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:46:27,930 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:46:27,930 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:46:27,930 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:46:27,930 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:46:27,931 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:46:27,931 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:46:27,931 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:46:27,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 02:46:27,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 02:46:27,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:46:27,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:46:27,932 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 02:46:27,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:46:27,932 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:46:27,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:46:27,933 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 02:46:27,933 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 02:46:27,933 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 02:46:27,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:46:27,933 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:46:27,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:46:27,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:46:27,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:46:27,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:46:27,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:46:27,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:46:27,934 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:46:27,934 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:46:27,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:46:27,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:46:27,935 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_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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 -> 1eb62d582bb1f498de7f5f7de60817c0efb48782 [2018-12-03 02:46:27,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:46:27,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:46:27,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:46:27,967 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:46:27,967 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:46:27,967 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-03 02:46:28,004 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/data/ac439d16a/9c1533e4814144a6b3bc3b8f760260d3/FLAG760221754 [2018-12-03 02:46:28,410 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:46:28,410 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-03 02:46:28,416 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/data/ac439d16a/9c1533e4814144a6b3bc3b8f760260d3/FLAG760221754 [2018-12-03 02:46:28,424 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/data/ac439d16a/9c1533e4814144a6b3bc3b8f760260d3 [2018-12-03 02:46:28,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:46:28,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:46:28,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:46:28,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:46:28,429 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:46:28,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:46:28" (1/1) ... [2018-12-03 02:46:28,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@306c3a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28, skipping insertion in model container [2018-12-03 02:46:28,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:46:28" (1/1) ... [2018-12-03 02:46:28,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:46:28,461 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:46:28,619 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:46:28,669 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:46:28,696 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:46:28,717 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:46:28,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28 WrapperNode [2018-12-03 02:46:28,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:46:28,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:46:28,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:46:28,718 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:46:28,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28" (1/1) ... [2018-12-03 02:46:28,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28" (1/1) ... [2018-12-03 02:46:28,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:46:28,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:46:28,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:46:28,737 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:46:28,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28" (1/1) ... [2018-12-03 02:46:28,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28" (1/1) ... [2018-12-03 02:46:28,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28" (1/1) ... [2018-12-03 02:46:28,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28" (1/1) ... [2018-12-03 02:46:28,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28" (1/1) ... [2018-12-03 02:46:28,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28" (1/1) ... [2018-12-03 02:46:28,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28" (1/1) ... [2018-12-03 02:46:28,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:46:28,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:46:28,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:46:28,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:46:28,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:46:28,792 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 02:46:28,792 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 02:46:28,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 02:46:28,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 02:46:28,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 02:46:28,792 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-03 02:46:28,792 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-03 02:46:28,792 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_append [2018-12-03 02:46:28,792 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_append [2018-12-03 02:46:28,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 02:46:28,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 02:46:28,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 02:46:28,792 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 02:46:28,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 02:46:28,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 02:46:28,793 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-03 02:46:28,793 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-03 02:46:28,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 02:46:28,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 02:46:28,793 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-03 02:46:28,793 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-03 02:46:28,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:46:28,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:46:29,083 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:46:29,083 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-03 02:46:29,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:46:29 BoogieIcfgContainer [2018-12-03 02:46:29,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:46:29,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:46:29,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:46:29,085 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:46:29,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:46:28" (1/3) ... [2018-12-03 02:46:29,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7f9051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:46:29, skipping insertion in model container [2018-12-03 02:46:29,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:28" (2/3) ... [2018-12-03 02:46:29,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7f9051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:46:29, skipping insertion in model container [2018-12-03 02:46:29,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:46:29" (3/3) ... [2018-12-03 02:46:29,087 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-03 02:46:29,093 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:46:29,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-12-03 02:46:29,106 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-12-03 02:46:29,121 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:46:29,121 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 02:46:29,121 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:46:29,121 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:46:29,121 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:46:29,121 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:46:29,121 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:46:29,121 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:46:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-12-03 02:46:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 02:46:29,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:29,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:29,139 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-03 02:46:29,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:29,142 INFO L82 PathProgramCache]: Analyzing trace with hash -321535227, now seen corresponding path program 1 times [2018-12-03 02:46:29,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:46:29,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:29,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:29,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:29,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:46:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:29,241 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-03 02:46:29,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:46:29,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 02:46:29,242 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:46:29,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:46:29,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:46:29,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:46:29,255 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-12-03 02:46:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:29,354 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-12-03 02:46:29,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:46:29,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 02:46:29,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:29,362 INFO L225 Difference]: With dead ends: 142 [2018-12-03 02:46:29,362 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 02:46:29,363 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-03 02:46:29,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 02:46:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 02:46:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 02:46:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-12-03 02:46:29,395 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 12 [2018-12-03 02:46:29,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:29,395 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-12-03 02:46:29,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:46:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-12-03 02:46:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 02:46:29,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:29,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:29,396 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-03 02:46:29,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:29,397 INFO L82 PathProgramCache]: Analyzing trace with hash -321535226, now seen corresponding path program 1 times [2018-12-03 02:46:29,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:46:29,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:29,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:29,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:29,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:46:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:29,452 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-03 02:46:29,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:46:29,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 02:46:29,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:46:29,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:46:29,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:46:29,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:46:29,453 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 3 states. [2018-12-03 02:46:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:29,514 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-12-03 02:46:29,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:46:29,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 02:46:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:29,515 INFO L225 Difference]: With dead ends: 133 [2018-12-03 02:46:29,515 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 02:46:29,516 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-03 02:46:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 02:46:29,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 02:46:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 02:46:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-12-03 02:46:29,521 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-12-03 02:46:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:29,521 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-12-03 02:46:29,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:46:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-12-03 02:46:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 02:46:29,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:29,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:29,522 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-03 02:46:29,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:29,522 INFO L82 PathProgramCache]: Analyzing trace with hash 851167050, now seen corresponding path program 1 times [2018-12-03 02:46:29,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:46:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:29,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:29,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:46:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:29,573 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-03 02:46:29,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:46:29,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:46:29,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:46:29,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:46:29,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:46:29,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:46:29,574 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 6 states. [2018-12-03 02:46:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:29,721 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-12-03 02:46:29,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:46:29,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-03 02:46:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:29,723 INFO L225 Difference]: With dead ends: 137 [2018-12-03 02:46:29,723 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 02:46:29,724 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-03 02:46:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 02:46:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-12-03 02:46:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 02:46:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-12-03 02:46:29,730 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 19 [2018-12-03 02:46:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:29,730 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-12-03 02:46:29,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:46:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-12-03 02:46:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 02:46:29,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:29,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:29,731 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-03 02:46:29,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:29,731 INFO L82 PathProgramCache]: Analyzing trace with hash 851167051, now seen corresponding path program 1 times [2018-12-03 02:46:29,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:46:29,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:29,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:29,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:29,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:46:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:29,762 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-03 02:46:29,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:46:29,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:46:29,762 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:46:29,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:46:29,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:46:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:46:29,763 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 5 states. [2018-12-03 02:46:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:29,781 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-12-03 02:46:29,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:46:29,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-03 02:46:29,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:29,782 INFO L225 Difference]: With dead ends: 134 [2018-12-03 02:46:29,782 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 02:46:29,782 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-03 02:46:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 02:46:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 02:46:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 02:46:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-12-03 02:46:29,787 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 19 [2018-12-03 02:46:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:29,787 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-12-03 02:46:29,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:46:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-12-03 02:46:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 02:46:29,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:29,788 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:29,788 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-03 02:46:29,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:29,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1063532723, now seen corresponding path program 1 times [2018-12-03 02:46:29,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:46:29,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:29,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:29,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:29,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:46:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 02:46:29,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:46:29,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:46:29,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:46:29,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:46:29,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:46:29,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:46:29,841 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 6 states. [2018-12-03 02:46:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:30,011 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-12-03 02:46:30,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:46:30,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-03 02:46:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:30,012 INFO L225 Difference]: With dead ends: 134 [2018-12-03 02:46:30,012 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 02:46:30,012 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-03 02:46:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 02:46:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-12-03 02:46:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 02:46:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-12-03 02:46:30,017 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 28 [2018-12-03 02:46:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:30,017 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-12-03 02:46:30,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:46:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-12-03 02:46:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 02:46:30,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:30,017 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:30,018 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-03 02:46:30,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1063532724, now seen corresponding path program 1 times [2018-12-03 02:46:30,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:46:30,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:30,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:30,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:30,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:46:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 02:46:30,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:46:30,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:46:30,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:46:30,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:46:30,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:46:30,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:46:30,062 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 6 states. [2018-12-03 02:46:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:30,190 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-12-03 02:46:30,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:46:30,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-03 02:46:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:30,191 INFO L225 Difference]: With dead ends: 133 [2018-12-03 02:46:30,191 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 02:46:30,191 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-03 02:46:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 02:46:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-12-03 02:46:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 02:46:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-12-03 02:46:30,202 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 28 [2018-12-03 02:46:30,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:30,202 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-12-03 02:46:30,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:46:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-12-03 02:46:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 02:46:30,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:30,203 INFO L402 BasicCegarLoop]: trace histogram [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-03 02:46:30,203 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-03 02:46:30,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash -270265832, now seen corresponding path program 1 times [2018-12-03 02:46:30,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:46:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:30,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:30,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:30,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:46:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 02:46:30,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:46:30,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:46:30,331 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-03 02:46:30,332 INFO L205 CegarAbsIntRunner]: [55], [133], [134], [140], [142], [149], [151], [153], [154], [157], [162], [205], [211], [213], [216], [219], [220], [223], [229], [230], [231], [232], [233], [234], [235] [2018-12-03 02:46:30,353 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:46:30,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:46:30,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:46:30,509 INFO L272 AbstractInterpreter]: Visited 25 different actions 58 times. Merged at 7 different actions 12 times. Never widened. Performed 643 root evaluator evaluations with a maximum evaluation depth of 3. Performed 643 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-03 02:46:30,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:30,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:46:30,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:46:30,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:46:30,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:30,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:46:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:30,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:30,570 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-03 02:46:30,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:30,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:30,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:46:30,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:30,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:30,603 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-03 02:46:30,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:30,616 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-03 02:46:30,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-03 02:46:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:46:30,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:46:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:46:30,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:46:30,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2018-12-03 02:46:30,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:46:30,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:46:30,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:46:30,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:46:30,849 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 12 states. [2018-12-03 02:46:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:31,191 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-12-03 02:46:31,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:46:31,191 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-03 02:46:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:31,192 INFO L225 Difference]: With dead ends: 147 [2018-12-03 02:46:31,192 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 02:46:31,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-03 02:46:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 02:46:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2018-12-03 02:46:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 02:46:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-12-03 02:46:31,196 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 31 [2018-12-03 02:46:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:31,196 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-12-03 02:46:31,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:46:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-12-03 02:46:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 02:46:31,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:31,197 INFO L402 BasicCegarLoop]: trace histogram [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-03 02:46:31,197 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-03 02:46:31,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:31,197 INFO L82 PathProgramCache]: Analyzing trace with hash -270265831, now seen corresponding path program 1 times [2018-12-03 02:46:31,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:46:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:31,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:31,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:46:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:46:31,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:46:31,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:46:31,286 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-03 02:46:31,286 INFO L205 CegarAbsIntRunner]: [55], [133], [134], [140], [142], [149], [151], [153], [154], [157], [163], [205], [211], [213], [216], [219], [220], [223], [229], [230], [231], [232], [233], [234], [235] [2018-12-03 02:46:31,287 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:46:31,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:46:31,363 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:46:31,363 INFO L272 AbstractInterpreter]: Visited 25 different actions 58 times. Merged at 7 different actions 12 times. Never widened. Performed 649 root evaluator evaluations with a maximum evaluation depth of 3. Performed 649 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-03 02:46:31,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:31,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:46:31,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:46:31,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:46:31,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:31,372 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:46:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:31,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:31,396 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-03 02:46:31,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:31,404 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-03 02:46:31,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:31,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:31,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 02:46:31,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:31,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:31,472 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-03 02:46:31,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:31,480 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-03 02:46:31,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:31,485 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-03 02:46:31,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-12-03 02:46:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:46:31,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:46:31,562 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-03 02:46:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:46:31,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:46:31,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2018-12-03 02:46:31,867 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:46:31,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 02:46:31,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 02:46:31,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-03 02:46:31,868 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 13 states. [2018-12-03 02:46:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:33,070 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-12-03 02:46:33,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:46:33,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-12-03 02:46:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:33,071 INFO L225 Difference]: With dead ends: 146 [2018-12-03 02:46:33,071 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 02:46:33,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2018-12-03 02:46:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 02:46:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2018-12-03 02:46:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 02:46:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-12-03 02:46:33,076 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 31 [2018-12-03 02:46:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:33,076 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-12-03 02:46:33,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 02:46:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-12-03 02:46:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 02:46:33,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:33,078 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:33,078 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-03 02:46:33,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:33,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2107190679, now seen corresponding path program 1 times [2018-12-03 02:46:33,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:46:33,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:33,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:33,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:46:33,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:46:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 02:46:33,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:46:33,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:46:33,250 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-12-03 02:46:33,250 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [55], [57], [133], [134], [140], [142], [149], [151], [153], [154], [157], [161], [164], [165], [205], [211], [213], [216], [219], [220], [221], [222], [223], [224], [225], [229], [230], [231], [232], [233], [234], [235] [2018-12-03 02:46:33,252 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:46:33,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:46:33,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:46:33,303 INFO L272 AbstractInterpreter]: Visited 35 different actions 77 times. Merged at 9 different actions 14 times. Never widened. Performed 831 root evaluator evaluations with a maximum evaluation depth of 3. Performed 831 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-12-03 02:46:33,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:33,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:46:33,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:46:33,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:46:33,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:33,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:46:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:33,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:33,345 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-03 02:46:33,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:33,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:33,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:46:33,601 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (= (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) |c_#valid|)) is different from true [2018-12-03 02:46:35,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:35,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:35,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-03 02:46:35,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-03 02:46:35,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:35,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:35,648 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-03 02:46:35,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-12-03 02:46:35,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-03 02:46:35,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:35,692 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-03 02:46:35,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-12-03 02:46:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2018-12-03 02:46:35,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:46:36,704 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:46:36,705 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 26955 column 11: unknown constant v_node_create_#t~malloc2.base_33 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:114) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:120) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.checkEqualityStatus(Elim1Store.java:668) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:760) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 02:46:36,711 INFO L168 Benchmark]: Toolchain (without parser) took 8284.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 948.1 MB in the beginning and 851.7 MB in the end (delta: 96.4 MB). Peak memory consumption was 263.6 MB. Max. memory is 11.5 GB. [2018-12-03 02:46:36,712 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:46:36,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-03 02:46:36,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.65 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-03 02:46:36,713 INFO L168 Benchmark]: Boogie Preprocessor took 22.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 02:46:36,714 INFO L168 Benchmark]: RCFGBuilder took 323.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-03 02:46:36,714 INFO L168 Benchmark]: TraceAbstraction took 7626.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 851.7 MB in the end (delta: 211.0 MB). Peak memory consumption was 254.5 MB. Max. memory is 11.5 GB. [2018-12-03 02:46:36,716 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 323.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7626.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 851.7 MB in the end (delta: 211.0 MB). Peak memory consumption was 254.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 26955 column 11: unknown constant v_node_create_#t~malloc2.base_33 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 26955 column 11: unknown constant v_node_create_#t~malloc2.base_33: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 02:46:38,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:46:38,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:46:38,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:46:38,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:46:38,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:46:38,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:46:38,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:46:38,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:46:38,023 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:46:38,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:46:38,023 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:46:38,024 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:46:38,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:46:38,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:46:38,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:46:38,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:46:38,027 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:46:38,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:46:38,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:46:38,029 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:46:38,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:46:38,031 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:46:38,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:46:38,031 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:46:38,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:46:38,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:46:38,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:46:38,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:46:38,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:46:38,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:46:38,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:46:38,034 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:46:38,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:46:38,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:46:38,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:46:38,036 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-03 02:46:38,043 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:46:38,043 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:46:38,044 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:46:38,044 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:46:38,044 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:46:38,045 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:46:38,045 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:46:38,045 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:46:38,045 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:46:38,045 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:46:38,045 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 02:46:38,046 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 02:46:38,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:46:38,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:46:38,046 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 02:46:38,046 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:46:38,046 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:46:38,046 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:46:38,046 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 02:46:38,047 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 02:46:38,047 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 02:46:38,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:46:38,047 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 02:46:38,047 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 02:46:38,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:46:38,047 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 02:46:38,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:46:38,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:46:38,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:46:38,048 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:46:38,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:46:38,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:46:38,048 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:46:38,048 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 02:46:38,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:46:38,049 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 02:46:38,049 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_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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 -> 1eb62d582bb1f498de7f5f7de60817c0efb48782 [2018-12-03 02:46:38,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:46:38,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:46:38,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:46:38,077 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:46:38,077 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:46:38,078 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-03 02:46:38,114 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/data/0cad26ec0/70856f6b28844c459782ea3a33e54bb2/FLAG0cd9b0571 [2018-12-03 02:46:38,537 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:46:38,538 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/sv-benchmarks/c/list-simple/sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-03 02:46:38,543 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/data/0cad26ec0/70856f6b28844c459782ea3a33e54bb2/FLAG0cd9b0571 [2018-12-03 02:46:38,551 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/data/0cad26ec0/70856f6b28844c459782ea3a33e54bb2 [2018-12-03 02:46:38,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:46:38,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:46:38,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:46:38,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:46:38,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:46:38,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:46:38" (1/1) ... [2018-12-03 02:46:38,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33327ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38, skipping insertion in model container [2018-12-03 02:46:38,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:46:38" (1/1) ... [2018-12-03 02:46:38,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:46:38,581 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:46:38,738 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:46:38,745 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:46:38,813 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:46:38,846 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:46:38,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38 WrapperNode [2018-12-03 02:46:38,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:46:38,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:46:38,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:46:38,847 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:46:38,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38" (1/1) ... [2018-12-03 02:46:38,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38" (1/1) ... [2018-12-03 02:46:38,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:46:38,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:46:38,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:46:38,867 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:46:38,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38" (1/1) ... [2018-12-03 02:46:38,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38" (1/1) ... [2018-12-03 02:46:38,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38" (1/1) ... [2018-12-03 02:46:38,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38" (1/1) ... [2018-12-03 02:46:38,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38" (1/1) ... [2018-12-03 02:46:38,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38" (1/1) ... [2018-12-03 02:46:38,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38" (1/1) ... [2018-12-03 02:46:38,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:46:38,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:46:38,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:46:38,889 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:46:38,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 02:46:38,920 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 02:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 02:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-03 02:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-03 02:46:38,920 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-03 02:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_append [2018-12-03 02:46:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_append [2018-12-03 02:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 02:46:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 02:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 02:46:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 02:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 02:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 02:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-03 02:46:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-03 02:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 02:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-03 02:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 02:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-03 02:46:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-03 02:46:38,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:46:38,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:46:39,310 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:46:39,311 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-03 02:46:39,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:46:39 BoogieIcfgContainer [2018-12-03 02:46:39,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:46:39,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:46:39,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:46:39,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:46:39,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:46:38" (1/3) ... [2018-12-03 02:46:39,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a42fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:46:39, skipping insertion in model container [2018-12-03 02:46:39,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:46:38" (2/3) ... [2018-12-03 02:46:39,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a42fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:46:39, skipping insertion in model container [2018-12-03 02:46:39,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:46:39" (3/3) ... [2018-12-03 02:46:39,315 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-03 02:46:39,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:46:39,325 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-12-03 02:46:39,334 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-12-03 02:46:39,348 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 02:46:39,348 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:46:39,348 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 02:46:39,348 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:46:39,348 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:46:39,348 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:46:39,348 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:46:39,349 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:46:39,349 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:46:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-12-03 02:46:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 02:46:39,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:39,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:39,365 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:46:39,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash -321535227, now seen corresponding path program 1 times [2018-12-03 02:46:39,370 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:46:39,371 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:46:39,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:39,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:39,458 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-03 02:46:39,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:39,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:39,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:46:39,474 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-03 02:46:39,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:46:39,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:46:39,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 02:46:39,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:46:39,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:46:39,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:46:39,489 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-12-03 02:46:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:39,695 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-12-03 02:46:39,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:46:39,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 02:46:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:39,705 INFO L225 Difference]: With dead ends: 142 [2018-12-03 02:46:39,705 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 02:46:39,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-03 02:46:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 02:46:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 02:46:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 02:46:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-12-03 02:46:39,734 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 12 [2018-12-03 02:46:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:39,735 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-12-03 02:46:39,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:46:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-12-03 02:46:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 02:46:39,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:39,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:39,736 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:46:39,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:39,736 INFO L82 PathProgramCache]: Analyzing trace with hash -321535226, now seen corresponding path program 1 times [2018-12-03 02:46:39,736 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:46:39,736 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:46:39,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:39,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:39,783 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-03 02:46:39,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:39,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:39,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 02:46:39,795 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-03 02:46:39,796 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:46:39,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:46:39,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 02:46:39,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:46:39,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:46:39,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:46:39,798 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 3 states. [2018-12-03 02:46:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:39,974 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-12-03 02:46:39,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:46:39,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 02:46:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:39,976 INFO L225 Difference]: With dead ends: 133 [2018-12-03 02:46:39,976 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 02:46:39,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-03 02:46:39,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 02:46:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 02:46:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 02:46:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-12-03 02:46:39,984 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-12-03 02:46:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:39,984 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-12-03 02:46:39,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:46:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-12-03 02:46:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 02:46:39,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:39,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:39,985 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:46:39,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:39,985 INFO L82 PathProgramCache]: Analyzing trace with hash 851167050, now seen corresponding path program 1 times [2018-12-03 02:46:39,986 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:46:39,986 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:46:39,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:40,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:40,053 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-03 02:46:40,053 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:46:40,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:46:40,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:46:40,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:46:40,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:46:40,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:46:40,055 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 5 states. [2018-12-03 02:46:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:40,081 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-12-03 02:46:40,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:46:40,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-03 02:46:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:40,082 INFO L225 Difference]: With dead ends: 140 [2018-12-03 02:46:40,082 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 02:46:40,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-03 02:46:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 02:46:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2018-12-03 02:46:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 02:46:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-12-03 02:46:40,089 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 19 [2018-12-03 02:46:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:40,089 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-12-03 02:46:40,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:46:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-12-03 02:46:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 02:46:40,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:40,090 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:40,090 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:46:40,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:40,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1063532723, now seen corresponding path program 1 times [2018-12-03 02:46:40,090 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:46:40,090 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:46:40,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:40,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:40,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 02:46:40,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:40,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:40,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:46:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 02:46:40,192 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:46:40,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:46:40,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:46:40,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:46:40,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:46:40,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:46:40,194 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 6 states. [2018-12-03 02:46:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:40,585 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-12-03 02:46:40,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:46:40,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-03 02:46:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:40,587 INFO L225 Difference]: With dead ends: 134 [2018-12-03 02:46:40,588 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 02:46:40,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-03 02:46:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 02:46:40,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-12-03 02:46:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 02:46:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-12-03 02:46:40,595 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 28 [2018-12-03 02:46:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:40,596 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-12-03 02:46:40,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:46:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-12-03 02:46:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 02:46:40,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:40,597 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:40,597 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:46:40,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:40,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1063532724, now seen corresponding path program 1 times [2018-12-03 02:46:40,598 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:46:40,598 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:46:40,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:40,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:40,681 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-03 02:46:40,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:40,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:40,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 02:46:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 02:46:40,723 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:46:40,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:46:40,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:46:40,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:46:40,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:46:40,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:46:40,726 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 6 states. [2018-12-03 02:46:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:41,156 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-12-03 02:46:41,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:46:41,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-03 02:46:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:41,157 INFO L225 Difference]: With dead ends: 133 [2018-12-03 02:46:41,157 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 02:46:41,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-03 02:46:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 02:46:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-12-03 02:46:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 02:46:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-12-03 02:46:41,161 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 28 [2018-12-03 02:46:41,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:41,161 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-12-03 02:46:41,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:46:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-12-03 02:46:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 02:46:41,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:41,162 INFO L402 BasicCegarLoop]: trace histogram [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-03 02:46:41,162 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:46:41,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash -270265832, now seen corresponding path program 1 times [2018-12-03 02:46:41,163 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:46:41,163 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:46:41,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:41,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:41,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 02:46:41,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:41,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:41,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:46:41,691 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-03 02:46:41,701 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-03 02:46:41,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:41,705 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-03 02:46:41,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-03 02:46:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-03 02:46:41,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:46:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 4 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 02:46:41,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:46:41,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:46:41,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:41,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:41,883 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-03 02:46:41,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:41,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:41,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:46:43,890 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-03 02:46:43,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:43,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:43,900 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-03 02:46:43,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:43,907 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-03 02:46:43,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-03 02:46:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-03 02:46:43,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:46:43,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:46:43,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 10 [2018-12-03 02:46:43,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:46:43,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:46:43,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=66, Unknown=7, NotChecked=34, Total=132 [2018-12-03 02:46:43,993 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 11 states. [2018-12-03 02:46:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:46,790 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-12-03 02:46:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:46:46,790 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-12-03 02:46:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:46,791 INFO L225 Difference]: With dead ends: 147 [2018-12-03 02:46:46,791 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 02:46:46,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=44, Invalid=135, Unknown=11, NotChecked=50, Total=240 [2018-12-03 02:46:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 02:46:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2018-12-03 02:46:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 02:46:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-12-03 02:46:46,798 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 31 [2018-12-03 02:46:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:46,798 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-12-03 02:46:46,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:46:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-12-03 02:46:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 02:46:46,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:46,800 INFO L402 BasicCegarLoop]: trace histogram [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-03 02:46:46,800 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:46:46,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:46,800 INFO L82 PathProgramCache]: Analyzing trace with hash -270265831, now seen corresponding path program 1 times [2018-12-03 02:46:46,801 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:46:46,801 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:46:46,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:46,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:46,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 02:46:46,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:46,924 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-03 02:46:46,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:46,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:46,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 02:46:47,641 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-12-03 02:46:47,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:47,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:47,651 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-03 02:46:47,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:47,663 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-03 02:46:47,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:47,670 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-03 02:46:47,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2018-12-03 02:46:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-03 02:46:47,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:46:47,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:46:47,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:46:47,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:47,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:47,864 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-03 02:46:47,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:47,874 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-03 02:46:47,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:47,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:47,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 02:46:47,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:47,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:47,897 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-03 02:46:47,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:47,907 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-03 02:46:47,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:47,913 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-03 02:46:47,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2018-12-03 02:46:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-03 02:46:47,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:46:48,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 02:46:48,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-03 02:46:48,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:46:48,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:46:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2018-12-03 02:46:48,013 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 9 states. [2018-12-03 02:46:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:46:48,926 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-12-03 02:46:48,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:46:48,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-12-03 02:46:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:46:48,927 INFO L225 Difference]: With dead ends: 146 [2018-12-03 02:46:48,927 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 02:46:48,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2018-12-03 02:46:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 02:46:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2018-12-03 02:46:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 02:46:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-12-03 02:46:48,930 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 31 [2018-12-03 02:46:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:46:48,930 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-12-03 02:46:48,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:46:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-12-03 02:46:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 02:46:48,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:46:48,931 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:46:48,931 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:46:48,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:46:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2107190679, now seen corresponding path program 1 times [2018-12-03 02:46:48,931 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:46:48,931 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:46:48,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:46:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:46:49,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:46:49,104 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-03 02:46:49,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:49,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:49,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:46:51,115 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-03 02:46:53,132 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-03 02:46:53,523 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-03 02:46:54,231 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ BitVec 32)) (|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)) v_prenex_5 (_ bv1 1))))) is different from true [2018-12-03 02:46:54,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:54,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:46:54,244 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-03 02:46:54,249 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-03 02:46:54,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:54,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:46:54,262 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-03 02:46:54,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-03 02:46:54,315 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-03 02:46:54,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:46:54,323 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-03 02:46:54,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-12-03 02:46:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 13 not checked. [2018-12-03 02:46:54,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:47:02,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:47:02,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:47:02,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:47:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:47:02,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:47:02,620 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-03 02:47:02,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:47:02,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:47:02,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:47:06,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:47:06,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:47:06,471 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-03 02:47:06,476 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-03 02:47:06,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:47:06,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:47:06,491 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-03 02:47:06,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-03 02:47:06,510 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-03 02:47:06,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:47:06,518 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-03 02:47:06,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-12-03 02:47:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 9 trivial. 12 not checked. [2018-12-03 02:47:06,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:47:14,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 02:47:14,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2018-12-03 02:47:14,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 02:47:14,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 02:47:14,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=117, Unknown=14, NotChecked=72, Total=240 [2018-12-03 02:47:14,727 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 12 states. [2018-12-03 02:47:24,830 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.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 |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))) is different from true [2018-12-03 02:47:29,335 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)) (= (store (store |c_old(#valid)| v_prenex_7 (_ bv1 1)) |node_create_#t~malloc2.base| (_ bv1 1)) |c_#valid|))) (exists ((v_prenex_5 (_ BitVec 32)) (|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)) v_prenex_5 (_ bv1 1)))))) is different from true [2018-12-03 02:47:32,178 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 02:47:32,890 WARN L180 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-03 02:49:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:49:39,285 INFO L93 Difference]: Finished difference Result 189 states and 203 transitions. [2018-12-03 02:49:39,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:49:39,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-12-03 02:49:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:49:39,286 INFO L225 Difference]: With dead ends: 189 [2018-12-03 02:49:39,286 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 02:49:39,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=20, NotChecked=160, Total=420 [2018-12-03 02:49:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 02:49:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 158. [2018-12-03 02:49:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 02:49:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-12-03 02:49:39,289 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 47 [2018-12-03 02:49:39,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:49:39,290 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-12-03 02:49:39,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 02:49:39,290 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-12-03 02:49:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 02:49:39,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:49:39,290 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:49:39,291 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:49:39,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:49:39,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2107190678, now seen corresponding path program 1 times [2018-12-03 02:49:39,291 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:49:39,291 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:49:39,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:49:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:49:39,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:49:39,482 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-03 02:49:39,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:49:39,489 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-03 02:49:39,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:49:39,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:49:39,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 02:49:41,554 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| sll_circular_create_~last~0.base (_ bv1 1))) (= |c_#length| (store |c_old(#length)| sll_circular_create_~last~0.base (_ bv8 32))) (= (select |c_old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))) is different from true [2018-12-03 02:49:43,016 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_create_~last~0.base (_ BitVec 32)) (sll_circular_create_~new_head~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~new_head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| sll_circular_create_~last~0.base (_ bv8 32)) sll_circular_create_~new_head~0.base (_ bv8 32))) (= (select |c_old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))) is different from true [2018-12-03 02:49:43,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:49:43,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:49:43,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:49:43,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-03 02:49:43,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:49:43,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:49:43,089 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-03 02:49:43,093 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-03 02:49:43,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 02:49:43,109 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:49:43,126 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-03 02:49:43,126 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:25 [2018-12-03 02:49:45,782 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| (_ bv8 32)))) is different from true [2018-12-03 02:49:45,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:49:45,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:49:45,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:49:45,811 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 22 treesize of output 37 [2018-12-03 02:49:45,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-03 02:49:45,861 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-03 02:49:45,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:60 [2018-12-03 02:49:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2018-12-03 02:49:47,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:49:50,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:49:50,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:49:50,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:49:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:49:50,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:49:50,230 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-03 02:49:50,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:49:50,236 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-03 02:49:50,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:49:50,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:49:50,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 02:49:54,193 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-03 02:49:54,195 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-03 02:49:54,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:49:54,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:49:54,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:49:54,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-03 02:49:56,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 49 [2018-12-03 02:49:56,293 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 32 treesize of output 26 [2018-12-03 02:49:56,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:49:56,330 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 35 treesize of output 34 [2018-12-03 02:49:56,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 02:49:56,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:49:56,354 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-03 02:49:56,354 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-12-03 02:50:01,010 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 02:50:01,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:50:01,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:50:01,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 35 [2018-12-03 02:50:01,144 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 2 case distinctions, treesize of input 27 treesize of output 32 [2018-12-03 02:50:01,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 02:50:01,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 02:50:01,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:50:01,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:50:01,208 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 17 treesize of output 8 [2018-12-03 02:50:01,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 02:50:01,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 02:50:01,247 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:83 [2018-12-03 02:50:01,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:50:01,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:50:01,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 60 [2018-12-03 02:50:01,490 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 50 treesize of output 43 [2018-12-03 02:50:01,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:50:01,528 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 32 treesize of output 25 [2018-12-03 02:50:01,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 02:50:01,556 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-03 02:50:01,556 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-03 02:50:01,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2018-12-03 02:50:01,590 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 02:50:01,628 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-03 02:50:01,628 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-03 02:50:01,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-03 02:50:01,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-03 02:50:01,753 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:115, output treesize:61 [2018-12-03 02:50:05,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:50:05,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:50:05,709 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 2 case distinctions, treesize of input 21 treesize of output 24 [2018-12-03 02:50:05,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-03 02:50:05,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 02:50:05,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:38 [2018-12-03 02:50:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2018-12-03 02:50:05,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:50:08,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 02:50:08,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 32 [2018-12-03 02:50:08,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 02:50:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 02:50:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=12, NotChecked=186, Total=1190 [2018-12-03 02:50:08,025 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 33 states. [2018-12-03 02:50:30,045 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 02:50:32,295 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 02:50:36,558 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 02:50:40,986 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-12-03 02:50:43,302 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 02:50:53,809 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-12-03 02:51:02,393 WARN L180 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-12-03 02:52:01,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:01,790 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2018-12-03 02:52:01,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 02:52:01,791 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-12-03 02:52:01,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:01,792 INFO L225 Difference]: With dead ends: 184 [2018-12-03 02:52:01,792 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 02:52:01,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 61.1s TimeCoverageRelationStatistics Valid=159, Invalid=1814, Unknown=19, NotChecked=264, Total=2256 [2018-12-03 02:52:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 02:52:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 158. [2018-12-03 02:52:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 02:52:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2018-12-03 02:52:01,797 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 47 [2018-12-03 02:52:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:01,797 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2018-12-03 02:52:01,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 02:52:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2018-12-03 02:52:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 02:52:01,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:01,798 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:52:01,798 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:52:01,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:01,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2080646806, now seen corresponding path program 1 times [2018-12-03 02:52:01,799 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:01,799 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:52:01,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:01,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:01,914 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-03 02:52:01,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:01,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:01,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:52:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:52:01,932 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:01,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:01,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:52:01,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:52:01,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:52:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:52:01,935 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand 6 states. [2018-12-03 02:52:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:02,272 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2018-12-03 02:52:02,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:52:02,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-12-03 02:52:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:02,273 INFO L225 Difference]: With dead ends: 156 [2018-12-03 02:52:02,273 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 02:52:02,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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-03 02:52:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 02:52:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 02:52:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 02:52:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2018-12-03 02:52:02,276 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 49 [2018-12-03 02:52:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:02,276 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2018-12-03 02:52:02,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:52:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2018-12-03 02:52:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 02:52:02,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:02,276 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:52:02,277 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:52:02,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:02,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2080646805, now seen corresponding path program 1 times [2018-12-03 02:52:02,277 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:02,277 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:52:02,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:02,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:02,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 02:52:02,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:02,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:02,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 02:52:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:52:02,438 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:52:02,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:52:02,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:52:02,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:52:02,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:52:02,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:52:02,441 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand 6 states. [2018-12-03 02:52:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:52:02,850 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2018-12-03 02:52:02,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:52:02,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-12-03 02:52:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:52:02,852 INFO L225 Difference]: With dead ends: 154 [2018-12-03 02:52:02,852 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 02:52:02,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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-03 02:52:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 02:52:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 02:52:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 02:52:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2018-12-03 02:52:02,854 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 49 [2018-12-03 02:52:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:52:02,855 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2018-12-03 02:52:02,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:52:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2018-12-03 02:52:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 02:52:02,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:52:02,855 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:52:02,855 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:52:02,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:52:02,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1953425071, now seen corresponding path program 1 times [2018-12-03 02:52:02,856 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:52:02,856 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:52:02,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:03,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:03,011 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-03 02:52:03,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:03,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:03,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:52:03,153 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-03 02:52:03,155 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-03 02:52:03,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:03,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:03,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:03,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-12-03 02:52:03,228 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 23 treesize of output 18 [2018-12-03 02:52:03,234 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 7 [2018-12-03 02:52:03,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:03,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:03,251 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-03 02:52:03,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:37 [2018-12-03 02:52:07,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:52:07,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:52:07,356 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 21 treesize of output 33 [2018-12-03 02:52:07,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:07,426 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 3 case distinctions, treesize of input 36 treesize of output 46 [2018-12-03 02:52:07,429 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 37 treesize of output 39 [2018-12-03 02:52:07,433 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 7 [2018-12-03 02:52:07,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:07,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:07,483 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-12-03 02:52:07,487 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 7 [2018-12-03 02:52:07,487 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:07,494 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:52:07,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 02:52:07,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 02:52:07,529 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:49, output treesize:73 [2018-12-03 02:52:07,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2018-12-03 02:52:07,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-12-03 02:52:07,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:07,691 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 51 treesize of output 46 [2018-12-03 02:52:07,692 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:07,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 02:52:07,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-03 02:52:07,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-03 02:52:07,782 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:07,793 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:07,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-03 02:52:07,841 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:105, output treesize:129 [2018-12-03 02:52:10,344 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 32 treesize of output 28 [2018-12-03 02:52:10,347 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-03 02:52:10,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:10,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:10,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:52:10,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:17 [2018-12-03 02:52:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 02:52:10,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:52:12,917 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-03 02:52:13,111 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 64 treesize of output 61 [2018-12-03 02:52:13,115 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 16 treesize of output 20 [2018-12-03 02:52:13,121 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 20 treesize of output 8 [2018-12-03 02:52:13,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:13,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:13,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:13,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2018-12-03 02:52:13,404 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-12-03 02:52:13,404 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:13,459 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-12-03 02:52:13,460 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:13,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 02:52:13,831 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-03 02:52:13,851 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-03 02:52:13,852 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-03 02:52:13,863 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-03 02:52:14,054 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 64 treesize of output 61 [2018-12-03 02:52:14,058 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 16 treesize of output 20 [2018-12-03 02:52:14,065 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 20 treesize of output 8 [2018-12-03 02:52:14,066 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:14,070 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:14,096 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:14,199 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:52:14,212 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:52:14,294 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 56 treesize of output 54 [2018-12-03 02:52:14,295 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:14,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-03 02:52:14,390 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:129, output treesize:117 [2018-12-03 02:52:37,506 WARN L180 SmtUtils]: Spent 11.00 s on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-12-03 02:52:37,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:52:37,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:52:37,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:52:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:52:37,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:52:37,620 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-03 02:52:37,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:37,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:37,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:52:38,041 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 02:52:38,050 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-03 02:52:38,052 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-03 02:52:38,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:38,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:38,066 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-03 02:52:38,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-12-03 02:52:38,878 WARN L180 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 02:52:38,890 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 23 treesize of output 18 [2018-12-03 02:52:38,896 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 7 [2018-12-03 02:52:38,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:38,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:38,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 02:52:38,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2018-12-03 02:52:50,187 WARN L180 SmtUtils]: Spent 872.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 02:52:50,195 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 16 treesize of output 15 [2018-12-03 02:52:50,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:50,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2018-12-03 02:52:50,269 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 29 treesize of output 31 [2018-12-03 02:52:50,274 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 7 [2018-12-03 02:52:50,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:50,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:50,328 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2018-12-03 02:52:50,334 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 7 [2018-12-03 02:52:50,334 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:50,340 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:52:50,358 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 02:52:50,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 02:52:50,378 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:44, output treesize:63 [2018-12-03 02:52:54,531 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 39 treesize of output 35 [2018-12-03 02:52:54,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-03 02:52:54,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:54,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:52:54,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-12-03 02:52:54,583 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 36 treesize of output 31 [2018-12-03 02:52:54,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:54,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-12-03 02:52:54,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 02:52:54,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 02:52:54,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-03 02:52:54,696 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:81, output treesize:90 [2018-12-03 02:53:01,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 22 [2018-12-03 02:53:01,102 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-03 02:53:01,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:53:01,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:53:01,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:53:01,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2018-12-03 02:53:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 02:53:01,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:53:01,370 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 02:53:01,528 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-03 02:53:01,552 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-03 02:53:01,738 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 63 treesize of output 60 [2018-12-03 02:53:01,741 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 16 treesize of output 20 [2018-12-03 02:53:01,748 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 20 treesize of output 8 [2018-12-03 02:53:01,748 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 02:53:01,752 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:53:01,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:53:01,872 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 52 treesize of output 50 [2018-12-03 02:53:01,873 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 02:53:01,997 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 60 treesize of output 57 [2018-12-03 02:53:02,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-03 02:53:02,007 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 20 treesize of output 8 [2018-12-03 02:53:02,007 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 02:53:02,013 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:53:02,031 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:53:02,083 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:53:02,096 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:53:02,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-12-03 02:53:02,170 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-12-03 02:53:02,170 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-03 02:53:02,199 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-12-03 02:53:02,199 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 02:53:02,220 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 02:53:02,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-03 02:53:02,276 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:121, output treesize:103 [2018-12-03 02:53:21,666 WARN L180 SmtUtils]: Spent 9.13 s on a formula simplification that was a NOOP. DAG size: 57 [2018-12-03 02:53:21,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 02:53:21,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 30 [2018-12-03 02:53:21,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 02:53:21,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 02:53:21,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1125, Unknown=21, NotChecked=0, Total=1260 [2018-12-03 02:53:21,683 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand 31 states. [2018-12-03 02:53:33,914 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 60 [2018-12-03 02:53:40,503 WARN L180 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2018-12-03 02:53:44,970 WARN L180 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-12-03 02:53:49,445 WARN L180 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-12-03 02:53:56,083 WARN L180 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-12-03 02:54:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:54:20,665 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2018-12-03 02:54:20,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 02:54:20,665 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-12-03 02:54:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:54:20,666 INFO L225 Difference]: With dead ends: 174 [2018-12-03 02:54:20,666 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 02:54:20,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 95.3s TimeCoverageRelationStatistics Valid=229, Invalid=2004, Unknown=23, NotChecked=0, Total=2256 [2018-12-03 02:54:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 02:54:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2018-12-03 02:54:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 02:54:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2018-12-03 02:54:20,670 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 51 [2018-12-03 02:54:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:54:20,670 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2018-12-03 02:54:20,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 02:54:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2018-12-03 02:54:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 02:54:20,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:54:20,671 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:54:20,671 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:54:20,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:54:20,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1953425072, now seen corresponding path program 1 times [2018-12-03 02:54:20,672 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:54:20,672 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:54:20,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:54:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:54:20,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:54:20,901 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-03 02:54:20,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:54:20,909 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-03 02:54:20,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:54:20,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:54:20,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 02:54:23,265 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv8 32))) (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.offset|))) is different from true [2018-12-03 02:54:23,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:54:23,283 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-03 02:54:23,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:54:23,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:54:23,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:54:23,360 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 15 treesize of output 8 [2018-12-03 02:54:23,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:54:23,466 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 3 case distinctions, treesize of input 36 treesize of output 46 [2018-12-03 02:54:23,470 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 37 treesize of output 39 [2018-12-03 02:54:23,476 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 7 [2018-12-03 02:54:23,476 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 02:54:23,493 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:54:23,589 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-12-03 02:54:23,595 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 7 [2018-12-03 02:54:23,596 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 02:54:23,611 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:54:23,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 02:54:23,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2018-12-03 02:54:23,767 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 27 treesize of output 29 [2018-12-03 02:54:23,773 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 7 [2018-12-03 02:54:23,773 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 02:54:23,782 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:54:23,831 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:54:23,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 02:54:23,859 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:76, output treesize:82 [2018-12-03 02:54:24,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:54:24,197 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 22 treesize of output 20 [2018-12-03 02:54:24,200 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-03 02:54:24,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:54:24,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:54:24,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:54:24,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:54:24,228 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 40 treesize of output 38 [2018-12-03 02:54:24,240 INFO L478 Elim1Store]: Elim1 applied some 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 1 case distinctions, treesize of input 29 treesize of output 28 [2018-12-03 02:54:24,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 02:54:24,263 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 5 treesize of output 1 [2018-12-03 02:54:24,263 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 02:54:24,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:54:24,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:54:24,282 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:68, output treesize:24 [2018-12-03 02:54:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-03 02:54:24,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:54:25,106 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-03 02:54:25,270 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-03 02:54:25,352 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-03 02:54:25,378 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-03 02:54:33,459 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-03 02:54:33,498 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-03 02:54:40,221 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-03 02:54:40,250 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-03 02:54:47,586 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-03 02:54:47,610 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-03 02:54:51,932 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-03 02:54:51,950 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-03 02:54:58,432 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-03 02:54:58,471 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-03 02:55:04,384 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:04,405 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:07,887 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:07,896 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:09,920 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:09,951 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:11,628 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:11,663 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:12,375 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:12,386 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:13,184 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:13,208 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:13,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-2 vars, End of recursive call: 16 dim-0 vars, and 6 xjuncts. [2018-12-03 02:55:13,775 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 18 variables, input treesize:389, output treesize:301 [2018-12-03 02:55:22,804 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 135 DAG size of output: 90 [2018-12-03 02:55:22,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:55:22,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:55:22,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:22,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:55:22,964 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-03 02:55:22,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:22,971 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-03 02:55:22,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:22,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:22,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 02:55:23,920 WARN L180 SmtUtils]: Spent 826.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 02:55:28,111 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-12-03 02:55:30,141 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.offset|))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv8 32))) (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1))))) is different from true [2018-12-03 02:55:30,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:30,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:30,165 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 15 treesize of output 8 [2018-12-03 02:55:30,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:30,230 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-03 02:55:30,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:30,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2018-12-03 02:55:30,346 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 27 treesize of output 29 [2018-12-03 02:55:30,353 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 7 [2018-12-03 02:55:30,353 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:30,369 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:30,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:30,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48 [2018-12-03 02:55:30,510 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 39 treesize of output 41 [2018-12-03 02:55:30,514 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 7 [2018-12-03 02:55:30,514 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:30,523 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:30,600 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-12-03 02:55:30,604 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 7 [2018-12-03 02:55:30,604 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:30,612 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:30,645 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 02:55:30,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 02:55:30,679 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:78, output treesize:84 [2018-12-03 02:55:31,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:31,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 20 [2018-12-03 02:55:31,221 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-03 02:55:31,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:31,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:31,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:31,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:31,248 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 42 treesize of output 40 [2018-12-03 02:55:31,261 INFO L478 Elim1Store]: Elim1 applied some 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 1 case distinctions, treesize of input 31 treesize of output 30 [2018-12-03 02:55:31,262 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 02:55:31,285 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 5 treesize of output 1 [2018-12-03 02:55:31,286 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:31,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:31,309 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-03 02:55:31,309 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:68, output treesize:24 [2018-12-03 02:55:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-03 02:55:31,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:55:31,675 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-03 02:55:31,880 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-03 02:55:31,916 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-03 02:55:35,400 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-03 02:55:35,430 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-03 02:55:38,572 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-03 02:55:38,597 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-03 02:55:40,893 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-03 02:55:40,917 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-03 02:55:42,424 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-03 02:55:42,462 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-03 02:55:44,717 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:44,738 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:46,207 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:46,238 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:47,693 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:47,715 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:49,153 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:49,167 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:50,286 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:50,296 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:51,071 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:51,111 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:51,919 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:51,950 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:52,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 12 dim-2 vars, End of recursive call: 22 dim-0 vars, and 6 xjuncts. [2018-12-03 02:55:52,686 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 24 variables, input treesize:389, output treesize:301 [2018-12-03 02:56:17,808 WARN L180 SmtUtils]: Spent 11.07 s on a formula simplification. DAG size of input: 147 DAG size of output: 96 [2018-12-03 02:56:17,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 02:56:17,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 28 [2018-12-03 02:56:17,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 02:56:17,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 02:56:17,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=8, NotChecked=130, Total=1260 [2018-12-03 02:56:17,826 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand 29 states. [2018-12-03 02:56:23,161 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2018-12-03 02:56:25,793 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-12-03 02:56:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:29,325 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2018-12-03 02:56:29,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 02:56:29,325 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-12-03 02:56:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:29,326 INFO L225 Difference]: With dead ends: 193 [2018-12-03 02:56:29,326 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 02:56:29,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 53.0s TimeCoverageRelationStatistics Valid=195, Invalid=1696, Unknown=9, NotChecked=170, Total=2070 [2018-12-03 02:56:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 02:56:29,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 162. [2018-12-03 02:56:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 02:56:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 183 transitions. [2018-12-03 02:56:29,330 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 183 transitions. Word has length 51 [2018-12-03 02:56:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:29,330 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 183 transitions. [2018-12-03 02:56:29,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 02:56:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 183 transitions. [2018-12-03 02:56:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 02:56:29,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:29,331 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:29,331 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:56:29,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:29,331 INFO L82 PathProgramCache]: Analyzing trace with hash 104159149, now seen corresponding path program 1 times [2018-12-03 02:56:29,331 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:56:29,331 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:56:29,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:29,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:56:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 02:56:29,467 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:56:29,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:29,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:56:29,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:56:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:56:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:56:29,470 INFO L87 Difference]: Start difference. First operand 162 states and 183 transitions. Second operand 5 states. [2018-12-03 02:56:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:29,742 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-12-03 02:56:29,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:56:29,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-03 02:56:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:29,742 INFO L225 Difference]: With dead ends: 157 [2018-12-03 02:56:29,743 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 02:56:29,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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-03 02:56:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 02:56:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 02:56:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 02:56:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2018-12-03 02:56:29,745 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 53 [2018-12-03 02:56:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:29,745 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2018-12-03 02:56:29,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:56:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2018-12-03 02:56:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 02:56:29,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:29,746 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:29,746 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:56:29,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash 104159150, now seen corresponding path program 1 times [2018-12-03 02:56:29,746 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:56:29,746 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/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-03 02:56:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:29,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:56:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 02:56:29,922 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 02:56:29,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:29,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:56:29,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:56:29,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:56:29,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:56:29,925 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 6 states. [2018-12-03 02:56:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:30,368 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2018-12-03 02:56:30,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:56:30,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-03 02:56:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:30,370 INFO L225 Difference]: With dead ends: 153 [2018-12-03 02:56:30,370 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 02:56:30,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 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-03 02:56:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 02:56:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-03 02:56:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 02:56:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions. [2018-12-03 02:56:30,373 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 173 transitions. Word has length 53 [2018-12-03 02:56:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:30,373 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 173 transitions. [2018-12-03 02:56:30,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:56:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 173 transitions. [2018-12-03 02:56:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:56:30,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:30,374 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:30,374 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-03 02:56:30,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:30,374 INFO L82 PathProgramCache]: Analyzing trace with hash -982049502, now seen corresponding path program 1 times [2018-12-03 02:56:30,374 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 02:56:30,375 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b206cff-dd6e-477f-aa7a-65a70fa77d82/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:56:30,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:30,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:56:30,587 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-03 02:56:30,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:30,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:56:30,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 02:56:30,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:30,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:30,651 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-03 02:56:30,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:30,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:56:30,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2018-12-03 02:56:30,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 02:56:30,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 02:56:30,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:30,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:56:30,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:56:30,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-03 02:56:30,789 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 48 treesize of output 44 [2018-12-03 02:56:30,792 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 12 treesize of output 11 [2018-12-03 02:56:30,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:30,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:56:30,810 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-03 02:56:30,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:41 [2018-12-03 02:56:33,374 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv4 32)))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-03 02:56:33,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:33,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:33,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:33,412 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 36 treesize of output 80 [2018-12-03 02:56:33,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:33,606 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2018-12-03 02:56:33,613 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 27 treesize of output 29 [2018-12-03 02:56:33,623 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 7 [2018-12-03 02:56:33,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:33,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:56:33,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:56:33,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:33,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:33,894 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 108 [2018-12-03 02:56:33,898 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 121 treesize of output 123 [2018-12-03 02:56:33,905 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 7 [2018-12-03 02:56:33,906 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:33,930 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:56:34,070 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 [2018-12-03 02:56:34,076 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 7 [2018-12-03 02:56:34,076 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:34,093 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:56:34,136 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 02:56:34,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 02:56:34,196 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:117, output treesize:182 [2018-12-03 02:56:34,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:34,716 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 22 treesize of output 20 [2018-12-03 02:56:34,721 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-03 02:56:34,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:34,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:56:34,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 02:56:34,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:132, output treesize:114 [2018-12-03 02:56:34,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:34,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:34,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:34,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:56:34,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 93 [2018-12-03 02:56:34,985 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 89 [2018-12-03 02:56:34,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 02:56:35,108 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 71 treesize of output 64 [2018-12-03 02:56:35,108 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:35,195 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 72 treesize of output 67 [2018-12-03 02:56:35,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:35,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 64 treesize of output 54 [2018-12-03 02:56:35,272 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:56:35,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 67 treesize of output 53 [2018-12-03 02:56:35,336 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-03 02:56:35,384 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 50 treesize of output 39 [2018-12-03 02:56:35,385 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:35,434 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 54 treesize of output 43 [2018-12-03 02:56:35,434 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 02:56:35,477 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-03 02:56:35,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 02:56:35,520 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:115, output treesize:77 [2018-12-03 02:56:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-03 02:56:35,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:56:36,371 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-03 02:56:36,588 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-03 02:56:36,630 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-03 02:56:36,873 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-03 02:56:36,912 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-03 02:56:37,060 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-03 02:56:37,081 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-03 02:56:37,215 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-03 02:56:37,242 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-03 02:56:37,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-03 02:56:37,349 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:149, output treesize:159 [2018-12-03 02:56:49,727 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-03 02:56:49,928 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 02:56:49,929 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.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) 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) ... 46 more [2018-12-03 02:56:49,936 INFO L168 Benchmark]: Toolchain (without parser) took 611381.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -125.7 MB). Peak memory consumption was 94.0 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:49,936 INFO L168 Benchmark]: CDTParser took 0.14 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-03 02:56:49,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:49,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.97 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-03 02:56:49,938 INFO L168 Benchmark]: Boogie Preprocessor took 22.45 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:49,938 INFO L168 Benchmark]: RCFGBuilder took 421.78 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:49,939 INFO L168 Benchmark]: TraceAbstraction took 610622.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.2 MB). Peak memory consumption was 76.5 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:49,941 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.14 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 291.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.45 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 421.78 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 610622.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.2 MB). Peak memory consumption was 76.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...