./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_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_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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 bbba94f2f04b60d63941eafbcb1f4bac5dd19069 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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 bbba94f2f04b60d63941eafbcb1f4bac5dd19069 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:20:08,542 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:20:08,543 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:20:08,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:20:08,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:20:08,550 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:20:08,550 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:20:08,551 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:20:08,552 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:20:08,552 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:20:08,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:20:08,553 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:20:08,553 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:20:08,554 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:20:08,554 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:20:08,554 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:20:08,555 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:20:08,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:20:08,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:20:08,557 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:20:08,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:20:08,558 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:20:08,559 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:20:08,559 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:20:08,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:20:08,560 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:20:08,560 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:20:08,561 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:20:08,561 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:20:08,562 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:20:08,562 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:20:08,562 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:20:08,562 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:20:08,562 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:20:08,563 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:20:08,563 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:20:08,563 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 19:20:08,570 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:20:08,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:20:08,571 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:20:08,571 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:20:08,571 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:20:08,571 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:20:08,571 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:20:08,571 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:20:08,571 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:20:08,572 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:20:08,572 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:20:08,572 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:20:08,572 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:20:08,572 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 19:20:08,572 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 19:20:08,572 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:20:08,572 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:20:08,572 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:20:08,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:20:08,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:20:08,574 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:20:08,574 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:20:08,574 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:20:08,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:20:08,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:20:08,574 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_48990303-4e35-4081-803d-e7c6119dc9c1/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 -> bbba94f2f04b60d63941eafbcb1f4bac5dd19069 [2018-12-09 19:20:08,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:20:08,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:20:08,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:20:08,600 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:20:08,600 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:20:08,601 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:20:08,635 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/data/b982b1ed2/ac0bc04009764385a0e29cbfb0787818/FLAG6c35265c1 [2018-12-09 19:20:08,973 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:20:08,974 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/sv-benchmarks/c/list-simple/dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:20:08,980 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/data/b982b1ed2/ac0bc04009764385a0e29cbfb0787818/FLAG6c35265c1 [2018-12-09 19:20:09,363 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/data/b982b1ed2/ac0bc04009764385a0e29cbfb0787818 [2018-12-09 19:20:09,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:20:09,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:20:09,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:20:09,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:20:09,369 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:20:09,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:20:09" (1/1) ... [2018-12-09 19:20:09,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75090e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09, skipping insertion in model container [2018-12-09 19:20:09,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:20:09" (1/1) ... [2018-12-09 19:20:09,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:20:09,395 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:20:09,549 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:20:09,556 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:20:09,628 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:20:09,651 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:20:09,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09 WrapperNode [2018-12-09 19:20:09,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:20:09,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:20:09,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:20:09,652 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:20:09,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09" (1/1) ... [2018-12-09 19:20:09,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09" (1/1) ... [2018-12-09 19:20:09,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:20:09,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:20:09,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:20:09,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:20:09,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09" (1/1) ... [2018-12-09 19:20:09,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09" (1/1) ... [2018-12-09 19:20:09,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09" (1/1) ... [2018-12-09 19:20:09,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09" (1/1) ... [2018-12-09 19:20:09,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09" (1/1) ... [2018-12-09 19:20:09,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09" (1/1) ... [2018-12-09 19:20:09,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09" (1/1) ... [2018-12-09 19:20:09,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:20:09,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:20:09,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:20:09,690 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:20:09,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:20:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-09 19:20:09,722 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-09 19:20:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 19:20:09,722 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 19:20:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:20:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 19:20:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:20:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 19:20:09,722 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 19:20:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:20:09,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:20:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:20:09,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:20:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:20:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_append [2018-12-09 19:20:09,723 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_append [2018-12-09 19:20:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:20:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-09 19:20:09,723 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-09 19:20:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:20:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 19:20:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:20:09,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:20:10,022 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:20:10,023 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 19:20:10,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:10 BoogieIcfgContainer [2018-12-09 19:20:10,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:20:10,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:20:10,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:20:10,025 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:20:10,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:20:09" (1/3) ... [2018-12-09 19:20:10,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cc306f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:20:10, skipping insertion in model container [2018-12-09 19:20:10,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:09" (2/3) ... [2018-12-09 19:20:10,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cc306f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:20:10, skipping insertion in model container [2018-12-09 19:20:10,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:10" (3/3) ... [2018-12-09 19:20:10,027 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:20:10,033 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:20:10,038 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2018-12-09 19:20:10,049 INFO L257 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2018-12-09 19:20:10,064 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:20:10,064 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 19:20:10,064 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:20:10,064 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:20:10,064 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:20:10,064 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:20:10,064 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:20:10,064 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:20:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2018-12-09 19:20:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 19:20:10,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:10,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:10,082 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:10,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash 92549618, now seen corresponding path program 1 times [2018-12-09 19:20:10,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:10,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:10,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:10,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:10,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:10,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:10,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:20:10,209 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:10,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:20:10,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:20:10,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:10,222 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2018-12-09 19:20:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:10,326 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-12-09 19:20:10,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:20:10,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 19:20:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:10,334 INFO L225 Difference]: With dead ends: 147 [2018-12-09 19:20:10,334 INFO L226 Difference]: Without dead ends: 140 [2018-12-09 19:20:10,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-09 19:20:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-09 19:20:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-09 19:20:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2018-12-09 19:20:10,362 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 12 [2018-12-09 19:20:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:10,363 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2018-12-09 19:20:10,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:20:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2018-12-09 19:20:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 19:20:10,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:10,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:10,363 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:10,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:10,364 INFO L82 PathProgramCache]: Analyzing trace with hash 92549619, now seen corresponding path program 1 times [2018-12-09 19:20:10,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:10,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:10,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:10,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:10,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:20:10,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:10,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:20:10,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:20:10,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:10,406 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand 3 states. [2018-12-09 19:20:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:10,484 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2018-12-09 19:20:10,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:20:10,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 19:20:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:10,485 INFO L225 Difference]: With dead ends: 137 [2018-12-09 19:20:10,485 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 19:20:10,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 19:20:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-09 19:20:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-09 19:20:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-12-09 19:20:10,493 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 12 [2018-12-09 19:20:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:10,494 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-12-09 19:20:10,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:20:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-12-09 19:20:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:20:10,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:10,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:10,495 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:10,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:10,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1352277038, now seen corresponding path program 1 times [2018-12-09 19:20:10,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:10,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:10,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:10,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:10,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:10,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:10,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:10,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:10,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:10,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:10,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:10,556 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 6 states. [2018-12-09 19:20:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:10,725 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-12-09 19:20:10,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:20:10,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 19:20:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:10,727 INFO L225 Difference]: With dead ends: 141 [2018-12-09 19:20:10,727 INFO L226 Difference]: Without dead ends: 141 [2018-12-09 19:20:10,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-09 19:20:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-12-09 19:20:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-09 19:20:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2018-12-09 19:20:10,734 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 20 [2018-12-09 19:20:10,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:10,734 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2018-12-09 19:20:10,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2018-12-09 19:20:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:20:10,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:10,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:10,735 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:10,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:10,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1352277039, now seen corresponding path program 1 times [2018-12-09 19:20:10,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:10,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:10,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:10,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:10,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:10,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:10,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:10,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:10,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:20:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:20:10,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:10,764 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 5 states. [2018-12-09 19:20:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:10,782 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-12-09 19:20:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:20:10,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 19:20:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:10,783 INFO L225 Difference]: With dead ends: 138 [2018-12-09 19:20:10,783 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 19:20:10,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 19:20:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-09 19:20:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-09 19:20:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-12-09 19:20:10,787 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 20 [2018-12-09 19:20:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:10,788 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-12-09 19:20:10,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:20:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-12-09 19:20:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:20:10,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:10,788 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:10,789 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:10,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash 491359877, now seen corresponding path program 1 times [2018-12-09 19:20:10,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:10,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:10,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:10,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:10,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:20:10,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:10,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:10,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:10,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:10,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:10,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:10,833 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 6 states. [2018-12-09 19:20:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:10,995 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-12-09 19:20:10,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:20:10,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-09 19:20:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:10,996 INFO L225 Difference]: With dead ends: 138 [2018-12-09 19:20:10,996 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 19:20:10,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 19:20:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-12-09 19:20:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-09 19:20:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-12-09 19:20:11,001 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 30 [2018-12-09 19:20:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:11,001 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-12-09 19:20:11,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-12-09 19:20:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:20:11,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:11,002 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:11,002 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:11,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:11,002 INFO L82 PathProgramCache]: Analyzing trace with hash 491359878, now seen corresponding path program 1 times [2018-12-09 19:20:11,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:11,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:11,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:11,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:11,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:11,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:11,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:11,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:11,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:11,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:11,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:11,054 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 6 states. [2018-12-09 19:20:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:11,204 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-12-09 19:20:11,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:20:11,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-09 19:20:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:11,205 INFO L225 Difference]: With dead ends: 137 [2018-12-09 19:20:11,205 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 19:20:11,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 19:20:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-09 19:20:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-09 19:20:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2018-12-09 19:20:11,209 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 30 [2018-12-09 19:20:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:11,209 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2018-12-09 19:20:11,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2018-12-09 19:20:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:20:11,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:11,210 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:11,210 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:11,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:11,210 INFO L82 PathProgramCache]: Analyzing trace with hash -249559226, now seen corresponding path program 1 times [2018-12-09 19:20:11,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:11,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:11,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:11,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:11,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:11,314 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-09 19:20:11,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:11,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:20:11,315 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-09 19:20:11,316 INFO L205 CegarAbsIntRunner]: [0], [59], [61], [70], [72], [73], [78], [80], [97], [98], [192], [198], [200], [203], [206], [209], [210], [211], [217], [218], [219], [220], [223], [224], [225] [2018-12-09 19:20:11,344 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:20:11,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:20:11,473 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:20:11,473 INFO L272 AbstractInterpreter]: Visited 25 different actions 32 times. Never merged. Never widened. Performed 394 root evaluator evaluations with a maximum evaluation depth of 3. Performed 394 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 28 variables. [2018-12-09 19:20:11,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:11,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:20:11,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:11,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:20:11,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:11,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:20:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:11,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:12,743 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 12 treesize of output 11 [2018-12-09 19:20:12,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:12,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:12,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 19:20:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:12,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:12,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:20:12,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 13 [2018-12-09 19:20:12,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:20:12,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:20:12,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:20:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=130, Unknown=4, NotChecked=0, Total=182 [2018-12-09 19:20:12,871 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand 12 states. [2018-12-09 19:20:13,196 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 19:20:13,465 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 19:20:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:13,715 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2018-12-09 19:20:13,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:20:13,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-12-09 19:20:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:13,716 INFO L225 Difference]: With dead ends: 159 [2018-12-09 19:20:13,716 INFO L226 Difference]: Without dead ends: 159 [2018-12-09 19:20:13,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=82, Invalid=220, Unknown=4, NotChecked=0, Total=306 [2018-12-09 19:20:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-09 19:20:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 141. [2018-12-09 19:20:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 19:20:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-12-09 19:20:13,721 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 32 [2018-12-09 19:20:13,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:13,721 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-12-09 19:20:13,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:20:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-12-09 19:20:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:20:13,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:13,722 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:13,722 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:13,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash -249559225, now seen corresponding path program 1 times [2018-12-09 19:20:13,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:13,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:13,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:13,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:13,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:13,825 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-09 19:20:13,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:13,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:20:13,826 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-09 19:20:13,826 INFO L205 CegarAbsIntRunner]: [0], [59], [61], [70], [72], [73], [78], [81], [97], [98], [192], [198], [200], [203], [206], [209], [210], [211], [217], [218], [219], [220], [223], [224], [225] [2018-12-09 19:20:13,827 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:20:13,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:20:13,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:20:13,869 INFO L272 AbstractInterpreter]: Visited 25 different actions 32 times. Never merged. Never widened. Performed 398 root evaluator evaluations with a maximum evaluation depth of 3. Performed 398 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 28 variables. [2018-12-09 19:20:13,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:13,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:20:13,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:13,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:20:13,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:13,878 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:20:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:13,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:14,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:20:14,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:20:14,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 19:20:14,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:14,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 19:20:14,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:14,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:14,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-09 19:20:14,062 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-09 19:20:14,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:14,134 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-09 19:20:22,279 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 61 DAG size of output: 24 [2018-12-09 19:20:22,491 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-09 19:20:22,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:22,499 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-09 19:20:22,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:22,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 19:20:22,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:23 [2018-12-09 19:20:22,551 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 19:20:22,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:22,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:22,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 19:20:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:22,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:20:22,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2018-12-09 19:20:22,571 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:20:22,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 19:20:22,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 19:20:22,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=606, Unknown=2, NotChecked=0, Total=702 [2018-12-09 19:20:22,572 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 18 states. [2018-12-09 19:20:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:23,574 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-12-09 19:20:23,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:20:23,575 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-12-09 19:20:23,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:23,576 INFO L225 Difference]: With dead ends: 158 [2018-12-09 19:20:23,576 INFO L226 Difference]: Without dead ends: 158 [2018-12-09 19:20:23,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=157, Invalid=897, Unknown=2, NotChecked=0, Total=1056 [2018-12-09 19:20:23,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-09 19:20:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2018-12-09 19:20:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 19:20:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-12-09 19:20:23,581 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 32 [2018-12-09 19:20:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:23,581 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-12-09 19:20:23,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 19:20:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-12-09 19:20:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 19:20:23,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:23,582 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:23,583 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:23,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash 691908348, now seen corresponding path program 1 times [2018-12-09 19:20:23,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:23,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:23,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:23,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:23,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:23,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:23,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:20:23,618 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-09 19:20:23,618 INFO L205 CegarAbsIntRunner]: [0], [59], [61], [68], [70], [72], [73], [83], [85], [90], [97], [98], [192], [198], [200], [203], [206], [209], [210], [211], [217], [218], [219], [220], [223], [224], [225] [2018-12-09 19:20:23,619 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:20:23,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:20:23,651 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:20:23,651 INFO L272 AbstractInterpreter]: Visited 25 different actions 32 times. Never merged. Never widened. Performed 388 root evaluator evaluations with a maximum evaluation depth of 3. Performed 388 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 29 variables. [2018-12-09 19:20:23,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:23,652 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:20:23,717 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 75.67% of their original sizes. [2018-12-09 19:20:23,717 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:20:23,833 INFO L418 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-12-09 19:20:23,833 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:20:23,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:20:23,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-12-09 19:20:23,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:23,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 19:20:23,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 19:20:23,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-09 19:20:23,835 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 18 states. [2018-12-09 19:20:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:25,708 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-12-09 19:20:25,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:20:25,708 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-09 19:20:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:25,709 INFO L225 Difference]: With dead ends: 150 [2018-12-09 19:20:25,709 INFO L226 Difference]: Without dead ends: 150 [2018-12-09 19:20:25,709 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:20:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-09 19:20:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-12-09 19:20:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-09 19:20:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2018-12-09 19:20:25,712 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 34 [2018-12-09 19:20:25,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:25,712 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2018-12-09 19:20:25,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 19:20:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-12-09 19:20:25,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:20:25,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:25,713 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:25,713 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:25,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:25,713 INFO L82 PathProgramCache]: Analyzing trace with hash -30458298, now seen corresponding path program 1 times [2018-12-09 19:20:25,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:25,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:25,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:25,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:25,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:20:25,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:25,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:20:25,737 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-12-09 19:20:25,737 INFO L205 CegarAbsIntRunner]: [0], [59], [61], [68], [70], [72], [73], [78], [79], [85], [90], [97], [98], [192], [198], [200], [203], [206], [209], [210], [211], [217], [218], [219], [220], [223], [224], [225] [2018-12-09 19:20:25,738 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:20:25,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:20:25,763 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:20:25,763 INFO L272 AbstractInterpreter]: Visited 28 different actions 49 times. Merged at 5 different actions 5 times. Never widened. Performed 580 root evaluator evaluations with a maximum evaluation depth of 3. Performed 580 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-09 19:20:25,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:25,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:20:25,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:25,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:20:25,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:25,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:20:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:25,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:20:25,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:25,802 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 12 treesize of output 7 [2018-12-09 19:20:25,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:25,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:25,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-09 19:20:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:20:25,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:20:25,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2018-12-09 19:20:25,834 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:20:25,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:20:25,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:20:25,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:25,835 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand 5 states. [2018-12-09 19:20:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:25,963 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-12-09 19:20:25,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:20:25,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-09 19:20:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:25,964 INFO L225 Difference]: With dead ends: 154 [2018-12-09 19:20:25,964 INFO L226 Difference]: Without dead ends: 154 [2018-12-09 19:20:25,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-09 19:20:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-12-09 19:20:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-09 19:20:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-12-09 19:20:25,967 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 35 [2018-12-09 19:20:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:25,968 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-12-09 19:20:25,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:20:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-12-09 19:20:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:20:25,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:25,968 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:25,968 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:25,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:25,969 INFO L82 PathProgramCache]: Analyzing trace with hash -30458297, now seen corresponding path program 1 times [2018-12-09 19:20:25,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:25,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:25,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:25,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:25,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:26,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:26,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:20:26,053 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-12-09 19:20:26,054 INFO L205 CegarAbsIntRunner]: [0], [59], [61], [68], [70], [72], [73], [78], [79], [85], [91], [97], [98], [192], [198], [200], [203], [206], [209], [210], [211], [217], [218], [219], [220], [223], [224], [225] [2018-12-09 19:20:26,054 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:20:26,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:20:26,089 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:20:26,089 INFO L272 AbstractInterpreter]: Visited 28 different actions 68 times. Merged at 9 different actions 16 times. Never widened. Performed 843 root evaluator evaluations with a maximum evaluation depth of 3. Performed 843 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-09 19:20:26,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:26,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:20:26,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:26,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:20:26,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:26,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:20:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:26,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:26,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:26,173 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 16 treesize of output 20 [2018-12-09 19:20:26,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 19:20:26,181 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-09 19:20:26,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:26,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 19:20:26,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:12 [2018-12-09 19:20:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:20:26,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:20:26,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2018-12-09 19:20:26,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:20:26,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:20:26,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:20:26,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:20:26,256 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 9 states. [2018-12-09 19:20:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:26,397 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-12-09 19:20:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:20:26,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-12-09 19:20:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:26,398 INFO L225 Difference]: With dead ends: 159 [2018-12-09 19:20:26,398 INFO L226 Difference]: Without dead ends: 159 [2018-12-09 19:20:26,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:20:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-09 19:20:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2018-12-09 19:20:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-09 19:20:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2018-12-09 19:20:26,402 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 35 [2018-12-09 19:20:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:26,402 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2018-12-09 19:20:26,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:20:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2018-12-09 19:20:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 19:20:26,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:26,403 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:26,403 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:26,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:26,403 INFO L82 PathProgramCache]: Analyzing trace with hash -944207176, now seen corresponding path program 1 times [2018-12-09 19:20:26,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:26,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:26,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:20:26,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:26,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:26,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:26,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:20:26,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:20:26,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:26,450 INFO L87 Difference]: Start difference. First operand 152 states and 160 transitions. Second operand 7 states. [2018-12-09 19:20:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:26,616 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-12-09 19:20:26,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:26,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-09 19:20:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:26,617 INFO L225 Difference]: With dead ends: 152 [2018-12-09 19:20:26,617 INFO L226 Difference]: Without dead ends: 152 [2018-12-09 19:20:26,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:20:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-09 19:20:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-12-09 19:20:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-09 19:20:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-12-09 19:20:26,621 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 36 [2018-12-09 19:20:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:26,621 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-12-09 19:20:26,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:20:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-12-09 19:20:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 19:20:26,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:26,622 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:26,622 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:26,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash -944207175, now seen corresponding path program 1 times [2018-12-09 19:20:26,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:26,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:26,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:26,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:26,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:26,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:20:26,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:20:26,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:26,695 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 7 states. [2018-12-09 19:20:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:26,850 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-12-09 19:20:26,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:26,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-09 19:20:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:26,851 INFO L225 Difference]: With dead ends: 150 [2018-12-09 19:20:26,851 INFO L226 Difference]: Without dead ends: 150 [2018-12-09 19:20:26,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:20:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-09 19:20:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-09 19:20:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-09 19:20:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-12-09 19:20:26,854 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 36 [2018-12-09 19:20:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:26,854 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-12-09 19:20:26,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:20:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-12-09 19:20:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:20:26,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:26,855 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:26,856 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:26,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:26,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1436891810, now seen corresponding path program 1 times [2018-12-09 19:20:26,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:26,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:26,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 19:20:26,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:26,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:26,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:26,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:26,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:26,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:26,888 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 6 states. [2018-12-09 19:20:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:26,909 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-12-09 19:20:26,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:20:26,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-09 19:20:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:26,910 INFO L225 Difference]: With dead ends: 138 [2018-12-09 19:20:26,910 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 19:20:26,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:20:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 19:20:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-09 19:20:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-09 19:20:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2018-12-09 19:20:26,912 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 47 [2018-12-09 19:20:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:26,912 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2018-12-09 19:20:26,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-12-09 19:20:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:20:26,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:26,913 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-09 19:20:26,913 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-09 19:20:26,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:26,913 INFO L82 PathProgramCache]: Analyzing trace with hash 19426142, now seen corresponding path program 1 times [2018-12-09 19:20:26,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:26,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:26,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:20:27,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:27,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:20:27,093 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-09 19:20:27,093 INFO L205 CegarAbsIntRunner]: [0], [2], [59], [61], [68], [70], [72], [73], [78], [79], [85], [89], [92], [95], [96], [97], [98], [104], [106], [108], [192], [198], [200], [203], [206], [209], [210], [211], [212], [213], [217], [218], [219], [220], [221], [222], [223], [224], [225] [2018-12-09 19:20:27,095 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:20:27,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:20:27,133 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:20:27,134 INFO L272 AbstractInterpreter]: Visited 39 different actions 90 times. Merged at 12 different actions 19 times. Never widened. Performed 1085 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1085 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-09 19:20:27,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:27,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:20:27,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:27,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:20:27,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:27,142 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:20:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:27,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:27,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:27,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:27,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:27,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:20:28,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:20:28,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:20:28,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-09 19:20:28,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-09 19:20:28,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:28,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:28,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:28,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2018-12-09 19:20:28,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-09 19:20:28,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:28,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:28,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-12-09 19:20:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 19:20:28,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:29,650 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:20:29,651 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 55439 column 11: unknown constant v_node_create_~temp~0.base_55 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:114) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:120) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.checkEqualityStatus(Elim1Store.java:668) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:760) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 19:20:29,659 INFO L168 Benchmark]: Toolchain (without parser) took 20292.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 945.9 MB in the beginning and 903.3 MB in the end (delta: 42.6 MB). Peak memory consumption was 218.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:29,660 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:20:29,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:29,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:29,664 INFO L168 Benchmark]: Boogie Preprocessor took 20.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:29,665 INFO L168 Benchmark]: RCFGBuilder took 332.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:29,666 INFO L168 Benchmark]: TraceAbstraction took 19633.52 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.0 GB in the beginning and 903.3 MB in the end (delta: 141.4 MB). Peak memory consumption was 212.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:29,669 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 332.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19633.52 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.0 GB in the beginning and 903.3 MB in the end (delta: 141.4 MB). Peak memory consumption was 212.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 55439 column 11: unknown constant v_node_create_~temp~0.base_55 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 55439 column 11: unknown constant v_node_create_~temp~0.base_55: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:20:30,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:20:30,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:20:30,932 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:20:30,932 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:20:30,933 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:20:30,933 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:20:30,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:20:30,935 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:20:30,935 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:20:30,936 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:20:30,936 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:20:30,936 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:20:30,937 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:20:30,937 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:20:30,938 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:20:30,938 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:20:30,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:20:30,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:20:30,940 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:20:30,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:20:30,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:20:30,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:20:30,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:20:30,943 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:20:30,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:20:30,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:20:30,944 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:20:30,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:20:30,945 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:20:30,945 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:20:30,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:20:30,945 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:20:30,946 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:20:30,946 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:20:30,946 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:20:30,947 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 19:20:30,954 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:20:30,954 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:20:30,954 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:20:30,954 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:20:30,955 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:20:30,955 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:20:30,955 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:20:30,955 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:20:30,955 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:20:30,955 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:20:30,955 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 19:20:30,955 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 19:20:30,956 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:20:30,956 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:20:30,956 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 19:20:30,956 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:20:30,956 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:20:30,956 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:20:30,956 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 19:20:30,956 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 19:20:30,956 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 19:20:30,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:20:30,957 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 19:20:30,957 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 19:20:30,957 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:20:30,957 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 19:20:30,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:20:30,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:20:30,957 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:20:30,957 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:20:30,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:20:30,957 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:20:30,958 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:20:30,958 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 19:20:30,958 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:20:30,958 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 19:20:30,958 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_48990303-4e35-4081-803d-e7c6119dc9c1/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 -> bbba94f2f04b60d63941eafbcb1f4bac5dd19069 [2018-12-09 19:20:30,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:20:30,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:20:30,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:20:30,986 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:20:30,987 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:20:30,987 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:20:31,025 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/data/d54d92cc3/acc2378a1a6f4b4792098ffc3a3a9243/FLAG99df2056a [2018-12-09 19:20:31,372 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:20:31,372 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/sv-benchmarks/c/list-simple/dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:20:31,378 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/data/d54d92cc3/acc2378a1a6f4b4792098ffc3a3a9243/FLAG99df2056a [2018-12-09 19:20:31,761 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/data/d54d92cc3/acc2378a1a6f4b4792098ffc3a3a9243 [2018-12-09 19:20:31,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:20:31,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:20:31,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:20:31,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:20:31,767 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:20:31,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:20:31" (1/1) ... [2018-12-09 19:20:31,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785ac8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:31, skipping insertion in model container [2018-12-09 19:20:31,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:20:31" (1/1) ... [2018-12-09 19:20:31,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:20:31,792 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:20:31,953 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:20:31,961 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:20:31,991 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:20:32,051 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:20:32,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32 WrapperNode [2018-12-09 19:20:32,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:20:32,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:20:32,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:20:32,052 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:20:32,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32" (1/1) ... [2018-12-09 19:20:32,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32" (1/1) ... [2018-12-09 19:20:32,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:20:32,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:20:32,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:20:32,072 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:20:32,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32" (1/1) ... [2018-12-09 19:20:32,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32" (1/1) ... [2018-12-09 19:20:32,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32" (1/1) ... [2018-12-09 19:20:32,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32" (1/1) ... [2018-12-09 19:20:32,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32" (1/1) ... [2018-12-09 19:20:32,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32" (1/1) ... [2018-12-09 19:20:32,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32" (1/1) ... [2018-12-09 19:20:32,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:20:32,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:20:32,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:20:32,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:20:32,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:20:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-09 19:20:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-09 19:20:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 19:20:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 19:20:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:20:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 19:20:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 19:20:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 19:20:32,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:20:32,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:20:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:20:32,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:20:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:20:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_append [2018-12-09 19:20:32,126 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_append [2018-12-09 19:20:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:20:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-09 19:20:32,126 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-09 19:20:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:20:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 19:20:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 19:20:32,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:20:32,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:20:32,549 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:20:32,549 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 19:20:32,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:32 BoogieIcfgContainer [2018-12-09 19:20:32,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:20:32,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:20:32,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:20:32,552 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:20:32,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:20:31" (1/3) ... [2018-12-09 19:20:32,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b11eabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:20:32, skipping insertion in model container [2018-12-09 19:20:32,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:32" (2/3) ... [2018-12-09 19:20:32,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b11eabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:20:32, skipping insertion in model container [2018-12-09 19:20:32,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:32" (3/3) ... [2018-12-09 19:20:32,553 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-09 19:20:32,559 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:20:32,563 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2018-12-09 19:20:32,572 INFO L257 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2018-12-09 19:20:32,586 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 19:20:32,587 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:20:32,587 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 19:20:32,587 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:20:32,587 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:20:32,587 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:20:32,587 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:20:32,587 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:20:32,587 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:20:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2018-12-09 19:20:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 19:20:32,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:32,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:32,604 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:32,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:32,607 INFO L82 PathProgramCache]: Analyzing trace with hash 92549618, now seen corresponding path program 1 times [2018-12-09 19:20:32,609 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:32,610 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:20:32,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:32,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:32,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:32,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:32,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:32,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:20:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:32,704 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:20:32,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:32,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:20:32,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:20:32,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:20:32,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:32,718 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2018-12-09 19:20:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:32,970 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-12-09 19:20:32,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:20:32,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 19:20:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:32,978 INFO L225 Difference]: With dead ends: 147 [2018-12-09 19:20:32,978 INFO L226 Difference]: Without dead ends: 140 [2018-12-09 19:20:32,980 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-09 19:20:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-09 19:20:33,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-09 19:20:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-09 19:20:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2018-12-09 19:20:33,012 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 12 [2018-12-09 19:20:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:33,012 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2018-12-09 19:20:33,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:20:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2018-12-09 19:20:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 19:20:33,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:33,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:33,013 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:33,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash 92549619, now seen corresponding path program 1 times [2018-12-09 19:20:33,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:33,014 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:20:33,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:33,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:33,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:33,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:33,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:33,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:20:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:33,077 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:20:33,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:33,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:20:33,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:20:33,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:20:33,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:33,080 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand 3 states. [2018-12-09 19:20:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:33,320 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2018-12-09 19:20:33,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:20:33,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 19:20:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:33,321 INFO L225 Difference]: With dead ends: 137 [2018-12-09 19:20:33,321 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 19:20:33,322 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-09 19:20:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 19:20:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-09 19:20:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-09 19:20:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-12-09 19:20:33,327 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 12 [2018-12-09 19:20:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:33,327 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-12-09 19:20:33,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:20:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-12-09 19:20:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:20:33,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:33,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:33,328 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:33,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1352277038, now seen corresponding path program 1 times [2018-12-09 19:20:33,328 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:33,328 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:20:33,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:33,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:33,407 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:20:33,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:33,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:33,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:20:33,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:20:33,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:33,410 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 5 states. [2018-12-09 19:20:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:33,437 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-12-09 19:20:33,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:20:33,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 19:20:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:33,439 INFO L225 Difference]: With dead ends: 148 [2018-12-09 19:20:33,439 INFO L226 Difference]: Without dead ends: 148 [2018-12-09 19:20:33,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-09 19:20:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2018-12-09 19:20:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-09 19:20:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-12-09 19:20:33,446 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 20 [2018-12-09 19:20:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:33,446 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-12-09 19:20:33,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:20:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-12-09 19:20:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:20:33,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:33,447 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:33,447 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:33,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:33,447 INFO L82 PathProgramCache]: Analyzing trace with hash 491359877, now seen corresponding path program 1 times [2018-12-09 19:20:33,448 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:33,448 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:20:33,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:33,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:33,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:33,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:33,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:33,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:20:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:33,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:20:33,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:33,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:33,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:33,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:33,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:33,562 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 6 states. [2018-12-09 19:20:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:34,062 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-12-09 19:20:34,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:20:34,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-09 19:20:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:34,064 INFO L225 Difference]: With dead ends: 138 [2018-12-09 19:20:34,064 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 19:20:34,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 19:20:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-12-09 19:20:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-09 19:20:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-12-09 19:20:34,071 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 30 [2018-12-09 19:20:34,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:34,071 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-12-09 19:20:34,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-12-09 19:20:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:20:34,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:34,072 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:34,073 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:34,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:34,073 INFO L82 PathProgramCache]: Analyzing trace with hash 491359878, now seen corresponding path program 1 times [2018-12-09 19:20:34,073 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:34,073 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:20:34,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:34,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:34,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:34,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:34,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:34,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:20:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:34,224 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:20:34,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:34,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:34,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:34,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:34,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:34,226 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 6 states. [2018-12-09 19:20:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:34,792 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-12-09 19:20:34,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:20:34,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-09 19:20:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:34,793 INFO L225 Difference]: With dead ends: 137 [2018-12-09 19:20:34,793 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 19:20:34,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 19:20:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-09 19:20:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-09 19:20:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2018-12-09 19:20:34,797 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 30 [2018-12-09 19:20:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:34,797 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2018-12-09 19:20:34,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2018-12-09 19:20:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:20:34,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:34,798 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:34,798 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:34,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:34,798 INFO L82 PathProgramCache]: Analyzing trace with hash -249559226, now seen corresponding path program 1 times [2018-12-09 19:20:34,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:34,798 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:20:34,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:34,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:34,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:34,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:34,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:34,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:20:35,321 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-09 19:20:35,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 19:20:35,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:35,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:35,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-09 19:20:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 19:20:35,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:35,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:35,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:35,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:35,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:35,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:35,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:35,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:35,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:20:37,523 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-09 19:20:37,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:20:37,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:20:37,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 19:20:37,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:37,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:37,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-09 19:20:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 19:20:37,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:37,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:20:37,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 10 [2018-12-09 19:20:37,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:20:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:20:37,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=66, Unknown=7, NotChecked=34, Total=132 [2018-12-09 19:20:37,613 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand 11 states. [2018-12-09 19:20:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:38,404 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2018-12-09 19:20:38,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:20:38,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-12-09 19:20:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:38,405 INFO L225 Difference]: With dead ends: 159 [2018-12-09 19:20:38,405 INFO L226 Difference]: Without dead ends: 159 [2018-12-09 19:20:38,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=39, Invalid=115, Unknown=10, NotChecked=46, Total=210 [2018-12-09 19:20:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-09 19:20:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 141. [2018-12-09 19:20:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 19:20:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-12-09 19:20:38,410 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 32 [2018-12-09 19:20:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:38,410 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-12-09 19:20:38,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:20:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-12-09 19:20:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:20:38,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:38,411 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:38,411 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:38,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:38,411 INFO L82 PathProgramCache]: Analyzing trace with hash -249559225, now seen corresponding path program 1 times [2018-12-09 19:20:38,411 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:38,411 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:38,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:38,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:38,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:38,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:38,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:38,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:38,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:38,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:20:39,354 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))))) is different from true [2018-12-09 19:20:39,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:20:39,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:20:39,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 19:20:39,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:39,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:20:39,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:39,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:39,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2018-12-09 19:20:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 19:20:39,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:39,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:39,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:39,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:39,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:39,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:39,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:39,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:39,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:39,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:39,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:20:39,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:20:39,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:20:39,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 19:20:39,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:39,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:20:39,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:39,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:39,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-12-09 19:20:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 19:20:39,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:39,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:20:39,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-09 19:20:39,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:20:39,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:20:39,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2018-12-09 19:20:39,751 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 9 states. [2018-12-09 19:20:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:40,865 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-12-09 19:20:40,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:20:40,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-09 19:20:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:40,866 INFO L225 Difference]: With dead ends: 158 [2018-12-09 19:20:40,866 INFO L226 Difference]: Without dead ends: 158 [2018-12-09 19:20:40,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2018-12-09 19:20:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-09 19:20:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2018-12-09 19:20:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 19:20:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-12-09 19:20:40,870 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 32 [2018-12-09 19:20:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:40,871 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-12-09 19:20:40,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:20:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-12-09 19:20:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 19:20:40,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:40,871 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:40,871 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:40,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:40,871 INFO L82 PathProgramCache]: Analyzing trace with hash 691908348, now seen corresponding path program 1 times [2018-12-09 19:20:40,872 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:40,872 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:40,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:40,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:40,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:40,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:40,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:40,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:40,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:40,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:41,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:20:41,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 6 [2018-12-09 19:20:41,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:41,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:41,026 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 6 states. [2018-12-09 19:20:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:41,149 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2018-12-09 19:20:41,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:20:41,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-09 19:20:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:41,151 INFO L225 Difference]: With dead ends: 142 [2018-12-09 19:20:41,152 INFO L226 Difference]: Without dead ends: 142 [2018-12-09 19:20:41,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-09 19:20:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-12-09 19:20:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 19:20:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-12-09 19:20:41,154 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 34 [2018-12-09 19:20:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:41,155 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-12-09 19:20:41,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-12-09 19:20:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:20:41,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:41,155 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:41,155 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:41,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:41,156 INFO L82 PathProgramCache]: Analyzing trace with hash -30458298, now seen corresponding path program 1 times [2018-12-09 19:20:41,156 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:41,156 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:41,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:41,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:41,296 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-09 19:20:41,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:41,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:41,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-09 19:20:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:20:41,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:41,310 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 12 treesize of output 7 [2018-12-09 19:20:41,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:41,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:41,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-09 19:20:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:20:41,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:41,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:41,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:41,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:20:41,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:41,406 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 12 treesize of output 7 [2018-12-09 19:20:41,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:41,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:41,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-09 19:20:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:20:41,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:20:41,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3] total 3 [2018-12-09 19:20:41,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:20:41,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:20:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:20:41,441 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 4 states. [2018-12-09 19:20:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:41,675 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-12-09 19:20:41,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:20:41,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-09 19:20:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:41,676 INFO L225 Difference]: With dead ends: 146 [2018-12-09 19:20:41,676 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 19:20:41,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 19:20:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-12-09 19:20:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-09 19:20:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-12-09 19:20:41,679 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 35 [2018-12-09 19:20:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:41,679 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-12-09 19:20:41,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:20:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-12-09 19:20:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:20:41,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:41,680 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:41,680 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:41,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:41,680 INFO L82 PathProgramCache]: Analyzing trace with hash -30458297, now seen corresponding path program 1 times [2018-12-09 19:20:41,681 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:41,681 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:41,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:41,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:41,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:41,851 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-09 19:20:41,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:41,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-12-09 19:20:41,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 19:20:41,943 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-09 19:20:41,943 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:41,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-12-09 19:20:41,991 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:50 [2018-12-09 19:20:42,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:42,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:20:42,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:42,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:42,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:42,211 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 16 treesize of output 20 [2018-12-09 19:20:42,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 19:20:42,281 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-09 19:20:42,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:42,331 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-09 19:20:42,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:20:42,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-12-09 19:20:42,375 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:50 [2018-12-09 19:20:42,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:20:42,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 19:20:42,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:20:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:20:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:20:42,485 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 7 states. [2018-12-09 19:20:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:42,885 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2018-12-09 19:20:42,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:20:42,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-12-09 19:20:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:42,886 INFO L225 Difference]: With dead ends: 151 [2018-12-09 19:20:42,886 INFO L226 Difference]: Without dead ends: 151 [2018-12-09 19:20:42,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:20:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-09 19:20:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-12-09 19:20:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-09 19:20:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-12-09 19:20:42,889 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 35 [2018-12-09 19:20:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:42,889 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-12-09 19:20:42,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:20:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-12-09 19:20:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 19:20:42,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:42,890 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:42,890 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:42,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:42,890 INFO L82 PathProgramCache]: Analyzing trace with hash -944207176, now seen corresponding path program 1 times [2018-12-09 19:20:42,891 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:42,891 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:42,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:42,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:42,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:42,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:42,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:42,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:20:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:43,018 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:20:43,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:43,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:43,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:20:43,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:20:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:43,020 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 7 states. [2018-12-09 19:20:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:43,566 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-12-09 19:20:43,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:43,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-09 19:20:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:43,567 INFO L225 Difference]: With dead ends: 144 [2018-12-09 19:20:43,567 INFO L226 Difference]: Without dead ends: 144 [2018-12-09 19:20:43,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:20:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-09 19:20:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-12-09 19:20:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-09 19:20:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-12-09 19:20:43,571 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 36 [2018-12-09 19:20:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:43,571 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-12-09 19:20:43,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:20:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-12-09 19:20:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 19:20:43,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:43,572 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:43,572 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:43,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash -944207175, now seen corresponding path program 1 times [2018-12-09 19:20:43,573 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:43,573 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:20:43,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:43,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:43,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:43,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:43,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:43,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:20:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:20:43,719 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:20:43,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:43,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:43,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:20:43,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:20:43,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:43,721 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 7 states. [2018-12-09 19:20:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:44,356 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-12-09 19:20:44,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:44,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-09 19:20:44,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:44,358 INFO L225 Difference]: With dead ends: 142 [2018-12-09 19:20:44,358 INFO L226 Difference]: Without dead ends: 142 [2018-12-09 19:20:44,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:20:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-09 19:20:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-09 19:20:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-09 19:20:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-12-09 19:20:44,360 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 36 [2018-12-09 19:20:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:44,360 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-12-09 19:20:44,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:20:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-12-09 19:20:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:20:44,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:44,361 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:44,361 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:44,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:44,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1436891810, now seen corresponding path program 1 times [2018-12-09 19:20:44,361 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:44,361 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:44,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:44,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:20:44,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 19:20:44,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:44,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:44,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:44,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:20:44,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 19:20:44,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:20:44,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 10 [2018-12-09 19:20:44,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:20:44,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:20:44,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:20:44,607 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 10 states. [2018-12-09 19:20:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:44,650 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-12-09 19:20:44,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:20:44,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-12-09 19:20:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:44,651 INFO L225 Difference]: With dead ends: 130 [2018-12-09 19:20:44,651 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 19:20:44,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:20:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 19:20:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-09 19:20:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-09 19:20:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2018-12-09 19:20:44,654 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 47 [2018-12-09 19:20:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:44,654 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2018-12-09 19:20:44,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:20:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2018-12-09 19:20:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:20:44,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:44,654 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-09 19:20:44,655 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:20:44,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:44,655 INFO L82 PathProgramCache]: Analyzing trace with hash 19426142, now seen corresponding path program 1 times [2018-12-09 19:20:44,655 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:20:44,655 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:20:44,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:44,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:44,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:20:44,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:20:44,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:20:44,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:20:46,874 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-09 19:20:48,888 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-09 19:20:54,204 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 19:20:56,209 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 c_dll_circular_create_~new_head~0.base)) (= (store .cse0 c_dll_circular_create_~new_head~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-09 19:21:03,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:21:03,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:21:03,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:21:03,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-09 19:21:03,008 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 32 treesize of output 36 [2018-12-09 19:21:03,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:21:03,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:21:03,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:21:03,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2018-12-09 19:21:03,406 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-09 19:21:03,416 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:21:03,417 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 23 treesize of output 33 [2018-12-09 19:21:03,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:21:03,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 19:21:03,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-12-09 19:21:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 1 times theorem prover too weak. 3 trivial. 16 not checked. [2018-12-09 19:21:03,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:21:19,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:21:19,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:21:19,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:21:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:21:19,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:21:19,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:21:19,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:21:19,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:21:19,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:21:27,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:21:27,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:21:27,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:21:27,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-09 19:21:27,089 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 32 treesize of output 36 [2018-12-09 19:21:27,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:21:27,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:21:27,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:21:27,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2018-12-09 19:21:27,128 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:21:27,128 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 23 treesize of output 33 [2018-12-09 19:21:27,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:21:27,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 19:21:27,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2018-12-09 19:21:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 10 trivial. 14 not checked. [2018-12-09 19:21:27,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:21:40,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:21:40,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 14 [2018-12-09 19:21:40,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 19:21:40,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 19:21:40,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=184, Unknown=19, NotChecked=90, Total=342 [2018-12-09 19:21:40,062 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand 15 states. [2018-12-09 19:22:19,741 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_circular_create_~head~0.base (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select .cse0 dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#valid| (store .cse0 dll_circular_create_~head~0.base (_ bv1 1)))))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse1 c_dll_circular_create_~new_head~0.base)) (= (store .cse1 c_dll_circular_create_~new_head~0.base (_ bv1 1)) |c_#valid|))))) is different from true [2018-12-09 19:22:33,302 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-09 19:22:34,308 WARN L180 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-12-09 19:24:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:58,073 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-12-09 19:24:58,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:24:58,075 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-12-09 19:24:58,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:58,076 INFO L225 Difference]: With dead ends: 138 [2018-12-09 19:24:58,076 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 19:24:58,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 64.9s TimeCoverageRelationStatistics Valid=86, Invalid=321, Unknown=29, NotChecked=164, Total=600 [2018-12-09 19:24:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 19:24:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2018-12-09 19:24:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 19:24:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-12-09 19:24:58,079 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 53 [2018-12-09 19:24:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:58,080 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-12-09 19:24:58,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 19:24:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-12-09 19:24:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:24:58,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:58,080 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-09 19:24:58,081 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:24:58,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash 19426143, now seen corresponding path program 1 times [2018-12-09 19:24:58,081 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:24:58,081 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/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-09 19:24:58,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:58,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:24:58,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:24:58,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:24:58,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:24:58,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:24:58,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:24:58,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:25:00,429 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32))) (= (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 19:25:01,903 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32)) |c_dll_circular_create_#t~ret4.base| (_ bv12 32))) (= (select (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |c_dll_circular_create_#t~ret4.base|) (_ bv0 1)))) is different from true [2018-12-09 19:25:03,750 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_create_~new_head~0.base (_ BitVec 32)) (dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32)) dll_circular_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)))) is different from true [2018-12-09 19:25:03,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:03,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:03,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:03,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 19:25:03,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:03,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:03,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 19:25:03,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-09 19:25:03,814 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:03,823 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:03,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:03,834 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-12-09 19:25:04,656 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)))) is different from true [2018-12-09 19:25:04,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:04,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:04,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:04,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-09 19:25:04,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 19:25:04,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-09 19:25:04,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:60 [2018-12-09 19:25:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2018-12-09 19:25:04,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:05,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:05,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:05,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:05,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:05,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:25:05,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:05,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:25:05,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:05,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:05,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:25:07,103 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-09 19:25:09,113 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)) |c_dll_circular_create_#t~ret4.base| (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_circular_create_#t~ret4.base|)))) is different from true [2018-12-09 19:25:10,295 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)) (= (_ bv0 1) (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_circular_create_~new_head~0.base)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)) c_dll_circular_create_~new_head~0.base (_ bv12 32))))) is different from true [2018-12-09 19:25:11,750 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_create_~head~0.base (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)) dll_circular_create_~head~0.base (_ bv12 32))))) is different from true [2018-12-09 19:25:11,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:11,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:11,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:11,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 19:25:11,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:11,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:11,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 19:25:11,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-09 19:25:11,812 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:11,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:11,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:11,832 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-12-09 19:25:11,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:11,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:11,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:11,890 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-09 19:25:11,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 19:25:11,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-09 19:25:11,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:60 [2018-12-09 19:25:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 22 not checked. [2018-12-09 19:25:11,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:12,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:25:12,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 21 [2018-12-09 19:25:12,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 19:25:12,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 19:25:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=210, Unknown=8, NotChecked=280, Total=552 [2018-12-09 19:25:12,135 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 22 states. [2018-12-09 19:25:14,591 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (exists ((dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32))) (= (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-09 19:25:26,311 WARN L180 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2018-12-09 19:25:28,328 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_circular_create_~new_head~0.base)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)) c_dll_circular_create_~new_head~0.base (_ bv12 32))))) (exists ((dll_circular_create_~new_head~0.base (_ BitVec 32)) (dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32)) dll_circular_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base))))) is different from true [2018-12-09 19:25:30,334 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_circular_create_~new_head~0.base (_ BitVec 32)) (dll_circular_create_~head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_circular_create_~head~0.base (_ bv12 32)) dll_circular_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)))) (exists ((dll_circular_create_~head~0.base (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)) dll_circular_create_~head~0.base (_ bv12 32)))))) is different from true [2018-12-09 19:25:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:33,820 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-12-09 19:25:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:25:33,820 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-12-09 19:25:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:33,821 INFO L225 Difference]: With dead ends: 132 [2018-12-09 19:25:33,821 INFO L226 Difference]: Without dead ends: 132 [2018-12-09 19:25:33,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=83, Invalid=325, Unknown=16, NotChecked=506, Total=930 [2018-12-09 19:25:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-09 19:25:33,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2018-12-09 19:25:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-09 19:25:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-12-09 19:25:33,823 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 53 [2018-12-09 19:25:33,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:33,824 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-12-09 19:25:33,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 19:25:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-12-09 19:25:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:25:33,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:33,825 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-09 19:25:33,825 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:25:33,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1488655903, now seen corresponding path program 1 times [2018-12-09 19:25:33,826 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:25:33,826 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:25:33,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:33,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:33,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:25:33,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:33,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:33,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:25:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 19:25:34,001 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:25:34,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:34,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:34,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:34,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:34,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:34,004 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 6 states. [2018-12-09 19:25:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:34,443 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-12-09 19:25:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:34,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-09 19:25:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:34,444 INFO L225 Difference]: With dead ends: 113 [2018-12-09 19:25:34,444 INFO L226 Difference]: Without dead ends: 113 [2018-12-09 19:25:34,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:25:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-09 19:25:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-09 19:25:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-09 19:25:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-12-09 19:25:34,446 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 55 [2018-12-09 19:25:34,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:34,446 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-12-09 19:25:34,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-12-09 19:25:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:25:34,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:34,446 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-09 19:25:34,447 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:25:34,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:34,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1488655904, now seen corresponding path program 1 times [2018-12-09 19:25:34,447 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:25:34,447 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:25:34,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:34,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:34,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:25:34,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:34,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:34,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:25:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 19:25:34,651 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:25:34,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:34,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:34,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:34,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:34,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:34,654 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 6 states. [2018-12-09 19:25:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:35,108 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-12-09 19:25:35,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:35,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-09 19:25:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:35,109 INFO L225 Difference]: With dead ends: 109 [2018-12-09 19:25:35,109 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 19:25:35,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:25:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 19:25:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-09 19:25:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 19:25:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-12-09 19:25:35,111 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 55 [2018-12-09 19:25:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:35,111 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-12-09 19:25:35,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-12-09 19:25:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 19:25:35,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:35,112 INFO L402 BasicCegarLoop]: trace histogram [3, 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-09 19:25:35,112 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:25:35,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:35,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1096296254, now seen corresponding path program 1 times [2018-12-09 19:25:35,112 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:25:35,112 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:25:35,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:35,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:35,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:25:35,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:35,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:35,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:25:35,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 19:25:35,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 19:25:35,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:35,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:35,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:35,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-12-09 19:25:35,610 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 21 treesize of output 16 [2018-12-09 19:25:35,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:35,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 19:25:35,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:35,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:35,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:35,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-09 19:25:35,717 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 30 treesize of output 23 [2018-12-09 19:25:35,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:25:35,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:35,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:35,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:35,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:47 [2018-12-09 19:25:40,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:40,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:40,270 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-09 19:25:40,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:40,373 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 40 treesize of output 50 [2018-12-09 19:25:40,377 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 41 treesize of output 43 [2018-12-09 19:25:40,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:25:40,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:25:40,385 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:40,391 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:40,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:40,463 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 36 treesize of output 37 [2018-12-09 19:25:40,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:40,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 19:25:40,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:40,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 19:25:40,474 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:40,481 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:40,490 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-09 19:25:40,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-09 19:25:40,537 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-09 19:25:40,538 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:59, output treesize:105 [2018-12-09 19:25:42,644 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 63 treesize of output 57 [2018-12-09 19:25:42,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-09 19:25:42,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:42,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:42,719 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 71 treesize of output 73 [2018-12-09 19:25:42,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2018-12-09 19:25:42,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:42,777 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 59 treesize of output 54 [2018-12-09 19:25:42,778 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:42,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:25:42,893 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-09 19:25:42,893 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:135, output treesize:153 [2018-12-09 19:25:45,454 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 40 treesize of output 34 [2018-12-09 19:25:45,457 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 20 treesize of output 11 [2018-12-09 19:25:45,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:45,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:45,469 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-09 19:25:45,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:18 [2018-12-09 19:25:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:25:45,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:48,389 WARN L180 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 19:25:48,653 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 70 treesize of output 67 [2018-12-09 19:25:48,660 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 19 treesize of output 23 [2018-12-09 19:25:48,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-12-09 19:25:48,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-12-09 19:25:48,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:48,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:48,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:48,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,188 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:49,205 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:49,434 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 56 treesize of output 58 [2018-12-09 19:25:49,439 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-12-09 19:25:49,439 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,474 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 41 treesize of output 39 [2018-12-09 19:25:49,474 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,504 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:25:49,796 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-09 19:25:49,839 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-09 19:25:50,016 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 78 treesize of output 75 [2018-12-09 19:25:50,019 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 19 treesize of output 23 [2018-12-09 19:25:50,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-12-09 19:25:50,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-12-09 19:25:50,033 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:50,041 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:50,050 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:50,064 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:50,155 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 72 treesize of output 68 [2018-12-09 19:25:50,156 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:50,227 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-09 19:25:50,227 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:141, output treesize:132 [2018-12-09 19:26:13,875 WARN L180 SmtUtils]: Spent 13.71 s on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2018-12-09 19:26:13,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:13,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:26:13,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:13,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:26:14,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:26:14,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:14,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:14,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:26:14,558 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 19:26:14,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 19:26:14,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 19:26:14,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:14,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:14,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:14,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-12-09 19:26:15,868 WARN L180 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-09 19:26:15,877 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 21 treesize of output 16 [2018-12-09 19:26:15,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:15,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 19:26:15,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:15,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:15,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:15,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:42 [2018-12-09 19:26:16,859 WARN L180 SmtUtils]: Spent 735.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-09 19:26:16,874 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 30 treesize of output 23 [2018-12-09 19:26:16,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:26:16,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:16,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:16,935 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-09 19:26:16,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:42 [2018-12-09 19:26:21,708 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 30 [2018-12-09 19:26:21,720 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-09 19:26:21,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:21,814 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 31 treesize of output 43 [2018-12-09 19:26:21,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-12-09 19:26:21,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:26:21,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:26:21,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:21,832 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:21,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:21,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-12-09 19:26:21,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:21,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 19:26:21,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:21,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 19:26:21,921 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:21,928 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:21,936 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-09 19:26:21,965 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-09 19:26:22,002 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-09 19:26:22,002 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:54, output treesize:91 [2018-12-09 19:26:26,204 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 51 treesize of output 45 [2018-12-09 19:26:26,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-09 19:26:26,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:26,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:26,273 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 57 treesize of output 59 [2018-12-09 19:26:26,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-12-09 19:26:26,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:26,319 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 45 treesize of output 40 [2018-12-09 19:26:26,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:26,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:26:26,410 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-09 19:26:26,410 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:109, output treesize:113 [2018-12-09 19:26:34,736 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 33 treesize of output 29 [2018-12-09 19:26:34,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 19:26:34,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:34,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:34,747 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-09 19:26:34,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:7 [2018-12-09 19:26:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:26:34,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:26:35,899 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-12-09 19:26:36,125 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 66 treesize of output 63 [2018-12-09 19:26:36,132 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 19 treesize of output 23 [2018-12-09 19:26:36,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-12-09 19:26:36,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-12-09 19:26:36,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:36,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:36,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:36,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:36,449 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:36,473 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:36,731 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 50 treesize of output 52 [2018-12-09 19:26:36,735 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 35 treesize of output 33 [2018-12-09 19:26:36,735 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:36,795 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-12-09 19:26:36,795 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:36,841 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:26:37,072 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-09 19:26:37,108 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-09 19:26:37,284 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 72 treesize of output 69 [2018-12-09 19:26:37,289 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 19 treesize of output 23 [2018-12-09 19:26:37,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-12-09 19:26:37,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-12-09 19:26:37,305 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:37,313 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:37,321 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:37,337 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:37,456 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 66 treesize of output 62 [2018-12-09 19:26:37,457 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:37,539 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-09 19:26:37,540 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 10 variables, input treesize:133, output treesize:114 [2018-12-09 19:26:52,521 WARN L180 SmtUtils]: Spent 10.32 s on a formula simplification that was a NOOP. DAG size: 60 [2018-12-09 19:26:52,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:26:52,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 30 [2018-12-09 19:26:52,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-09 19:26:52,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-09 19:26:52,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1126, Unknown=17, NotChecked=0, Total=1260 [2018-12-09 19:26:52,539 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 31 states. [2018-12-09 19:27:08,750 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 72 [2018-12-09 19:27:13,393 WARN L180 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2018-12-09 19:27:17,955 WARN L180 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2018-12-09 19:27:24,831 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2018-12-09 19:27:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:27:48,048 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-12-09 19:27:48,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 19:27:48,048 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-12-09 19:27:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:27:48,049 INFO L225 Difference]: With dead ends: 123 [2018-12-09 19:27:48,049 INFO L226 Difference]: Without dead ends: 123 [2018-12-09 19:27:48,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 86.9s TimeCoverageRelationStatistics Valid=208, Invalid=1842, Unknown=20, NotChecked=0, Total=2070 [2018-12-09 19:27:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-09 19:27:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2018-12-09 19:27:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-09 19:27:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-12-09 19:27:48,051 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 56 [2018-12-09 19:27:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:27:48,051 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-12-09 19:27:48,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-09 19:27:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-12-09 19:27:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 19:27:48,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:27:48,052 INFO L402 BasicCegarLoop]: trace histogram [3, 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-09 19:27:48,052 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:27:48,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:27:48,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1096296253, now seen corresponding path program 1 times [2018-12-09 19:27:48,052 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:27:48,052 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:27:48,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:27:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:27:48,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:27:48,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:27:48,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:48,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-09 19:27:48,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:48,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:48,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:27:50,910 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 (_ bv12 32))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-09 19:27:50,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:50,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 19:27:50,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:51,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:51,086 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-09 19:27:51,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,282 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 39 treesize of output 49 [2018-12-09 19:27:51,287 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 40 treesize of output 42 [2018-12-09 19:27:51,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:27:51,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:27:51,309 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,353 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,481 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 35 treesize of output 36 [2018-12-09 19:27:51,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:51,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 19:27:51,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:51,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 19:27:51,506 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,526 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,554 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:51,629 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-09 19:27:51,796 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 29 treesize of output 41 [2018-12-09 19:27:51,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-12-09 19:27:51,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:27:51,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:27:51,816 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,822 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,832 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,878 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:51,916 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-09 19:27:51,916 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:84, output treesize:115 [2018-12-09 19:27:52,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:52,380 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 29 treesize of output 25 [2018-12-09 19:27:52,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 19:27:52,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:52,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:52,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:52,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:27:52,407 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 49 treesize of output 45 [2018-12-09 19:27:52,429 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-12-09 19:27:52,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:52,443 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 27 treesize of output 16 [2018-12-09 19:27:52,443 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:27:52,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:27:52,462 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-09 19:27:52,462 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:84, output treesize:26 [2018-12-09 19:27:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-09 19:27:52,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:27:53,578 WARN L180 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-09 19:27:53,842 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-09 19:27:53,962 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 19:27:53,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:27:54,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:13,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:28:13,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:28:28,515 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:28,576 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:40,407 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:40,481 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:49,385 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:49,413 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:28:57,014 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-09 19:28:57,080 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-09 19:29:02,689 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-09 19:29:02,735 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-09 19:29:07,332 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,360 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:09,513 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-09 19:29:09,525 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-09 19:29:11,527 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-09 19:29:11,593 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-09 19:29:12,911 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-09 19:29:12,951 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-09 19:29:13,815 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-09 19:29:13,842 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-09 19:29:14,513 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-09 19:29:14,513 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 18 variables, input treesize:433, output treesize:351 [2018-12-09 19:29:27,832 WARN L180 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 150 DAG size of output: 99 [2018-12-09 19:29:27,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:27,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:29:27,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:27,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:28,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:29:28,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:28,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:29:28,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:28,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:28,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:29:29,061 WARN L180 SmtUtils]: Spent 844.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-09 19:29:33,297 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-12-09 19:29:37,596 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-09 19:29:39,615 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.base|))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)))))) is different from true [2018-12-09 19:29:39,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:39,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:39,650 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-09 19:29:39,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:39,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-09 19:29:39,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:40,020 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 29 treesize of output 41 [2018-12-09 19:29:40,027 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 30 treesize of output 32 [2018-12-09 19:29:40,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:29:40,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:29:40,052 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:40,071 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:40,097 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:40,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:40,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 51 [2018-12-09 19:29:40,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2018-12-09 19:29:40,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:29:40,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:29:40,325 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:40,332 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:40,343 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:40,428 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 37 treesize of output 38 [2018-12-09 19:29:40,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:40,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 19:29:40,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:40,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 19:29:40,440 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:40,447 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:40,457 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:40,492 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 19:29:40,528 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-09 19:29:40,528 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:84, output treesize:119 [2018-12-09 19:29:41,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:41,162 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 29 treesize of output 25 [2018-12-09 19:29:41,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 19:29:41,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:41,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:41,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:41,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:41,196 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 49 treesize of output 45 [2018-12-09 19:29:41,215 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-12-09 19:29:41,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:41,229 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 27 treesize of output 16 [2018-12-09 19:29:41,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:41,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:41,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:41,248 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:82, output treesize:24 [2018-12-09 19:29:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-09 19:29:41,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:29:42,615 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-12-09 19:29:42,826 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 19:29:42,933 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 19:29:42,937 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:42,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:50,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:50,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:58,113 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:29:58,161 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:03,299 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:03,353 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:08,461 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:08,539 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:30:13,267 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-09 19:30:13,312 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-09 19:30:17,041 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-09 19:30:17,068 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-09 19:30:22,375 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 19:30:22,397 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:30:26,588 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 19:30:26,618 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:30:28,174 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-09 19:30:28,242 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-09 19:30:30,286 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-09 19:30:30,310 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-09 19:30:31,478 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-09 19:30:31,529 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-09 19:30:32,839 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-09 19:30:32,839 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 24 variables, input treesize:433, output treesize:351 [2018-12-09 19:31:00,325 WARN L180 SmtUtils]: Spent 13.35 s on a formula simplification. DAG size of input: 162 DAG size of output: 105 [2018-12-09 19:31:00,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:31:00,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 29 [2018-12-09 19:31:00,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 19:31:00,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 19:31:00,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=997, Unknown=10, NotChecked=130, Total=1260 [2018-12-09 19:31:00,342 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 30 states. [2018-12-09 19:31:10,946 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-12-09 19:31:14,061 WARN L180 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-12-09 19:31:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:31:17,079 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-12-09 19:31:17,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 19:31:17,080 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-12-09 19:31:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:31:17,080 INFO L225 Difference]: With dead ends: 122 [2018-12-09 19:31:17,080 INFO L226 Difference]: Without dead ends: 122 [2018-12-09 19:31:17,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 69.3s TimeCoverageRelationStatistics Valid=190, Invalid=1697, Unknown=13, NotChecked=170, Total=2070 [2018-12-09 19:31:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-09 19:31:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2018-12-09 19:31:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 19:31:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-09 19:31:17,083 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 56 [2018-12-09 19:31:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:31:17,083 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-09 19:31:17,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 19:31:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-09 19:31:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:31:17,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:31:17,083 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-09 19:31:17,083 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:31:17,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:31:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1273709373, now seen corresponding path program 1 times [2018-12-09 19:31:17,084 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:31:17,084 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:31:17,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:31:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:31:17,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:31:17,413 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-09 19:31:17,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:17,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:17,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-09 19:31:17,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:31:17,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:17,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:17,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:31:17,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 19:31:17,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 19:31:17,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:17,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:17,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:17,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-12-09 19:31:20,062 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.base|) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 19:31:20,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:20,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:20,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:20,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 58 [2018-12-09 19:31:20,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:20,383 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 29 treesize of output 41 [2018-12-09 19:31:20,391 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 30 treesize of output 32 [2018-12-09 19:31:20,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:31:20,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:31:20,418 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:20,439 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:20,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:20,576 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:20,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 71 [2018-12-09 19:31:20,745 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 60 treesize of output 57 [2018-12-09 19:31:20,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:20,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 19:31:20,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:20,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 19:31:20,763 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:20,773 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:20,788 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:20,918 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 63 treesize of output 65 [2018-12-09 19:31:20,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:31:20,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:31:20,931 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:20,937 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:20,950 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:20,992 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-09 19:31:21,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 19:31:21,043 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:86, output treesize:165 [2018-12-09 19:31:21,238 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2018-12-09 19:31:21,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:21,535 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 29 treesize of output 25 [2018-12-09 19:31:21,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 19:31:21,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:21,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:21,568 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-09 19:31:21,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:86 [2018-12-09 19:31:21,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:21,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:21,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2018-12-09 19:31:21,696 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2018-12-09 19:31:21,696 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-09 19:31:21,771 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 41 [2018-12-09 19:31:21,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:21,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-09 19:31:21,811 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:21,852 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 44 treesize of output 35 [2018-12-09 19:31:21,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:21,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-12-09 19:31:21,890 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:21,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 19:31:21,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 19:31:21,958 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:87, output treesize:69 [2018-12-09 19:31:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-09 19:31:22,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:31:23,381 WARN L180 SmtUtils]: Spent 799.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 19:31:23,572 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 19:31:23,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:23,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:24,309 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:24,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:24,680 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:24,704 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:24,948 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:25,001 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:25,187 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-09 19:31:25,187 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:165, output treesize:187 [2018-12-09 19:31:36,083 WARN L180 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 70 [2018-12-09 19:31:36,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:31:36,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:31:36,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:31:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:31:36,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:31:36,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:31:36,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:36,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:36,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:31:36,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 19:31:36,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 19:31:36,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:36,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:36,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:36,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-12-09 19:31:36,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:36,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:36,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:36,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 58 [2018-12-09 19:31:36,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:36,908 INFO L303 Elim1Store]: Index analysis took 121 ms [2018-12-09 19:31:36,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 72 [2018-12-09 19:31:36,937 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 66 treesize of output 68 [2018-12-09 19:31:36,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:31:36,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:31:36,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:36,978 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:37,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:37,246 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 57 treesize of output 54 [2018-12-09 19:31:37,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:37,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 19:31:37,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:37,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 19:31:37,276 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:37,297 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:37,345 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-09 19:31:37,458 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-09 19:31:37,657 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 29 treesize of output 41 [2018-12-09 19:31:37,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2018-12-09 19:31:37,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:37,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 19:31:37,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:37,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 19:31:37,685 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:37,694 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:37,703 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:37,774 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 26 treesize of output 28 [2018-12-09 19:31:37,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:31:37,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:31:37,792 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:37,801 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:37,814 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:37,843 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:37,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 19:31:37,898 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 4 variables, input treesize:86, output treesize:161 [2018-12-09 19:31:37,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:38,001 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 29 treesize of output 25 [2018-12-09 19:31:38,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 19:31:38,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:38,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:31:38,031 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-09 19:31:38,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:86 [2018-12-09 19:31:38,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:38,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:31:38,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2018-12-09 19:31:38,075 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 68 [2018-12-09 19:31:38,076 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-09 19:31:38,142 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-12-09 19:31:38,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:38,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-12-09 19:31:38,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:38,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-09 19:31:38,215 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:38,249 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 44 treesize of output 35 [2018-12-09 19:31:38,249 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:31:38,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 19:31:38,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 19:31:38,309 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:87, output treesize:69 [2018-12-09 19:31:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2018-12-09 19:31:38,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:31:42,110 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-12-09 19:31:42,328 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 19:31:42,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:42,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:43,099 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:43,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:43,580 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:43,641 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:43,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-09 19:31:43,931 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:31:44,051 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-09 19:31:44,051 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:185, output treesize:235 [2018-12-09 19:31:52,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:31:52,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 27 [2018-12-09 19:31:52,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 19:31:52,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 19:31:52,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1342, Unknown=12, NotChecked=74, Total=1560 [2018-12-09 19:31:52,035 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 28 states. [2018-12-09 19:32:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:32:03,614 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-12-09 19:32:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 19:32:03,614 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2018-12-09 19:32:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:32:03,615 INFO L225 Difference]: With dead ends: 123 [2018-12-09 19:32:03,615 INFO L226 Difference]: Without dead ends: 123 [2018-12-09 19:32:03,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 83 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=234, Invalid=2206, Unknown=14, NotChecked=96, Total=2550 [2018-12-09 19:32:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-09 19:32:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2018-12-09 19:32:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 19:32:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-12-09 19:32:03,617 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 58 [2018-12-09 19:32:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:32:03,617 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-12-09 19:32:03,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 19:32:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-12-09 19:32:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:32:03,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:32:03,618 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-09 19:32:03,618 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_appendErr0REQUIRES_VIOLATION, dll_circular_appendErr21REQUIRES_VIOLATION, dll_circular_appendErr10REQUIRES_VIOLATION, dll_circular_appendErr20REQUIRES_VIOLATION, dll_circular_appendErr9REQUIRES_VIOLATION, dll_circular_appendErr19REQUIRES_VIOLATION, dll_circular_appendErr8REQUIRES_VIOLATION, dll_circular_appendErr18REQUIRES_VIOLATION, dll_circular_appendErr7REQUIRES_VIOLATION, dll_circular_appendErr17REQUIRES_VIOLATION, dll_circular_appendErr6REQUIRES_VIOLATION, dll_circular_appendErr16REQUIRES_VIOLATION, dll_circular_appendErr5REQUIRES_VIOLATION, dll_circular_appendErr15REQUIRES_VIOLATION, dll_circular_appendErr4REQUIRES_VIOLATION, dll_circular_appendErr14REQUIRES_VIOLATION, dll_circular_appendErr3REQUIRES_VIOLATION, dll_circular_appendErr13REQUIRES_VIOLATION, dll_circular_appendErr2REQUIRES_VIOLATION, dll_circular_appendErr23REQUIRES_VIOLATION, dll_circular_appendErr1REQUIRES_VIOLATION, dll_circular_appendErr12REQUIRES_VIOLATION, dll_circular_appendErr22REQUIRES_VIOLATION, dll_circular_appendErr11REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-09 19:32:03,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:32:03,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1273709372, now seen corresponding path program 1 times [2018-12-09 19:32:03,618 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:32:03,618 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48990303-4e35-4081-803d-e7c6119dc9c1/bin-2019/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:32:03,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:32:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:32:04,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:32:04,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:32:04,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:04,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:32:04,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:04,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:04,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:32:04,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:04,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:04,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 19:32:04,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:04,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:32:04,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:04,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:04,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-12-09 19:32:04,332 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 13 treesize of output 10 [2018-12-09 19:32:04,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 19:32:04,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:04,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:04,365 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 13 treesize of output 10 [2018-12-09 19:32:04,368 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 10 treesize of output 9 [2018-12-09 19:32:04,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:04,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:04,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:04,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:63 [2018-12-09 19:32:07,206 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 (_ bv12 32))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) (_ bv8 32)))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-09 19:32:07,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:07,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:07,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-12-09 19:32:07,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:07,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:07,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:07,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:07,474 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 30 treesize of output 37 [2018-12-09 19:32:07,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:07,752 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-12-09 19:32:07,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 90 [2018-12-09 19:32:07,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 94 [2018-12-09 19:32:07,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:32:07,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:32:07,807 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:07,827 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:07,878 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:08,123 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 79 treesize of output 70 [2018-12-09 19:32:08,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:08,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 19:32:08,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:08,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 19:32:08,155 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:08,175 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:08,231 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:32:08,360 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-09 19:32:08,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 124 [2018-12-09 19:32:08,649 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 113 treesize of output 115 [2018-12-09 19:32:08,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-09 19:32:08,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:32:08,668 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:08,675 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:08,701 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:08,812 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:08,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 84 [2018-12-09 19:32:08,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-12-09 19:32:08,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:08,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 19:32:08,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:08,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 19:32:08,870 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:08,880 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:08,887 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:08,909 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:08,984 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-09 19:32:08,985 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 5 variables, input treesize:137, output treesize:194 [2018-12-09 19:32:09,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:09,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 69 [2018-12-09 19:32:09,713 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 55 treesize of output 42 [2018-12-09 19:32:09,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:09,763 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 30 treesize of output 23 [2018-12-09 19:32:09,763 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:09,805 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:32:09,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2018-12-09 19:32:09,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:09,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:32:09,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:09,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:32:09,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 83 [2018-12-09 19:32:09,892 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:32:09,893 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 76 treesize of output 68 [2018-12-09 19:32:09,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:09,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-09 19:32:09,970 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:10,030 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 59 treesize of output 49 [2018-12-09 19:32:10,030 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:32:10,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-12-09 19:32:10,078 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:32:10,129 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:32:10,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-12-09 19:32:10,130 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:32:10,173 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 19:32:10,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 19:32:10,225 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:158, output treesize:85 [2018-12-09 19:32:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-09 19:32:10,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:32:12,364 WARN L180 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-09 19:32:12,596 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-09 19:32:12,704 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 19:32:12,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:32:12,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:32:28,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:32:29,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:32:46,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-09 19:32:46,102 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:33:03,182 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:33:03,279 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:33:16,740 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:33:16,824 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:33:29,525 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-09 19:33:29,583 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-09 19:33:42,293 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-09 19:33:42,346 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-09 19:33:50,615 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-09 19:33:50,673 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-09 19:33:59,348 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-09 19:33:59,442 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-09 19:34:05,183 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-09 19:34:05,220 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-09 19:34:08,395 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-09 19:34:08,469 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-09 19:34:11,801 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-09 19:34:11,852 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-09 19:34:13,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2018-12-09 19:34:13,957 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 18 variables, input treesize:525, output treesize:765 [2018-12-09 19:34:23,428 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 19:34:23,629 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:34:23,630 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:893) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-09 19:34:23,637 INFO L168 Benchmark]: Toolchain (without parser) took 831873.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 938.0 MB in the beginning and 979.6 MB in the end (delta: -41.6 MB). Peak memory consumption was 154.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:34:23,638 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-09 19:34:23,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:34:23,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.30 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:34:23,640 INFO L168 Benchmark]: Boogie Preprocessor took 22.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-09 19:34:23,640 INFO L168 Benchmark]: RCFGBuilder took 455.00 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:34:23,641 INFO L168 Benchmark]: TraceAbstraction took 831086.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 979.6 MB in the end (delta: 79.0 MB). Peak memory consumption was 138.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:34:23,644 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 287.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.30 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.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. * RCFGBuilder took 455.00 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 831086.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 979.6 MB in the end (delta: 79.0 MB). Peak memory consumption was 138.7 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...