./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b873ab0fa5dbe521b35ba5285456d1a3fc5a6f41 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b873ab0fa5dbe521b35ba5285456d1a3fc5a6f41 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 15:59:28,288 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:59:28,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:59:28,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:59:28,295 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:59:28,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:59:28,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:59:28,298 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:59:28,298 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:59:28,299 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:59:28,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:59:28,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:59:28,300 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:59:28,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:59:28,301 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:59:28,301 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:59:28,302 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:59:28,303 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:59:28,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:59:28,304 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:59:28,305 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:59:28,305 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:59:28,307 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:59:28,307 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:59:28,307 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:59:28,307 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:59:28,308 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:59:28,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:59:28,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:59:28,309 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:59:28,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:59:28,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:59:28,310 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:59:28,310 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:59:28,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:59:28,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:59:28,311 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 15:59:28,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:59:28,318 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:59:28,319 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:59:28,319 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 15:59:28,319 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 15:59:28,319 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 15:59:28,319 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 15:59:28,319 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 15:59:28,319 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 15:59:28,319 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 15:59:28,320 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 15:59:28,320 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 15:59:28,320 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 15:59:28,320 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:59:28,320 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:59:28,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:59:28,320 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:59:28,320 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 15:59:28,321 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:59:28,321 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:59:28,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:59:28,321 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 15:59:28,321 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 15:59:28,321 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 15:59:28,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:59:28,321 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:59:28,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:59:28,321 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:59:28,321 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:59:28,322 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 15:59:28,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:59:28,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:59:28,322 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:59:28,322 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 15:59:28,322 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:59:28,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 15:59:28,322 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_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b873ab0fa5dbe521b35ba5285456d1a3fc5a6f41 [2018-12-02 15:59:28,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:59:28,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:59:28,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:59:28,352 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:59:28,353 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:59:28,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 15:59:28,393 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/data/3e983010c/00245ccd66e84fc3a60269d403c3bc12/FLAGf8c436b3e [2018-12-02 15:59:28,760 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:59:28,761 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 15:59:28,767 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/data/3e983010c/00245ccd66e84fc3a60269d403c3bc12/FLAGf8c436b3e [2018-12-02 15:59:29,125 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/data/3e983010c/00245ccd66e84fc3a60269d403c3bc12 [2018-12-02 15:59:29,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:59:29,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:59:29,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:59:29,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:59:29,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:59:29,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:59:29" (1/1) ... [2018-12-02 15:59:29,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f91bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29, skipping insertion in model container [2018-12-02 15:59:29,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:59:29" (1/1) ... [2018-12-02 15:59:29,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:59:29,165 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:59:29,327 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:59:29,333 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:59:29,394 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:59:29,417 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:59:29,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29 WrapperNode [2018-12-02 15:59:29,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:59:29,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:59:29,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:59:29,418 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:59:29,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29" (1/1) ... [2018-12-02 15:59:29,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29" (1/1) ... [2018-12-02 15:59:29,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:59:29,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:59:29,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:59:29,436 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:59:29,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29" (1/1) ... [2018-12-02 15:59:29,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29" (1/1) ... [2018-12-02 15:59:29,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29" (1/1) ... [2018-12-02 15:59:29,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29" (1/1) ... [2018-12-02 15:59:29,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29" (1/1) ... [2018-12-02 15:59:29,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29" (1/1) ... [2018-12-02 15:59:29,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29" (1/1) ... [2018-12-02 15:59:29,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:59:29,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:59:29,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:59:29,457 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:59:29,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:59:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-02 15:59:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-02 15:59:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 15:59:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 15:59:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:59:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 15:59:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-12-02 15:59:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-12-02 15:59:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 15:59:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 15:59:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 15:59:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 15:59:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 15:59:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 15:59:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 15:59:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 15:59:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 15:59:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 15:59:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 15:59:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-02 15:59:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-02 15:59:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:59:29,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:59:29,767 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:59:29,767 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 15:59:29,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:59:29 BoogieIcfgContainer [2018-12-02 15:59:29,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:59:29,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:59:29,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:59:29,771 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:59:29,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:59:29" (1/3) ... [2018-12-02 15:59:29,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6044f051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:59:29, skipping insertion in model container [2018-12-02 15:59:29,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:29" (2/3) ... [2018-12-02 15:59:29,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6044f051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:59:29, skipping insertion in model container [2018-12-02 15:59:29,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:59:29" (3/3) ... [2018-12-02 15:59:29,773 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 15:59:29,781 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:59:29,787 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-12-02 15:59:29,799 INFO L257 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2018-12-02 15:59:29,814 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:59:29,814 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 15:59:29,814 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:59:29,814 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:59:29,814 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:59:29,814 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:59:29,814 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:59:29,815 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:59:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-12-02 15:59:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 15:59:29,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:29,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:29,834 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 15:59:29,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:29,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1762524930, now seen corresponding path program 1 times [2018-12-02 15:59:29,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:59:29,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:29,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:29,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:29,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:59:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:29,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:29,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:59:29,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:59:29,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:59:29,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:59:29,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:29,973 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2018-12-02 15:59:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:30,050 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2018-12-02 15:59:30,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:59:30,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 15:59:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:30,057 INFO L225 Difference]: With dead ends: 119 [2018-12-02 15:59:30,057 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 15:59:30,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 15:59:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-02 15:59:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-02 15:59:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-12-02 15:59:30,086 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 13 [2018-12-02 15:59:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:30,086 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-12-02 15:59:30,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:59:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-12-02 15:59:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 15:59:30,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:30,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:30,087 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 15:59:30,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1762524931, now seen corresponding path program 1 times [2018-12-02 15:59:30,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:59:30,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:30,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:59:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:30,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:30,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:59:30,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:59:30,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:59:30,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:59:30,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:30,125 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 3 states. [2018-12-02 15:59:30,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:30,168 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-12-02 15:59:30,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:59:30,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 15:59:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:30,169 INFO L225 Difference]: With dead ends: 109 [2018-12-02 15:59:30,169 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 15:59:30,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 15:59:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-02 15:59:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 15:59:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-12-02 15:59:30,174 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 13 [2018-12-02 15:59:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:30,175 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-12-02 15:59:30,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:59:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-12-02 15:59:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 15:59:30,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:30,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:30,175 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 15:59:30,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash 782083206, now seen corresponding path program 1 times [2018-12-02 15:59:30,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:59:30,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:30,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:59:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:30,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:30,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:59:30,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:59:30,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:59:30,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:59:30,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:59:30,220 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 6 states. [2018-12-02 15:59:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:30,347 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-12-02 15:59:30,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:59:30,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 15:59:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:30,349 INFO L225 Difference]: With dead ends: 112 [2018-12-02 15:59:30,349 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 15:59:30,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:59:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 15:59:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2018-12-02 15:59:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 15:59:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-12-02 15:59:30,355 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 20 [2018-12-02 15:59:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:30,356 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-12-02 15:59:30,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:59:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-12-02 15:59:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 15:59:30,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:30,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:30,356 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 15:59:30,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:30,357 INFO L82 PathProgramCache]: Analyzing trace with hash 782083207, now seen corresponding path program 1 times [2018-12-02 15:59:30,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:59:30,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:30,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:59:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:30,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:30,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:59:30,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:59:30,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:59:30,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:59:30,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:59:30,409 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 6 states. [2018-12-02 15:59:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:30,541 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-12-02 15:59:30,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:59:30,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 15:59:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:30,542 INFO L225 Difference]: With dead ends: 110 [2018-12-02 15:59:30,543 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 15:59:30,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:59:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 15:59:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-12-02 15:59:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 15:59:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-12-02 15:59:30,547 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 20 [2018-12-02 15:59:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:30,547 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-12-02 15:59:30,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:59:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-12-02 15:59:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 15:59:30,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:30,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:30,548 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 15:59:30,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1156712246, now seen corresponding path program 1 times [2018-12-02 15:59:30,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:59:30,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:30,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:59:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:30,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:30,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:59:30,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:59:30,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:59:30,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:59:30,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:30,574 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 3 states. [2018-12-02 15:59:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:30,585 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-12-02 15:59:30,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:59:30,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 15:59:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:30,586 INFO L225 Difference]: With dead ends: 115 [2018-12-02 15:59:30,586 INFO L226 Difference]: Without dead ends: 115 [2018-12-02 15:59:30,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-02 15:59:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-12-02 15:59:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 15:59:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-12-02 15:59:30,591 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 23 [2018-12-02 15:59:30,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:30,591 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-12-02 15:59:30,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:59:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-12-02 15:59:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 15:59:30,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:30,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:30,592 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 15:59:30,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:30,592 INFO L82 PathProgramCache]: Analyzing trace with hash -581993423, now seen corresponding path program 1 times [2018-12-02 15:59:30,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:59:30,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:30,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:59:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:30,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:30,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:59:30,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:59:30,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:59:30,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:59:30,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:59:30,619 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 5 states. [2018-12-02 15:59:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:30,637 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-12-02 15:59:30,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:59:30,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-02 15:59:30,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:30,639 INFO L225 Difference]: With dead ends: 115 [2018-12-02 15:59:30,639 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 15:59:30,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:59:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 15:59:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-12-02 15:59:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 15:59:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-12-02 15:59:30,643 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 26 [2018-12-02 15:59:30,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:30,643 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-12-02 15:59:30,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:59:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-12-02 15:59:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 15:59:30,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:30,644 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:30,644 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 15:59:30,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:30,644 INFO L82 PathProgramCache]: Analyzing trace with hash 336148239, now seen corresponding path program 1 times [2018-12-02 15:59:30,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:59:30,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:30,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:30,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:59:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:30,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:59:30,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:59:30,782 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-02 15:59:30,784 INFO L205 CegarAbsIntRunner]: [0], [87], [88], [94], [103], [105], [106], [109], [114], [116], [119], [121], [175], [181], [183], [186], [189], [192], [193], [194], [200], [201], [204], [205], [206] [2018-12-02 15:59:30,805 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:59:30,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:59:30,935 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:59:30,936 INFO L272 AbstractInterpreter]: Visited 25 different actions 40 times. Merged at 6 different actions 6 times. Never widened. Performed 360 root evaluator evaluations with a maximum evaluation depth of 3. Performed 360 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-02 15:59:30,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:30,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:59:30,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:59:30,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:59:30,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:30,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:59:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:30,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:59:31,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:59:31,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:31,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:59:31,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 15:59:31,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:59:31,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:59:31,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 15:59:31,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:31,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:59:31,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-02 15:59:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:31,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:59:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:31,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 15:59:31,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2018-12-02 15:59:31,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 15:59:31,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 15:59:31,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 15:59:31,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=322, Unknown=2, NotChecked=0, Total=380 [2018-12-02 15:59:31,846 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 13 states. [2018-12-02 15:59:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:33,736 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-12-02 15:59:33,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:59:33,737 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-12-02 15:59:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:33,737 INFO L225 Difference]: With dead ends: 127 [2018-12-02 15:59:33,737 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 15:59:33,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=577, Unknown=2, NotChecked=0, Total=702 [2018-12-02 15:59:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 15:59:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2018-12-02 15:59:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-02 15:59:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-12-02 15:59:33,742 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 38 [2018-12-02 15:59:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:33,742 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-12-02 15:59:33,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 15:59:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-12-02 15:59:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 15:59:33,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:33,744 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:33,744 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 15:59:33,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash 336148240, now seen corresponding path program 1 times [2018-12-02 15:59:33,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:59:33,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:33,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:33,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:33,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:59:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:33,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:59:33,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:59:33,889 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-02 15:59:33,889 INFO L205 CegarAbsIntRunner]: [0], [87], [88], [94], [103], [105], [106], [109], [114], [117], [119], [121], [175], [181], [183], [186], [189], [192], [193], [194], [200], [201], [204], [205], [206] [2018-12-02 15:59:33,890 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:59:33,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:59:33,946 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:59:33,947 INFO L272 AbstractInterpreter]: Visited 25 different actions 40 times. Merged at 6 different actions 6 times. Never widened. Performed 361 root evaluator evaluations with a maximum evaluation depth of 3. Performed 361 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-02 15:59:33,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:33,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:59:33,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:59:33,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:59:33,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:33,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:59:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:33,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:59:33,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:59:33,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:33,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-02 15:59:33,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:33,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:59:33,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:59:34,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:59:34,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:59:34,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:59:34,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:34,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:59:34,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:34,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:59:34,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-12-02 15:59:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:34,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:59:34,213 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-02 15:59:44,517 WARN L180 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 60 DAG size of output: 23 [2018-12-02 15:59:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:44,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 15:59:44,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 27 [2018-12-02 15:59:44,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 15:59:44,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 15:59:44,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 15:59:44,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=666, Unknown=2, NotChecked=0, Total=756 [2018-12-02 15:59:44,769 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 18 states. [2018-12-02 15:59:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:46,325 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-12-02 15:59:46,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 15:59:46,325 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-12-02 15:59:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:46,326 INFO L225 Difference]: With dead ends: 127 [2018-12-02 15:59:46,326 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 15:59:46,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=177, Invalid=1081, Unknown=2, NotChecked=0, Total=1260 [2018-12-02 15:59:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 15:59:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2018-12-02 15:59:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 15:59:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-12-02 15:59:46,330 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 38 [2018-12-02 15:59:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:46,330 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-12-02 15:59:46,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 15:59:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-12-02 15:59:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 15:59:46,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:46,331 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:46,331 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 15:59:46,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:46,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1161634868, now seen corresponding path program 1 times [2018-12-02 15:59:46,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:59:46,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:46,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:46,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:46,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:59:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 15:59:46,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:59:46,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:59:46,370 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-12-02 15:59:46,371 INFO L205 CegarAbsIntRunner]: [0], [2], [87], [88], [94], [101], [103], [105], [106], [109], [119], [121], [125], [126], [127], [129], [131], [175], [181], [183], [186], [189], [192], [193], [194], [195], [196], [200], [201], [202], [203], [204], [205], [206] [2018-12-02 15:59:46,372 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:59:46,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:59:46,416 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 15:59:46,416 INFO L272 AbstractInterpreter]: Visited 24 different actions 39 times. Merged at 6 different actions 6 times. Never widened. Performed 354 root evaluator evaluations with a maximum evaluation depth of 3. Performed 354 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-12-02 15:59:46,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:46,421 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 15:59:46,465 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 74.47% of their original sizes. [2018-12-02 15:59:46,465 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 15:59:46,536 INFO L418 sIntCurrentIteration]: We unified 40 AI predicates to 40 [2018-12-02 15:59:46,536 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 15:59:46,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:59:46,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-12-02 15:59:46,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:59:46,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 15:59:46,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 15:59:46,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-12-02 15:59:46,538 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 15 states. [2018-12-02 15:59:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:47,267 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-12-02 15:59:47,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 15:59:47,267 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-12-02 15:59:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:47,267 INFO L225 Difference]: With dead ends: 126 [2018-12-02 15:59:47,268 INFO L226 Difference]: Without dead ends: 126 [2018-12-02 15:59:47,268 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-12-02 15:59:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-02 15:59:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-12-02 15:59:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-02 15:59:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-12-02 15:59:47,270 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 41 [2018-12-02 15:59:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:47,271 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-12-02 15:59:47,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 15:59:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-12-02 15:59:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 15:59:47,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:47,271 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:47,272 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 15:59:47,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:47,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2112094387, now seen corresponding path program 1 times [2018-12-02 15:59:47,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:59:47,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:47,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:47,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:59:47,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:59:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 15:59:47,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:59:47,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:59:47,414 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-02 15:59:47,414 INFO L205 CegarAbsIntRunner]: [0], [2], [87], [88], [94], [101], [103], [105], [106], [109], [114], [115], [119], [121], [125], [126], [127], [129], [131], [175], [181], [183], [186], [189], [192], [193], [194], [195], [196], [200], [201], [202], [203], [204], [205], [206] [2018-12-02 15:59:47,415 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:59:47,415 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:59:47,450 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:59:47,451 INFO L272 AbstractInterpreter]: Visited 36 different actions 78 times. Merged at 8 different actions 15 times. Never widened. Performed 710 root evaluator evaluations with a maximum evaluation depth of 3. Performed 710 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-02 15:59:47,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:47,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:59:47,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:59:47,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:59:47,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:47,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:59:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:47,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:59:47,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:59:47,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:47,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:59:47,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 15:59:47,744 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (= (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) |c_#valid|)) is different from true [2018-12-02 15:59:49,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:59:49,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:59:49,775 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-02 15:59:49,778 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-02 15:59:49,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:49,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:59:49,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:59:49,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-12-02 15:59:49,838 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-02 15:59:49,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:49,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:59:49,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-12-02 15:59:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2018-12-02 15:59:49,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:59:53,161 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:59:53,162 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 33872 column 11: unknown constant v_node_create_#t~malloc2.base_33 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:114) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:120) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.checkEqualityStatus(Elim1Store.java:668) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:760) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-02 15:59:53,168 INFO L168 Benchmark]: Toolchain (without parser) took 24040.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 952.4 MB in the beginning and 937.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 329.5 MB. Max. memory is 11.5 GB. [2018-12-02 15:59:53,169 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:59:53,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:59:53,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:59:53,171 INFO L168 Benchmark]: Boogie Preprocessor took 20.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 15:59:53,172 INFO L168 Benchmark]: RCFGBuilder took 310.66 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-12-02 15:59:53,173 INFO L168 Benchmark]: TraceAbstraction took 23398.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 937.4 MB in the end (delta: 127.6 MB). Peak memory consumption was 312.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:59:53,176 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 310.66 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23398.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 937.4 MB in the end (delta: 127.6 MB). Peak memory consumption was 312.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 33872 column 11: unknown constant v_node_create_#t~malloc2.base_33 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 33872 column 11: unknown constant v_node_create_#t~malloc2.base_33: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 15:59:54,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:59:54,445 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:59:54,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:59:54,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:59:54,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:59:54,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:59:54,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:59:54,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:59:54,458 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:59:54,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:59:54,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:59:54,459 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:59:54,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:59:54,460 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:59:54,461 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:59:54,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:59:54,462 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:59:54,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:59:54,464 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:59:54,464 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:59:54,465 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:59:54,466 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:59:54,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:59:54,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:59:54,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:59:54,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:59:54,467 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:59:54,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:59:54,469 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:59:54,469 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:59:54,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:59:54,469 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:59:54,470 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:59:54,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:59:54,470 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:59:54,471 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 15:59:54,480 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:59:54,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:59:54,481 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:59:54,481 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 15:59:54,481 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 15:59:54,481 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 15:59:54,481 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 15:59:54,481 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 15:59:54,482 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 15:59:54,482 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 15:59:54,482 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:59:54,482 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:59:54,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:59:54,483 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:59:54,483 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 15:59:54,483 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:59:54,483 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:59:54,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:59:54,484 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 15:59:54,484 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 15:59:54,484 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 15:59:54,484 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:59:54,484 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 15:59:54,484 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 15:59:54,484 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:59:54,485 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:59:54,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:59:54,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:59:54,485 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:59:54,485 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 15:59:54,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:59:54,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:59:54,486 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:59:54,486 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 15:59:54,486 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:59:54,486 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 15:59:54,486 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_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b873ab0fa5dbe521b35ba5285456d1a3fc5a6f41 [2018-12-02 15:59:54,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:59:54,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:59:54,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:59:54,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:59:54,520 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:59:54,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 15:59:54,556 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/data/7287c34bf/4761fba896624842807516226a5a1202/FLAG60cfdc724 [2018-12-02 15:59:54,983 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:59:54,983 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/sv-benchmarks/c/list-simple/dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 15:59:54,990 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/data/7287c34bf/4761fba896624842807516226a5a1202/FLAG60cfdc724 [2018-12-02 15:59:54,997 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/data/7287c34bf/4761fba896624842807516226a5a1202 [2018-12-02 15:59:54,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:59:55,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:59:55,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:59:55,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:59:55,003 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:59:55,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:59:54" (1/1) ... [2018-12-02 15:59:55,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15605f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55, skipping insertion in model container [2018-12-02 15:59:55,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:59:54" (1/1) ... [2018-12-02 15:59:55,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:59:55,027 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:59:55,187 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:59:55,195 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:59:55,288 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:59:55,313 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:59:55,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55 WrapperNode [2018-12-02 15:59:55,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:59:55,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:59:55,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:59:55,314 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:59:55,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55" (1/1) ... [2018-12-02 15:59:55,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55" (1/1) ... [2018-12-02 15:59:55,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:59:55,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:59:55,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:59:55,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:59:55,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55" (1/1) ... [2018-12-02 15:59:55,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55" (1/1) ... [2018-12-02 15:59:55,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55" (1/1) ... [2018-12-02 15:59:55,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55" (1/1) ... [2018-12-02 15:59:55,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55" (1/1) ... [2018-12-02 15:59:55,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55" (1/1) ... [2018-12-02 15:59:55,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55" (1/1) ... [2018-12-02 15:59:55,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:59:55,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:59:55,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:59:55,365 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:59:55,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:59:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-02 15:59:55,397 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-02 15:59:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 15:59:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 15:59:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:59:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 15:59:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-12-02 15:59:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-12-02 15:59:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 15:59:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 15:59:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 15:59:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 15:59:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 15:59:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 15:59:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 15:59:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 15:59:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 15:59:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 15:59:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 15:59:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-02 15:59:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-02 15:59:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:59:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:59:55,790 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:59:55,790 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 15:59:55,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:59:55 BoogieIcfgContainer [2018-12-02 15:59:55,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:59:55,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:59:55,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:59:55,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:59:55,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:59:54" (1/3) ... [2018-12-02 15:59:55,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddc8fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:59:55, skipping insertion in model container [2018-12-02 15:59:55,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:59:55" (2/3) ... [2018-12-02 15:59:55,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddc8fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:59:55, skipping insertion in model container [2018-12-02 15:59:55,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:59:55" (3/3) ... [2018-12-02 15:59:55,795 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-12-02 15:59:55,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:59:55,805 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-12-02 15:59:55,814 INFO L257 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2018-12-02 15:59:55,829 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:59:55,829 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:59:55,829 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 15:59:55,829 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:59:55,829 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:59:55,829 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:59:55,829 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:59:55,829 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:59:55,830 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:59:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-12-02 15:59:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 15:59:55,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:55,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:55,846 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 15:59:55,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1762524930, now seen corresponding path program 1 times [2018-12-02 15:59:55,851 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:59:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:59:55,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:55,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:59:55,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:59:55,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:55,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:59:55,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 15:59:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:55,976 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 15:59:55,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:55,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:59:55,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:59:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:59:55,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:55,992 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2018-12-02 15:59:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:56,166 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2018-12-02 15:59:56,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:59:56,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 15:59:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:56,173 INFO L225 Difference]: With dead ends: 119 [2018-12-02 15:59:56,173 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 15:59:56,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 15:59:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-02 15:59:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-02 15:59:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-12-02 15:59:56,203 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 13 [2018-12-02 15:59:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:56,203 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-12-02 15:59:56,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:59:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-12-02 15:59:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 15:59:56,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:56,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:56,204 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 15:59:56,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1762524931, now seen corresponding path program 1 times [2018-12-02 15:59:56,205 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:59:56,205 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:59:56,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:56,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:59:56,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:59:56,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:56,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:59:56,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 15:59:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:56,278 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 15:59:56,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:56,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:59:56,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:59:56,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:59:56,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:56,280 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 3 states. [2018-12-02 15:59:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:56,450 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-12-02 15:59:56,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:59:56,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 15:59:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:56,451 INFO L225 Difference]: With dead ends: 109 [2018-12-02 15:59:56,451 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 15:59:56,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 15:59:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-02 15:59:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 15:59:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-12-02 15:59:56,457 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 13 [2018-12-02 15:59:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:56,457 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-12-02 15:59:56,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:59:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-12-02 15:59:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 15:59:56,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:56,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:56,458 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 15:59:56,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:56,459 INFO L82 PathProgramCache]: Analyzing trace with hash 782083206, now seen corresponding path program 1 times [2018-12-02 15:59:56,459 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:59:56,459 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:59:56,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:56,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:59:56,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:59:56,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:56,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:59:56,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 15:59:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:56,544 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 15:59:56,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:56,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:59:56,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:59:56,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:59:56,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:59:56,546 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 6 states. [2018-12-02 15:59:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:56,902 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-12-02 15:59:56,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:59:56,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 15:59:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:56,905 INFO L225 Difference]: With dead ends: 112 [2018-12-02 15:59:56,905 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 15:59:56,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:59:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 15:59:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2018-12-02 15:59:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 15:59:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-12-02 15:59:56,914 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 20 [2018-12-02 15:59:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:56,914 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-12-02 15:59:56,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:59:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-12-02 15:59:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 15:59:56,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:56,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:56,915 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 15:59:56,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:56,916 INFO L82 PathProgramCache]: Analyzing trace with hash 782083207, now seen corresponding path program 1 times [2018-12-02 15:59:56,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:59:56,916 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:59:56,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:56,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:59:56,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:59:56,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:56,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:59:56,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 15:59:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:57,020 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 15:59:57,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:57,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:59:57,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:59:57,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:59:57,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:59:57,023 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 6 states. [2018-12-02 15:59:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:57,444 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-12-02 15:59:57,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:59:57,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 15:59:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:57,446 INFO L225 Difference]: With dead ends: 110 [2018-12-02 15:59:57,446 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 15:59:57,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:59:57,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 15:59:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-12-02 15:59:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 15:59:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-12-02 15:59:57,452 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 20 [2018-12-02 15:59:57,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:57,452 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-12-02 15:59:57,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:59:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-12-02 15:59:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 15:59:57,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:57,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:57,454 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 15:59:57,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:57,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1156712246, now seen corresponding path program 1 times [2018-12-02 15:59:57,455 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:59:57,455 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:59:57,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:57,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:59:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:57,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 15:59:57,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:57,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:59:57,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:59:57,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:59:57,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:57,520 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 3 states. [2018-12-02 15:59:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:57,550 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-12-02 15:59:57,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:59:57,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 15:59:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:57,552 INFO L225 Difference]: With dead ends: 115 [2018-12-02 15:59:57,552 INFO L226 Difference]: Without dead ends: 115 [2018-12-02 15:59:57,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:59:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-02 15:59:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-12-02 15:59:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 15:59:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-12-02 15:59:57,557 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 23 [2018-12-02 15:59:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:57,557 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-12-02 15:59:57,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:59:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-12-02 15:59:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 15:59:57,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:57,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:57,558 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 15:59:57,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:57,559 INFO L82 PathProgramCache]: Analyzing trace with hash -581993423, now seen corresponding path program 1 times [2018-12-02 15:59:57,559 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:59:57,559 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:59:57,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:57,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:59:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:57,635 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 15:59:57,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:59:57,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:59:57,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:59:57,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:59:57,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:59:57,638 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 5 states. [2018-12-02 15:59:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:59:57,666 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-12-02 15:59:57,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:59:57,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-02 15:59:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:59:57,667 INFO L225 Difference]: With dead ends: 115 [2018-12-02 15:59:57,667 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 15:59:57,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:59:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 15:59:57,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-12-02 15:59:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 15:59:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-12-02 15:59:57,670 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 26 [2018-12-02 15:59:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:59:57,670 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-12-02 15:59:57,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:59:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-12-02 15:59:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 15:59:57,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:59:57,671 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:59:57,671 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 15:59:57,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:59:57,671 INFO L82 PathProgramCache]: Analyzing trace with hash 336148239, now seen corresponding path program 1 times [2018-12-02 15:59:57,672 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:59:57,672 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:59:57,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:57,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:59:57,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:59:57,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:57,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:59:57,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 15:59:58,223 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-02 15:59:58,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 15:59:58,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:59:58,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:59:58,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-02 15:59:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-02 15:59:58,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:59:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 4 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:59:58,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:59:58,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:59:58,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:59:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:59:58,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:00:00,422 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 16:00:00,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:00:00,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:00:00,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 16:00:00,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:00,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:00:00,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-12-02 16:00:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-12-02 16:00:00,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:00:00,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 16:00:00,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 11 [2018-12-02 16:00:00,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 16:00:00,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 16:00:00,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=8, NotChecked=38, Total=156 [2018-12-02 16:00:00,514 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 12 states. [2018-12-02 16:00:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:00:03,723 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2018-12-02 16:00:03,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 16:00:03,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-12-02 16:00:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:00:03,724 INFO L225 Difference]: With dead ends: 153 [2018-12-02 16:00:03,724 INFO L226 Difference]: Without dead ends: 153 [2018-12-02 16:00:03,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=73, Invalid=264, Unknown=13, NotChecked=70, Total=420 [2018-12-02 16:00:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-02 16:00:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 110. [2018-12-02 16:00:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-02 16:00:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-12-02 16:00:03,728 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 38 [2018-12-02 16:00:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:00:03,729 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-12-02 16:00:03,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 16:00:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-12-02 16:00:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 16:00:03,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:00:03,729 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:00:03,729 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:00:03,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:00:03,730 INFO L82 PathProgramCache]: Analyzing trace with hash 336148240, now seen corresponding path program 1 times [2018-12-02 16:00:03,730 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:00:03,730 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:00:03,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:00:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:00:03,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:00:03,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:00:03,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:03,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:00:03,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:03,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:00:03,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 16:00:04,968 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))))) is different from true [2018-12-02 16:00:04,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:00:04,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:00:04,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 16:00:04,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:04,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 16:00:04,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:04,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:00:04,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-02 16:00:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-02 16:00:05,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:00:05,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 16:00:05,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 16:00:05,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:00:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:00:05,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:00:05,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:00:05,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:05,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:00:05,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 16:00:05,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:00:05,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 16:00:05,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:05,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:00:05,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:00:05,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 16:00:05,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:05,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:00:05,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-02 16:00:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-02 16:00:05,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:00:05,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 16:00:05,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-12-02 16:00:05,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 16:00:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 16:00:05,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2018-12-02 16:00:05,391 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 11 states. [2018-12-02 16:00:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:00:06,561 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-12-02 16:00:06,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 16:00:06,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-12-02 16:00:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:00:06,563 INFO L225 Difference]: With dead ends: 127 [2018-12-02 16:00:06,563 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 16:00:06,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=65, Invalid=244, Unknown=1, NotChecked=32, Total=342 [2018-12-02 16:00:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 16:00:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2018-12-02 16:00:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 16:00:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-12-02 16:00:06,566 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 38 [2018-12-02 16:00:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:00:06,566 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-12-02 16:00:06,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 16:00:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-12-02 16:00:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 16:00:06,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:00:06,567 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:00:06,567 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:00:06,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:00:06,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1161634868, now seen corresponding path program 1 times [2018-12-02 16:00:06,567 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:00:06,567 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:00:06,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:00:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:00:06,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:00:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:00:06,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:00:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:00:06,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 16:00:06,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 16:00:06,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:00:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:00:06,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:00:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:00:06,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:00:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:00:07,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 16:00:07,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7] total 16 [2018-12-02 16:00:07,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 16:00:07,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 16:00:07,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-02 16:00:07,111 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 16 states. [2018-12-02 16:00:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:00:07,267 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2018-12-02 16:00:07,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 16:00:07,268 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-02 16:00:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:00:07,269 INFO L225 Difference]: With dead ends: 121 [2018-12-02 16:00:07,269 INFO L226 Difference]: Without dead ends: 118 [2018-12-02 16:00:07,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-12-02 16:00:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-02 16:00:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2018-12-02 16:00:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 16:00:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-12-02 16:00:07,278 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 41 [2018-12-02 16:00:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:00:07,278 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-12-02 16:00:07,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 16:00:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-12-02 16:00:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 16:00:07,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:00:07,280 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:00:07,280 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:00:07,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:00:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1651051823, now seen corresponding path program 2 times [2018-12-02 16:00:07,281 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:00:07,281 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:00:07,302 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 16:00:07,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 16:00:07,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 16:00:07,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:00:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 16:00:07,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:00:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 16:00:07,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 16:00:07,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 16:00:07,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 16:00:07,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 16:00:07,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 16:00:07,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:00:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 16:00:07,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:00:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 16:00:07,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 16:00:07,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7] total 7 [2018-12-02 16:00:07,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 16:00:07,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 16:00:07,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 16:00:07,707 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 7 states. [2018-12-02 16:00:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:00:07,912 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-12-02 16:00:07,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 16:00:07,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-12-02 16:00:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:00:07,913 INFO L225 Difference]: With dead ends: 111 [2018-12-02 16:00:07,913 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 16:00:07,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 16:00:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 16:00:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-02 16:00:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 16:00:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-12-02 16:00:07,916 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 56 [2018-12-02 16:00:07,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:00:07,916 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-12-02 16:00:07,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 16:00:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-12-02 16:00:07,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 16:00:07,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:00:07,917 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:00:07,917 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:00:07,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:00:07,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2112094387, now seen corresponding path program 1 times [2018-12-02 16:00:07,917 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:00:07,917 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:00:07,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 16:00:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:00:08,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:00:08,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:00:08,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:08,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:00:08,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 16:00:10,220 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 16:00:12,236 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-02 16:00:15,299 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) is different from true [2018-12-02 16:00:19,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:00:19,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:00:19,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-02 16:00:19,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-02 16:00:19,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:19,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:00:19,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 16:00:19,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-02 16:00:19,916 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) is different from true [2018-12-02 16:00:19,923 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-02 16:00:19,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:19,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 16:00:19,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-12-02 16:00:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 8 times theorem prover too weak. 3 trivial. 19 not checked. [2018-12-02 16:00:19,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:00:28,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 16:00:28,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 16:00:28,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:00:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:00:28,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:00:28,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:00:28,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:28,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:00:28,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 16:00:46,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:00:46,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:00:46,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-02 16:00:46,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-02 16:00:46,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:46,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:00:46,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 16:00:46,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-12-02 16:00:46,139 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-02 16:00:46,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:00:46,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 16:00:46,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2018-12-02 16:00:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 20 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 16:00:46,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:00:58,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 16:00:58,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 14 [2018-12-02 16:00:58,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 16:00:58,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 16:00:58,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=198, Unknown=28, NotChecked=96, Total=380 [2018-12-02 16:00:58,310 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 15 states. [2018-12-02 16:01:16,836 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-12-02 16:01:28,030 WARN L180 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-12-02 16:01:47,588 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1)) |c_#valid|))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1)))))) is different from true [2018-12-02 16:02:23,587 WARN L180 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2018-12-02 16:02:26,846 WARN L180 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 18 [2018-12-02 16:05:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:05:33,789 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2018-12-02 16:05:33,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 16:05:33,789 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-12-02 16:05:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:05:33,790 INFO L225 Difference]: With dead ends: 192 [2018-12-02 16:05:33,790 INFO L226 Difference]: Without dead ends: 192 [2018-12-02 16:05:33,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 114 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 68.3s TimeCoverageRelationStatistics Valid=121, Invalid=403, Unknown=44, NotChecked=188, Total=756 [2018-12-02 16:05:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-02 16:05:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 140. [2018-12-02 16:05:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-02 16:05:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-12-02 16:05:33,794 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 57 [2018-12-02 16:05:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:05:33,794 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-12-02 16:05:33,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 16:05:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-12-02 16:05:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 16:05:33,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:05:33,795 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:05:33,795 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:05:33,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:05:33,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2112094386, now seen corresponding path program 1 times [2018-12-02 16:05:33,796 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:05:33,796 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:05:33,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:05:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:05:34,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:05:34,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-02 16:05:34,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:05:34,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:05:34,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:05:34,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:05:34,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 16:05:34,804 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)) (= |c_#length| (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32))))) is different from true [2018-12-02 16:05:36,378 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) |c_dll_create_#t~ret3.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32)) |c_dll_create_#t~ret3.base| (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-02 16:05:38,382 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32)) dll_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-02 16:05:38,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:38,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:38,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:38,434 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-02 16:05:38,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:05:38,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:38,457 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-02 16:05:38,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-02 16:05:38,460 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 16:05:38,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:05:38,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 16:05:38,485 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-12-02 16:05:39,360 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32)))) is different from true [2018-12-02 16:05:39,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:39,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:39,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:39,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 37 [2018-12-02 16:05:39,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 16:05:39,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 16:05:39,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:60 [2018-12-02 16:05:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 23 not checked. [2018-12-02 16:05:39,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:05:39,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 16:05:39,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 16:05:39,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:05:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:05:39,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:05:39,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:05:39,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:05:39,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:05:39,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:05:39,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:05:39,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 16:05:40,937 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 16:05:41,729 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#length| (store |c_old(#length)| |node_create_#t~malloc2.base| (_ bv12 32))))) is different from true [2018-12-02 16:05:42,957 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_8 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_8 (_ bv1 1)) |node_create_#t~malloc2.base|)) (= |c_#length| (store (store |c_old(#length)| v_prenex_8 (_ bv12 32)) |node_create_#t~malloc2.base| (_ bv12 32))) (= (select |c_old(#valid)| v_prenex_8) (_ bv0 1)))) is different from true [2018-12-02 16:05:42,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:42,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:43,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:43,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-02 16:05:43,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:05:43,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:43,022 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-02 16:05:43,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-02 16:05:43,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 16:05:43,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:05:43,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 16:05:43,047 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-12-02 16:05:57,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:57,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:57,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:05:57,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-02 16:05:57,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 16:05:57,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-12-02 16:05:57,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:90 [2018-12-02 16:05:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 30 not checked. [2018-12-02 16:05:57,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:05:57,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 16:05:57,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 24 [2018-12-02 16:05:57,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 16:05:57,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 16:05:57,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=323, Unknown=14, NotChecked=294, Total=702 [2018-12-02 16:05:57,665 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand 25 states. [2018-12-02 16:06:04,442 WARN L180 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-12-02 16:06:09,272 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_8 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_8 (_ bv1 1)) |node_create_#t~malloc2.base|)) (= |c_#length| (store (store |c_old(#length)| v_prenex_8 (_ bv12 32)) |node_create_#t~malloc2.base| (_ bv12 32))) (= (select |c_old(#valid)| v_prenex_8) (_ bv0 1)))) (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= (select (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) |c_dll_create_#t~ret3.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32)) |c_dll_create_#t~ret3.base| (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base))))) is different from true [2018-12-02 16:06:10,785 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_8 (_ BitVec 32)) (|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| v_prenex_8 (_ bv1 1)) |node_create_#t~malloc2.base|)) (= |c_#length| (store (store |c_old(#length)| v_prenex_8 (_ bv12 32)) |node_create_#t~malloc2.base| (_ bv12 32))) (= (select |c_old(#valid)| v_prenex_8) (_ bv0 1)))) (exists ((dll_create_~new_head~0.base (_ BitVec 32)) (dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| dll_create_~head~0.base (_ bv12 32)) dll_create_~new_head~0.base (_ bv12 32))) (= (_ bv0 1) (select (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base))))) is different from true [2018-12-02 16:06:21,259 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 53 [2018-12-02 16:06:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:06:53,358 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2018-12-02 16:06:53,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 16:06:53,359 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-12-02 16:06:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:06:53,360 INFO L225 Difference]: With dead ends: 160 [2018-12-02 16:06:53,360 INFO L226 Difference]: Without dead ends: 160 [2018-12-02 16:06:53,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=121, Invalid=547, Unknown=18, NotChecked=504, Total=1190 [2018-12-02 16:06:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-02 16:06:53,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2018-12-02 16:06:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-02 16:06:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-12-02 16:06:53,363 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 57 [2018-12-02 16:06:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:06:53,364 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-12-02 16:06:53,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 16:06:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-12-02 16:06:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 16:06:53,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:06:53,364 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:06:53,365 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:06:53,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:06:53,365 INFO L82 PathProgramCache]: Analyzing trace with hash 175456403, now seen corresponding path program 1 times [2018-12-02 16:06:53,365 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:06:53,365 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:06:53,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:06:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:06:53,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:06:53,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:06:53,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:06:53,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:06:53,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 16:06:55,230 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 16:06:57,248 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-02 16:06:59,135 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) is different from true [2018-12-02 16:07:00,397 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_create_~new_head~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 16:07:02,405 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_create_~head~0.base (_ bv1 1))))) is different from true [2018-12-02 16:07:03,283 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#res.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 16:07:03,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:03,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:03,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-02 16:07:03,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-02 16:07:03,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:07:03,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:07:03,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:03,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2018-12-02 16:07:06,049 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 16:07:06,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:06,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:06,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:06,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:06,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 53 [2018-12-02 16:07:06,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:07:06,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-12-02 16:07:06,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:07:06,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:06,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:07:06,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:06,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:06,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:06,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:07:06,187 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 16:07:06,203 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:07:06,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:07:06,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:07:06,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:06,273 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:65, output treesize:68 [2018-12-02 16:07:06,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-02 16:07:06,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:06,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 16:07:06,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:07:06,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-02 16:07:06,368 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 16:07:06,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:07:06,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:06,387 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:74, output treesize:41 [2018-12-02 16:07:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 2 refuted. 3 times theorem prover too weak. 1 trivial. 21 not checked. [2018-12-02 16:07:06,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:07:06,738 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:06,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:06,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:06,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-12-02 16:07:16,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 16:07:16,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 16:07:16,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:07:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:07:16,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:07:16,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:07:16,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:07:16,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:07:16,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 16:07:17,611 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-02 16:07:19,559 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)) (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) is different from true [2018-12-02 16:07:20,678 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) c_dll_create_~new_head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) is different from true [2018-12-02 16:07:21,595 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_1 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_subst_1)) (= |c_#valid| (store (store |c_old(#valid)| v_subst_1 (_ bv1 1)) c_dll_create_~head~0.base (_ bv1 1))))) is different from true [2018-12-02 16:07:23,599 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_1 (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| v_subst_1 (_ bv1 1)) |c_dll_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| v_subst_1)))) is different from true [2018-12-02 16:07:23,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:23,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:23,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-02 16:07:23,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-02 16:07:23,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:07:23,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:07:23,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:23,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-02 16:07:25,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:25,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:25,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:25,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:25,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 53 [2018-12-02 16:07:25,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:07:25,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-12-02 16:07:26,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:07:26,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:26,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:07:26,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:26,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:26,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:26,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:07:26,025 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 16:07:26,044 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:07:26,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:07:26,079 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:07:26,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:26,121 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:62, output treesize:64 [2018-12-02 16:07:26,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-02 16:07:26,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-02 16:07:26,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:07:26,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:07:26,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 16:07:26,258 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 16:07:26,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:07:26,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:26,278 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:73, output treesize:40 [2018-12-02 16:07:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2018-12-02 16:07:26,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:07:26,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:26,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:26,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 16:07:26,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-12-02 16:07:34,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 16:07:34,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 38 [2018-12-02 16:07:34,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-02 16:07:34,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-02 16:07:34,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=891, Unknown=21, NotChecked=770, Total=1806 [2018-12-02 16:07:34,954 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 39 states. [2018-12-02 16:07:50,155 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-12-02 16:07:54,536 WARN L180 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-02 16:07:59,242 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)) (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1))))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#t~ret3.base| (_ bv1 1)))))) is different from true [2018-12-02 16:08:01,249 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| dll_create_~head~0.base (_ bv1 1)) c_dll_create_~new_head~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| dll_create_~head~0.base)))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_create_~new_head~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-02 16:08:03,258 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) c_dll_create_~head~0.base (_ bv1 1))))) (exists ((v_subst_1 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_subst_1)) (= |c_#valid| (store (store |c_old(#valid)| v_subst_1 (_ bv1 1)) c_dll_create_~head~0.base (_ bv1 1)))))) is different from true [2018-12-02 16:08:05,266 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_subst_1 (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| v_subst_1 (_ bv1 1)) |c_dll_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| v_subst_1)))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_dll_create_#res.base| (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-02 16:08:05,753 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-02 16:08:07,361 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-02 16:08:12,407 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-12-02 16:08:12,669 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-12-02 16:08:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:08:50,964 INFO L93 Difference]: Finished difference Result 189 states and 206 transitions. [2018-12-02 16:08:50,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 16:08:50,965 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-12-02 16:08:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:08:50,966 INFO L225 Difference]: With dead ends: 189 [2018-12-02 16:08:50,966 INFO L226 Difference]: Without dead ends: 189 [2018-12-02 16:08:50,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 64.8s TimeCoverageRelationStatistics Valid=213, Invalid=1459, Unknown=28, NotChecked=1380, Total=3080 [2018-12-02 16:08:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-02 16:08:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 141. [2018-12-02 16:08:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-02 16:08:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2018-12-02 16:08:50,969 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 61 [2018-12-02 16:08:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:08:50,969 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2018-12-02 16:08:50,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-02 16:08:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2018-12-02 16:08:50,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 16:08:50,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:08:50,969 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:08:50,970 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:08:50,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:08:50,970 INFO L82 PathProgramCache]: Analyzing trace with hash 175456404, now seen corresponding path program 1 times [2018-12-02 16:08:50,970 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:08:50,970 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:08:50,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:08:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:08:51,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:08:51,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:08:51,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:08:51,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:08:51,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 16:08:53,309 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-12-02 16:08:53,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:08:53,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:08:53,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:08:53,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-02 16:08:55,365 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 16:08:57,392 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 16:08:59,420 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 16:09:01,450 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 16:09:01,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:01,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:01,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-02 16:09:01,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-02 16:09:01,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:01,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:01,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:01,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2018-12-02 16:09:04,069 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32))) (.cse1 (bvadd node_create_~temp~0.offset (_ bv8 32)))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv12 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base))))) is different from true [2018-12-02 16:09:04,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-02 16:09:04,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-02 16:09:04,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-12-02 16:09:04,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:09:04,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:09:04,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:09:04,446 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,467 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,481 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-02 16:09:04,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:09:04,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:09:04,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:09:04,611 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,626 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,636 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:04,694 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:108, output treesize:75 [2018-12-02 16:09:04,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-02 16:09:04,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 16:09:04,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 16:09:04,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-02 16:09:04,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:04,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 16:09:04,863 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-02 16:09:04,874 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,879 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:04,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:04,889 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:88, output treesize:22 [2018-12-02 16:09:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 25 not checked. [2018-12-02 16:09:05,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:09:06,263 WARN L180 SmtUtils]: Spent 821.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 16:09:06,442 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 16:09:06,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:06,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:07,563 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:07,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:09,573 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:09,604 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:10,390 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:10,416 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:10,792 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:10,811 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:11,090 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:11,109 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:11,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-12-02 16:09:11,276 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:220, output treesize:154 [2018-12-02 16:09:17,991 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-12-02 16:09:17,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 16:09:17,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 16:09:18,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:09:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:09:18,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:09:18,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:09:18,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:18,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:18,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 16:09:18,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:09:18,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:18,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:18,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-02 16:09:26,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-02 16:09:26,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-02 16:09:26,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:26,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:26,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:26,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-02 16:09:27,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 16:09:27,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-12-02 16:09:27,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-12-02 16:09:27,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:09:27,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:09:27,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:09:27,528 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,549 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,563 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-02 16:09:27,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:09:27,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:09:27,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:09:27,678 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,691 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,699 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,713 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:27,746 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:94, output treesize:70 [2018-12-02 16:09:27,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-02 16:09:27,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 16:09:27,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:27,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 16:09:27,988 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:27,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:28,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-02 16:09:28,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:09:28,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 16:09:28,040 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:28,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-02 16:09:28,065 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:28,071 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:28,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:28,082 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:86, output treesize:20 [2018-12-02 16:09:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-02 16:09:28,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:09:28,778 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 16:09:28,972 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 16:09:29,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:29,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:31,240 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:31,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:32,323 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:32,345 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:32,865 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:32,895 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:33,307 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:33,335 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:09:33,523 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 16:09:33,541 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:09:33,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-12-02 16:09:33,739 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:220, output treesize:154 [2018-12-02 16:09:37,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 16:09:37,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 38 [2018-12-02 16:09:37,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-02 16:09:37,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-02 16:09:37,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1530, Unknown=8, NotChecked=158, Total=1806 [2018-12-02 16:09:37,353 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand 39 states. [2018-12-02 16:09:52,010 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 16:10:00,650 WARN L180 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-12-02 16:10:02,215 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-12-02 16:10:03,784 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-12-02 16:10:08,175 WARN L180 SmtUtils]: Spent 3.74 s on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2018-12-02 16:10:12,147 WARN L180 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-12-02 16:10:14,558 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-12-02 16:10:18,534 WARN L180 SmtUtils]: Spent 3.17 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-02 16:10:24,624 WARN L180 SmtUtils]: Spent 5.87 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-02 16:10:25,329 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-02 16:10:26,920 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-12-02 16:10:33,935 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-12-02 16:10:34,647 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-12-02 16:10:34,993 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-12-02 16:10:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:10:40,292 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2018-12-02 16:10:40,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 16:10:40,293 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-12-02 16:10:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:10:40,294 INFO L225 Difference]: With dead ends: 167 [2018-12-02 16:10:40,294 INFO L226 Difference]: Without dead ends: 167 [2018-12-02 16:10:40,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 79.7s TimeCoverageRelationStatistics Valid=253, Invalid=3165, Unknown=12, NotChecked=230, Total=3660 [2018-12-02 16:10:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-02 16:10:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2018-12-02 16:10:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-02 16:10:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2018-12-02 16:10:40,298 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 61 [2018-12-02 16:10:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:10:40,298 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2018-12-02 16:10:40,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-02 16:10:40,298 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2018-12-02 16:10:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 16:10:40,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:10:40,299 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:10:40,299 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:10:40,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:10:40,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1139442047, now seen corresponding path program 1 times [2018-12-02 16:10:40,300 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:10:40,300 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:10:40,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:10:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:40,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:10:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-02 16:10:40,505 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 16:10:40,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 16:10:40,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 16:10:40,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 16:10:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 16:10:40,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 16:10:40,508 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand 6 states. [2018-12-02 16:10:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:10:40,920 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2018-12-02 16:10:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 16:10:40,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-02 16:10:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:10:40,921 INFO L225 Difference]: With dead ends: 142 [2018-12-02 16:10:40,921 INFO L226 Difference]: Without dead ends: 142 [2018-12-02 16:10:40,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 16:10:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-02 16:10:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-02 16:10:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-02 16:10:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2018-12-02 16:10:40,923 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 62 [2018-12-02 16:10:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:10:40,923 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2018-12-02 16:10:40,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 16:10:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2018-12-02 16:10:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 16:10:40,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:10:40,924 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:10:40,924 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:10:40,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:10:40,924 INFO L82 PathProgramCache]: Analyzing trace with hash -212855009, now seen corresponding path program 1 times [2018-12-02 16:10:40,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:10:40,924 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:10:40,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:10:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:41,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:10:41,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:10:41,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:41,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:41,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 16:10:41,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 16:10:41,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 16:10:41,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:41,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:41,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:41,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2018-12-02 16:10:41,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 16:10:41,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 16:10:41,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:41,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:41,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:41,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-02 16:10:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 16:10:41,213 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 16:10:41,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 16:10:41,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 16:10:41,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 16:10:41,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 16:10:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 16:10:41,216 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand 12 states. [2018-12-02 16:10:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:10:42,279 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2018-12-02 16:10:42,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 16:10:42,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-12-02 16:10:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:10:42,281 INFO L225 Difference]: With dead ends: 169 [2018-12-02 16:10:42,281 INFO L226 Difference]: Without dead ends: 169 [2018-12-02 16:10:42,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-02 16:10:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-02 16:10:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2018-12-02 16:10:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-02 16:10:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2018-12-02 16:10:42,285 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 64 [2018-12-02 16:10:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:10:42,286 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2018-12-02 16:10:42,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 16:10:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2018-12-02 16:10:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 16:10:42,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:10:42,287 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:10:42,287 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:10:42,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:10:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash -212855008, now seen corresponding path program 1 times [2018-12-02 16:10:42,287 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:10:42,287 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:10:42,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:10:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:42,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:10:42,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:10:42,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 16:10:42,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 16:10:42,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 16:10:42,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 16:10:42,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 16:10:42,584 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-02 16:10:42,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 16:10:42,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 16:10:42,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 16:10:42,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 16:10:42,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:42,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-02 16:10:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 16:10:42,686 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 16:10:42,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 16:10:42,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 16:10:42,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 16:10:42,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 16:10:42,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 16:10:42,689 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand 12 states. [2018-12-02 16:10:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:10:43,845 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2018-12-02 16:10:43,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 16:10:43,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-12-02 16:10:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:10:43,846 INFO L225 Difference]: With dead ends: 179 [2018-12-02 16:10:43,846 INFO L226 Difference]: Without dead ends: 179 [2018-12-02 16:10:43,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-02 16:10:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-02 16:10:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 153. [2018-12-02 16:10:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-02 16:10:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2018-12-02 16:10:43,850 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 64 [2018-12-02 16:10:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:10:43,850 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2018-12-02 16:10:43,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 16:10:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2018-12-02 16:10:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 16:10:43,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:10:43,851 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:10:43,851 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:10:43,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:10:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1445458633, now seen corresponding path program 1 times [2018-12-02 16:10:43,852 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:10:43,852 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:10:43,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:10:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:44,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:10:44,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:10:44,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:44,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:44,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 16:10:44,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 16:10:44,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 16:10:44,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:44,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:44,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:44,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-12-02 16:10:44,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:44,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-12-02 16:10:44,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 16:10:44,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:44,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:44,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:44,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:59 [2018-12-02 16:10:44,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:44,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:44,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:44,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2018-12-02 16:10:44,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 48 [2018-12-02 16:10:44,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:44,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:44,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:44,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:60 [2018-12-02 16:10:48,250 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32))) (.cse1 (bvadd node_create_~temp~0.offset (_ bv8 32)))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)) (= (store |c_old(#valid)| node_create_~temp~0.base (_ bv1 1)) |c_#valid|)))) is different from true [2018-12-02 16:10:48,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:48,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:48,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:48,287 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 16:10:48,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 123 [2018-12-02 16:10:48,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:48,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-02 16:10:48,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:10:48,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:48,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:10:48,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:48,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:48,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:48,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:10:48,556 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:48,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:48,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:48,624 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:48,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 117 [2018-12-02 16:10:48,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:10:48,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:48,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:10:48,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:48,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:48,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:48,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:10:48,815 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:48,836 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:48,850 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:48,892 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:48,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:48,960 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:157, output treesize:162 [2018-12-02 16:10:49,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-02 16:10:49,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:49,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 16:10:49,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:49,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 16:10:49,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:49,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:10:49,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:49,302 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:175, output treesize:146 [2018-12-02 16:10:49,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 85 [2018-12-02 16:10:49,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-02 16:10:49,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:49,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:10:49,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 16:10:49,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:49,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-12-02 16:10:49,691 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:49,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-12-02 16:10:49,713 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 16:10:49,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:49,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:49,747 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:147, output treesize:49 [2018-12-02 16:10:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-02 16:10:50,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:10:51,247 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-02 16:10:51,400 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-02 16:10:51,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:51,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:51,535 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:51,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:51,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 16:10:51,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:85 [2018-12-02 16:11:23,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 16:11:23,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/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-02 16:11:23,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:11:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:23,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:11:23,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:11:23,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:23,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:23,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 16:11:24,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 16:11:24,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 16:11:24,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:24,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:24,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:24,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:30 [2018-12-02 16:11:24,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:24,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 72 [2018-12-02 16:11:24,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 16:11:24,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:24,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:24,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:11:24,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:48 [2018-12-02 16:11:25,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:25,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:25,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-12-02 16:11:25,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-12-02 16:11:25,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:25,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:25,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:11:25,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:54 [2018-12-02 16:11:30,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 87 [2018-12-02 16:11:30,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:30,529 INFO L303 Elim1Store]: Index analysis took 119 ms [2018-12-02 16:11:30,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 108 [2018-12-02 16:11:30,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:11:30,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:11:30,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:11:30,579 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:30,605 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:30,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:30,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:30,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-02 16:11:30,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:11:30,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:11:30,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:30,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:11:30,843 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:30,867 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:30,883 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:30,902 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:30,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 16:11:30,968 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:141, output treesize:145 [2018-12-02 16:11:33,281 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 59 [2018-12-02 16:11:33,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-02 16:11:33,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 16:11:33,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:33,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:33,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 16:11:33,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:33,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:11:33,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 16:11:33,421 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:161, output treesize:132 [2018-12-02 16:11:34,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 86 [2018-12-02 16:11:34,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 62 [2018-12-02 16:11:34,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:34,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 64 [2018-12-02 16:11:34,543 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:34,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:34,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-12-02 16:11:34,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:34,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-12-02 16:11:34,710 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-02 16:11:34,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-12-02 16:11:34,794 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:34,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:11:34,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-12-02 16:11:34,869 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 16:11:34,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2018-12-02 16:11:34,925 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:11:34,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 16:11:34,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-02 16:11:34,996 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:133, output treesize:91 [2018-12-02 16:11:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-02 16:11:38,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:11:42,722 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-02 16:11:42,882 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-02 16:11:42,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:11:42,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:11:43,040 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:11:43,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:11:43,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 16:11:43,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:111 [2018-12-02 16:11:45,100 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_36 (_ BitVec 32)) (v_node_create_~temp~0.offset_120 (_ BitVec 32)) (v_DerPreprocessor_34 (_ BitVec 32)) (v_node_create_~temp~0.base_130 (_ BitVec 32))) (let ((.cse2 (bvadd v_node_create_~temp~0.offset_120 (_ bv4 32))) (.cse3 (bvadd v_node_create_~temp~0.offset_120 (_ bv8 32)))) (let ((.cse0 (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_node_create_~temp~0.base_130 (store (store (store (select |c_#memory_$Pointer$.offset| v_node_create_~temp~0.base_130) .cse2 (_ bv0 32)) .cse3 (_ bv0 32)) v_node_create_~temp~0.offset_120 v_DerPreprocessor_34)) c_dll_append_~head.base) c_dll_append_~head.offset) (_ bv4 32)))) (or (not (bvsle (_ bv0 32) .cse0)) (= (_ bv1 1) (select (store |c_#valid| v_node_create_~temp~0.base_130 (_ bv1 1)) (select (let ((.cse1 (store |c_#memory_$Pointer$.base| v_node_create_~temp~0.base_130 (store (store (store (select |c_#memory_$Pointer$.base| v_node_create_~temp~0.base_130) .cse2 (_ bv0 32)) .cse3 (_ bv0 32)) v_node_create_~temp~0.offset_120 v_DerPreprocessor_36)))) (select .cse1 (select (select .cse1 c_dll_append_~head.base) c_dll_append_~head.offset))) .cse0))) (not (= (_ bv0 1) (select |c_#valid| v_node_create_~temp~0.base_130))))))) is different from false [2018-12-02 16:11:45,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 16:11:45,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 51 [2018-12-02 16:11:45,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-02 16:11:45,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-02 16:11:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3333, Unknown=18, NotChecked=234, Total=3782 [2018-12-02 16:11:45,124 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand 52 states. [2018-12-02 16:12:00,361 WARN L180 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-02 16:12:05,091 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-12-02 16:12:08,308 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2018-12-02 16:12:11,320 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-12-02 16:12:12,801 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-02 16:12:14,216 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-02 16:12:14,856 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-02 16:12:16,846 WARN L180 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2018-12-02 16:12:17,725 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-12-02 16:12:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 16:12:20,720 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2018-12-02 16:12:20,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 16:12:20,722 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 65 [2018-12-02 16:12:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 16:12:20,722 INFO L225 Difference]: With dead ends: 173 [2018-12-02 16:12:20,722 INFO L226 Difference]: Without dead ends: 173 [2018-12-02 16:12:20,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 79.2s TimeCoverageRelationStatistics Valid=362, Invalid=5323, Unknown=23, NotChecked=298, Total=6006 [2018-12-02 16:12:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-02 16:12:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 155. [2018-12-02 16:12:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-02 16:12:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2018-12-02 16:12:20,727 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 65 [2018-12-02 16:12:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 16:12:20,727 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2018-12-02 16:12:20,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-02 16:12:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2018-12-02 16:12:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 16:12:20,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 16:12:20,727 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 16:12:20,728 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_appendErr10REQUIRES_VIOLATION, dll_appendErr11REQUIRES_VIOLATION, dll_appendErr0REQUIRES_VIOLATION, dll_appendErr1REQUIRES_VIOLATION, dll_appendErr12REQUIRES_VIOLATION, dll_appendErr8REQUIRES_VIOLATION, dll_appendErr9REQUIRES_VIOLATION, dll_appendErr5REQUIRES_VIOLATION, dll_appendErr6REQUIRES_VIOLATION, dll_appendErr7REQUIRES_VIOLATION, dll_appendErr13REQUIRES_VIOLATION, dll_appendErr2REQUIRES_VIOLATION, dll_appendErr3REQUIRES_VIOLATION, dll_appendErr4REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION]=== [2018-12-02 16:12:20,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:12:20,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1445458634, now seen corresponding path program 1 times [2018-12-02 16:12:20,728 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 16:12:20,728 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e46590d3-0e8e-48f4-a5ae-e9f98dff9260/bin-2019/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:12:20,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 16:12:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:21,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 16:12:21,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:12:21,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 16:12:21,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 16:12:21,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-02 16:12:21,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:21,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 16:12:21,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:41 [2018-12-02 16:12:21,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 16:12:21,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 16:12:21,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 16:12:21,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 16:12:21,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2018-12-02 16:12:21,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:21,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 113 [2018-12-02 16:12:21,682 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 14 treesize of output 13 [2018-12-02 16:12:21,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:21,752 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-02 16:12:21,755 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 14 treesize of output 13 [2018-12-02 16:12:21,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:21,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:126, output treesize:95 [2018-12-02 16:12:22,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:22,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:22,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:22,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 60 [2018-12-02 16:12:22,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 54 [2018-12-02 16:12:22,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:22,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:22,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:22,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:105, output treesize:104 [2018-12-02 16:12:25,535 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (let ((.cse0 (bvadd node_create_~temp~0.offset (_ bv4 32))) (.cse1 (bvadd node_create_~temp~0.offset (_ bv8 32)))) (and (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv12 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (= (store |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| node_create_~temp~0.base) .cse0 (_ bv0 32)) .cse1 (_ bv0 32)) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base))))) is different from true [2018-12-02 16:12:25,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:25,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:25,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 86 [2018-12-02 16:12:25,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:25,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:25,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:25,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:25,800 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 16:12:25,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 79 [2018-12-02 16:12:25,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:26,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 199 [2018-12-02 16:12:26,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:12:26,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:26,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:12:26,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:26,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:26,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:26,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:12:26,127 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:26,151 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:26,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:26,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:26,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 186 [2018-12-02 16:12:26,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 16:12:26,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:26,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 16:12:26,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:26,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:26,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:26,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-02 16:12:26,446 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:26,467 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:26,482 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:26,526 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:26,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:26,598 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:257, output treesize:229 [2018-12-02 16:12:27,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 174 [2018-12-02 16:12:27,248 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 7 treesize of output 1 [2018-12-02 16:12:27,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:27,306 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 19 treesize of output 3 [2018-12-02 16:12:27,306 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:27,345 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 115 treesize of output 86 [2018-12-02 16:12:27,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:27,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:27,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 16:12:27,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:27,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 16:12:27,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 86 [2018-12-02 16:12:27,513 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 7 treesize of output 1 [2018-12-02 16:12:27,513 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:27,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 16:12:27,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 16:12:27,563 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:27,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-12-02 16:12:27,587 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:27,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-12-02 16:12:27,609 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 16:12:27,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:27,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:27,647 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:262, output treesize:37 [2018-12-02 16:12:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-02 16:12:27,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 16:12:29,765 WARN L180 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 16:12:29,952 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 16:12:30,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:30,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:32,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:32,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:34,111 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:34,181 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:35,218 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:35,260 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:35,762 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:35,802 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:36,254 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:36,288 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 16:12:36,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-12-02 16:12:36,556 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:270, output treesize:384 [2018-12-02 16:12:45,593 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-02 16:12:45,794 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 16:12:45,795 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:893) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-02 16:12:45,800 INFO L168 Benchmark]: Toolchain (without parser) took 770800.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 938.0 MB in the beginning and 866.5 MB in the end (delta: 71.5 MB). Peak memory consumption was 272.3 MB. Max. memory is 11.5 GB. [2018-12-02 16:12:45,801 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 16:12:45,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -222.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-12-02 16:12:45,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 16:12:45,802 INFO L168 Benchmark]: Boogie Preprocessor took 30.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 16:12:45,802 INFO L168 Benchmark]: RCFGBuilder took 425.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2018-12-02 16:12:45,802 INFO L168 Benchmark]: TraceAbstraction took 770008.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.4 MB). Free memory was 1.1 GB in the beginning and 866.5 MB in the end (delta: 242.6 MB). Peak memory consumption was 263.1 MB. Max. memory is 11.5 GB. [2018-12-02 16:12:45,804 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.15 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 313.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -222.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 425.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 770008.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.4 MB). Free memory was 1.1 GB in the beginning and 866.5 MB in the end (delta: 242.6 MB). Peak memory consumption was 263.1 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...