./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.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_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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 927b64548732fdfa523149393b95aeee194275ea ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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 927b64548732fdfa523149393b95aeee194275ea .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 06:40:01,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 06:40:01,061 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 06:40:01,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 06:40:01,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 06:40:01,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 06:40:01,070 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 06:40:01,071 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 06:40:01,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 06:40:01,073 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 06:40:01,074 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 06:40:01,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 06:40:01,074 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 06:40:01,075 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 06:40:01,076 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 06:40:01,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 06:40:01,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 06:40:01,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 06:40:01,080 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 06:40:01,081 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 06:40:01,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 06:40:01,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 06:40:01,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 06:40:01,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 06:40:01,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 06:40:01,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 06:40:01,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 06:40:01,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 06:40:01,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 06:40:01,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 06:40:01,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 06:40:01,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 06:40:01,088 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 06:40:01,088 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 06:40:01,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 06:40:01,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 06:40:01,089 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 06:40:01,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 06:40:01,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 06:40:01,100 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 06:40:01,100 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 06:40:01,100 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 06:40:01,100 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 06:40:01,100 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 06:40:01,100 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 06:40:01,100 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 06:40:01,100 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 06:40:01,101 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 06:40:01,101 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 06:40:01,101 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 06:40:01,101 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 06:40:01,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 06:40:01,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 06:40:01,102 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 06:40:01,102 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 06:40:01,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 06:40:01,102 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 06:40:01,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 06:40:01,102 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 06:40:01,102 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 06:40:01,102 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 06:40:01,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 06:40:01,103 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 06:40:01,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 06:40:01,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 06:40:01,103 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 06:40:01,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 06:40:01,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:40:01,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 06:40:01,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 06:40:01,103 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 06:40:01,103 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 06:40:01,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 06:40:01,104 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_84154aeb-0f49-4add-9341-04020146a675/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 -> 927b64548732fdfa523149393b95aeee194275ea [2018-12-03 06:40:01,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 06:40:01,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 06:40:01,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 06:40:01,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 06:40:01,139 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 06:40:01,140 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-12-03 06:40:01,180 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/data/43d9ac143/63a1fed2958a492ab9d1e2ba144ae7ed/FLAG512f9a803 [2018-12-03 06:40:01,533 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 06:40:01,533 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-12-03 06:40:01,540 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/data/43d9ac143/63a1fed2958a492ab9d1e2ba144ae7ed/FLAG512f9a803 [2018-12-03 06:40:01,928 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/data/43d9ac143/63a1fed2958a492ab9d1e2ba144ae7ed [2018-12-03 06:40:01,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 06:40:01,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 06:40:01,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 06:40:01,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 06:40:01,935 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 06:40:01,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:40:01" (1/1) ... [2018-12-03 06:40:01,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245fecd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:01, skipping insertion in model container [2018-12-03 06:40:01,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:40:01" (1/1) ... [2018-12-03 06:40:01,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 06:40:01,972 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 06:40:02,205 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:40:02,215 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 06:40:02,252 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:40:02,285 INFO L195 MainTranslator]: Completed translation [2018-12-03 06:40:02,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02 WrapperNode [2018-12-03 06:40:02,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 06:40:02,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 06:40:02,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 06:40:02,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 06:40:02,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02" (1/1) ... [2018-12-03 06:40:02,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02" (1/1) ... [2018-12-03 06:40:02,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 06:40:02,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 06:40:02,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 06:40:02,309 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 06:40:02,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02" (1/1) ... [2018-12-03 06:40:02,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02" (1/1) ... [2018-12-03 06:40:02,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02" (1/1) ... [2018-12-03 06:40:02,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02" (1/1) ... [2018-12-03 06:40:02,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02" (1/1) ... [2018-12-03 06:40:02,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02" (1/1) ... [2018-12-03 06:40:02,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02" (1/1) ... [2018-12-03 06:40:02,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 06:40:02,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 06:40:02,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 06:40:02,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 06:40:02,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:40:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2018-12-03 06:40:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-12-03 06:40:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure f19 [2018-12-03 06:40:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure f19 [2018-12-03 06:40:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 06:40:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-12-03 06:40:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-12-03 06:40:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-03 06:40:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-03 06:40:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2018-12-03 06:40:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2018-12-03 06:40:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 06:40:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 06:40:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 06:40:02,358 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 06:40:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 06:40:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 06:40:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 06:40:02,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 06:40:02,359 INFO L130 BoogieDeclarations]: Found specification of procedure g19 [2018-12-03 06:40:02,359 INFO L138 BoogieDeclarations]: Found implementation of procedure g19 [2018-12-03 06:40:02,359 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-03 06:40:02,359 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-03 06:40:02,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 06:40:02,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 06:40:02,554 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 06:40:02,554 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 06:40:02,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:40:02 BoogieIcfgContainer [2018-12-03 06:40:02,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 06:40:02,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 06:40:02,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 06:40:02,557 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 06:40:02,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:40:01" (1/3) ... [2018-12-03 06:40:02,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cdf6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:40:02, skipping insertion in model container [2018-12-03 06:40:02,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:02" (2/3) ... [2018-12-03 06:40:02,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cdf6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:40:02, skipping insertion in model container [2018-12-03 06:40:02,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:40:02" (3/3) ... [2018-12-03 06:40:02,559 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2018-12-03 06:40:02,565 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 06:40:02,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-03 06:40:02,579 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-03 06:40:02,595 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 06:40:02,595 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 06:40:02,595 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 06:40:02,595 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 06:40:02,595 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 06:40:02,595 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 06:40:02,595 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 06:40:02,595 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 06:40:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-12-03 06:40:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 06:40:02,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:02,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:40:02,613 INFO L423 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION]=== [2018-12-03 06:40:02,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:02,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1662008609, now seen corresponding path program 1 times [2018-12-03 06:40:02,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:40:02,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:02,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:02,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:02,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:40:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:02,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:02,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:40:02,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:40:02,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:40:02,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:40:02,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:40:02,808 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 7 states. [2018-12-03 06:40:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:03,101 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-12-03 06:40:03,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 06:40:03,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 06:40:03,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:03,114 INFO L225 Difference]: With dead ends: 149 [2018-12-03 06:40:03,114 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 06:40:03,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:40:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 06:40:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 82. [2018-12-03 06:40:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 06:40:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-12-03 06:40:03,156 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 15 [2018-12-03 06:40:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:03,156 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-12-03 06:40:03,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:40:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-12-03 06:40:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 06:40:03,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:03,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:40:03,158 INFO L423 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION]=== [2018-12-03 06:40:03,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:03,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1662008608, now seen corresponding path program 1 times [2018-12-03 06:40:03,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:40:03,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:03,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:03,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:03,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:40:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:03,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:03,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:40:03,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:40:03,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:40:03,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:40:03,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:40:03,259 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 8 states. [2018-12-03 06:40:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:03,621 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2018-12-03 06:40:03,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 06:40:03,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-03 06:40:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:03,623 INFO L225 Difference]: With dead ends: 145 [2018-12-03 06:40:03,623 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 06:40:03,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-03 06:40:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 06:40:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 79. [2018-12-03 06:40:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 06:40:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-12-03 06:40:03,633 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 15 [2018-12-03 06:40:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:03,633 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-12-03 06:40:03,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:40:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-12-03 06:40:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 06:40:03,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:03,634 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:40:03,634 INFO L423 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION]=== [2018-12-03 06:40:03,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2103640479, now seen corresponding path program 1 times [2018-12-03 06:40:03,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:40:03,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:03,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:03,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:03,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:40:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:03,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:03,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:40:03,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:40:03,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:40:03,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:40:03,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:40:03,717 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 7 states. [2018-12-03 06:40:03,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:03,895 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2018-12-03 06:40:03,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 06:40:03,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 06:40:03,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:03,897 INFO L225 Difference]: With dead ends: 126 [2018-12-03 06:40:03,897 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 06:40:03,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:40:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 06:40:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 77. [2018-12-03 06:40:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 06:40:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-03 06:40:03,902 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 26 [2018-12-03 06:40:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:03,903 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-03 06:40:03,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:40:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-03 06:40:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 06:40:03,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:03,904 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:40:03,904 INFO L423 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION]=== [2018-12-03 06:40:03,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:03,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2103640480, now seen corresponding path program 1 times [2018-12-03 06:40:03,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:40:03,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:03,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:03,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:03,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:40:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:04,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:04,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 06:40:04,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:40:04,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 06:40:04,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 06:40:04,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 06:40:04,047 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 11 states. [2018-12-03 06:40:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:04,446 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2018-12-03 06:40:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 06:40:04,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-12-03 06:40:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:04,447 INFO L225 Difference]: With dead ends: 136 [2018-12-03 06:40:04,447 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 06:40:04,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-12-03 06:40:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 06:40:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 75. [2018-12-03 06:40:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 06:40:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-12-03 06:40:04,452 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 26 [2018-12-03 06:40:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:04,452 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-03 06:40:04,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 06:40:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-12-03 06:40:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 06:40:04,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:04,453 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-03 06:40:04,453 INFO L423 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION]=== [2018-12-03 06:40:04,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:04,453 INFO L82 PathProgramCache]: Analyzing trace with hash 652817527, now seen corresponding path program 1 times [2018-12-03 06:40:04,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:40:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:40:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:04,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:04,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:40:04,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:40:04,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:40:04,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:40:04,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:40:04,482 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-12-03 06:40:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:04,508 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-12-03 06:40:04,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:40:04,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-03 06:40:04,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:04,509 INFO L225 Difference]: With dead ends: 82 [2018-12-03 06:40:04,509 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 06:40:04,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:40:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 06:40:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-12-03 06:40:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 06:40:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-12-03 06:40:04,513 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 26 [2018-12-03 06:40:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:04,513 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-12-03 06:40:04,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:40:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-12-03 06:40:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 06:40:04,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:04,513 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-03 06:40:04,513 INFO L423 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION]=== [2018-12-03 06:40:04,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:04,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2134597960, now seen corresponding path program 1 times [2018-12-03 06:40:04,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:40:04,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:04,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:40:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:04,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:04,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:40:04,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:40:04,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:40:04,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:40:04,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:40:04,566 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 8 states. [2018-12-03 06:40:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:04,648 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-12-03 06:40:04,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:40:04,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-03 06:40:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:04,649 INFO L225 Difference]: With dead ends: 95 [2018-12-03 06:40:04,649 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 06:40:04,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:40:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 06:40:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2018-12-03 06:40:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 06:40:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-12-03 06:40:04,653 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 26 [2018-12-03 06:40:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:04,653 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-12-03 06:40:04,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:40:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-12-03 06:40:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 06:40:04,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:04,654 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-03 06:40:04,654 INFO L423 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION]=== [2018-12-03 06:40:04,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:04,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2134597959, now seen corresponding path program 1 times [2018-12-03 06:40:04,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:40:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:40:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:04,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:04,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:40:04,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:40:04,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:40:04,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:40:04,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:40:04,683 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 6 states. [2018-12-03 06:40:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:04,707 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-12-03 06:40:04,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:40:04,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-03 06:40:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:04,708 INFO L225 Difference]: With dead ends: 89 [2018-12-03 06:40:04,708 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 06:40:04,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:40:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 06:40:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-12-03 06:40:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 06:40:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-12-03 06:40:04,712 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 26 [2018-12-03 06:40:04,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:04,712 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-12-03 06:40:04,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:40:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-12-03 06:40:04,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 06:40:04,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:04,713 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, 1] [2018-12-03 06:40:04,713 INFO L423 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION]=== [2018-12-03 06:40:04,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1745812588, now seen corresponding path program 1 times [2018-12-03 06:40:04,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:40:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:40:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:04,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:04,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:40:04,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:40:04,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:40:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:40:04,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:40:04,744 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 4 states. [2018-12-03 06:40:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:04,828 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-12-03 06:40:04,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:40:04,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-03 06:40:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:04,829 INFO L225 Difference]: With dead ends: 113 [2018-12-03 06:40:04,829 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 06:40:04,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:40:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 06:40:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-12-03 06:40:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 06:40:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-12-03 06:40:04,833 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 27 [2018-12-03 06:40:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:04,833 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-12-03 06:40:04,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:40:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-12-03 06:40:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 06:40:04,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:04,834 INFO L402 BasicCegarLoop]: trace histogram [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-03 06:40:04,834 INFO L423 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION]=== [2018-12-03 06:40:04,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:04,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1468017423, now seen corresponding path program 1 times [2018-12-03 06:40:04,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:40:04,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:04,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:40:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:40:04,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:04,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:40:04,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:40:04,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:40:04,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:40:04,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:40:04,859 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 5 states. [2018-12-03 06:40:04,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:04,876 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-12-03 06:40:04,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:40:04,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-03 06:40:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:04,877 INFO L225 Difference]: With dead ends: 112 [2018-12-03 06:40:04,877 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 06:40:04,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:40:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 06:40:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-12-03 06:40:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 06:40:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2018-12-03 06:40:04,880 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 35 [2018-12-03 06:40:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:04,881 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2018-12-03 06:40:04,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:40:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2018-12-03 06:40:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 06:40:04,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:04,881 INFO L402 BasicCegarLoop]: trace histogram [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-03 06:40:04,882 INFO L423 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION]=== [2018-12-03 06:40:04,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:04,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1939446192, now seen corresponding path program 1 times [2018-12-03 06:40:04,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:40:04,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:04,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:40:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:40:04,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:04,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:40:04,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:40:04,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:40:04,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:40:04,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:40:04,907 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 6 states. [2018-12-03 06:40:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:04,935 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-12-03 06:40:04,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:40:04,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-12-03 06:40:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:04,936 INFO L225 Difference]: With dead ends: 103 [2018-12-03 06:40:04,936 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 06:40:04,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:40:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 06:40:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 06:40:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 06:40:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-12-03 06:40:04,939 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 35 [2018-12-03 06:40:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:04,939 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-12-03 06:40:04,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:40:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-12-03 06:40:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 06:40:04,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:04,940 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-03 06:40:04,940 INFO L423 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION]=== [2018-12-03 06:40:04,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2062118097, now seen corresponding path program 1 times [2018-12-03 06:40:04,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:40:04,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:04,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:40:04,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:40:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:40:05,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:40:05,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:40:05,106 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-12-03 06:40:05,107 INFO L205 CegarAbsIntRunner]: [10], [12], [15], [16], [23], [25], [28], [40], [43], [64], [66], [69], [70], [76], [77], [78], [81], [82], [83], [84], [85], [89], [103], [104], [105], [106], [111], [113], [114], [115], [116], [117], [119] [2018-12-03 06:40:05,127 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 06:40:05,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 06:40:05,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 06:40:05,235 INFO L272 AbstractInterpreter]: Visited 33 different actions 41 times. Merged at 2 different actions 4 times. Never widened. Performed 324 root evaluator evaluations with a maximum evaluation depth of 3. Performed 324 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-12-03 06:40:05,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:05,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 06:40:05,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:40:05,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:40:05,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:05,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:40:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:05,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:05,340 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-03 06:40:05,342 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-03 06:40:05,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:05,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:05,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:05,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-03 06:40:05,797 WARN L854 $PredicateComparison]: unable to prove that (exists ((f19_~a.offset Int)) (= (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) f19_~a.offset 0)) |c_#memory_$Pointer$.offset|)) is different from true [2018-12-03 06:40:05,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 06:40:05,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17 [2018-12-03 06:40:05,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:05,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:05,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:40:05,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-12-03 06:40:05,823 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-03 06:40:05,824 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 3 [2018-12-03 06:40:05,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:05,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:05,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:05,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-03 06:40:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:40:05,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:40:05,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-12-03 06:40:06,155 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:40:06,157 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:223) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 06:40:06,162 INFO L168 Benchmark]: Toolchain (without parser) took 4231.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 947.0 MB in the beginning and 864.4 MB in the end (delta: 82.6 MB). Peak memory consumption was 285.5 MB. Max. memory is 11.5 GB. [2018-12-03 06:40:06,164 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:40:06,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-03 06:40:06,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:40:06,167 INFO L168 Benchmark]: Boogie Preprocessor took 16.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:40:06,167 INFO L168 Benchmark]: RCFGBuilder took 228.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-03 06:40:06,168 INFO L168 Benchmark]: TraceAbstraction took 3606.40 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 864.4 MB in the end (delta: 187.0 MB). Peak memory consumption was 273.5 MB. Max. memory is 11.5 GB. [2018-12-03 06:40:06,174 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 228.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3606.40 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 864.4 MB in the end (delta: 187.0 MB). Peak memory consumption was 273.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 06:40:07,479 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 06:40:07,480 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 06:40:07,486 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 06:40:07,486 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 06:40:07,487 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 06:40:07,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 06:40:07,488 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 06:40:07,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 06:40:07,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 06:40:07,490 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 06:40:07,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 06:40:07,490 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 06:40:07,491 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 06:40:07,491 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 06:40:07,491 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 06:40:07,492 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 06:40:07,493 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 06:40:07,494 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 06:40:07,494 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 06:40:07,495 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 06:40:07,495 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 06:40:07,496 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 06:40:07,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 06:40:07,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 06:40:07,497 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 06:40:07,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 06:40:07,498 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 06:40:07,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 06:40:07,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 06:40:07,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 06:40:07,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 06:40:07,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 06:40:07,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 06:40:07,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 06:40:07,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 06:40:07,501 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-03 06:40:07,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 06:40:07,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 06:40:07,509 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 06:40:07,509 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 06:40:07,509 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 06:40:07,509 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 06:40:07,509 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 06:40:07,509 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 06:40:07,509 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 06:40:07,509 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 06:40:07,510 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 06:40:07,510 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 06:40:07,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 06:40:07,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 06:40:07,510 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 06:40:07,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 06:40:07,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 06:40:07,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 06:40:07,510 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 06:40:07,510 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 06:40:07,510 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 06:40:07,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 06:40:07,511 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 06:40:07,511 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 06:40:07,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 06:40:07,511 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 06:40:07,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 06:40:07,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 06:40:07,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 06:40:07,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 06:40:07,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:40:07,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 06:40:07,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 06:40:07,512 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 06:40:07,512 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 06:40:07,512 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 06:40:07,512 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_84154aeb-0f49-4add-9341-04020146a675/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 -> 927b64548732fdfa523149393b95aeee194275ea [2018-12-03 06:40:07,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 06:40:07,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 06:40:07,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 06:40:07,539 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 06:40:07,540 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 06:40:07,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-12-03 06:40:07,574 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/data/a1751e2d6/eaa1f5b4cdb84b8e8f6a0a6b2f2158f2/FLAGaf8401182 [2018-12-03 06:40:07,999 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 06:40:08,000 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/sv-benchmarks/c/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-12-03 06:40:08,007 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/data/a1751e2d6/eaa1f5b4cdb84b8e8f6a0a6b2f2158f2/FLAGaf8401182 [2018-12-03 06:40:08,016 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/data/a1751e2d6/eaa1f5b4cdb84b8e8f6a0a6b2f2158f2 [2018-12-03 06:40:08,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 06:40:08,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 06:40:08,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 06:40:08,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 06:40:08,021 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 06:40:08,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:40:08" (1/1) ... [2018-12-03 06:40:08,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4096dacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08, skipping insertion in model container [2018-12-03 06:40:08,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:40:08" (1/1) ... [2018-12-03 06:40:08,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 06:40:08,049 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 06:40:08,261 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:40:08,306 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 06:40:08,343 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:40:08,383 INFO L195 MainTranslator]: Completed translation [2018-12-03 06:40:08,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08 WrapperNode [2018-12-03 06:40:08,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 06:40:08,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 06:40:08,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 06:40:08,384 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 06:40:08,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08" (1/1) ... [2018-12-03 06:40:08,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08" (1/1) ... [2018-12-03 06:40:08,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 06:40:08,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 06:40:08,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 06:40:08,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 06:40:08,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08" (1/1) ... [2018-12-03 06:40:08,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08" (1/1) ... [2018-12-03 06:40:08,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08" (1/1) ... [2018-12-03 06:40:08,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08" (1/1) ... [2018-12-03 06:40:08,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08" (1/1) ... [2018-12-03 06:40:08,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08" (1/1) ... [2018-12-03 06:40:08,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08" (1/1) ... [2018-12-03 06:40:08,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 06:40:08,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 06:40:08,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 06:40:08,425 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 06:40:08,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:40:08,458 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2018-12-03 06:40:08,458 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-12-03 06:40:08,458 INFO L130 BoogieDeclarations]: Found specification of procedure f19 [2018-12-03 06:40:08,458 INFO L138 BoogieDeclarations]: Found implementation of procedure f19 [2018-12-03 06:40:08,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 06:40:08,458 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-12-03 06:40:08,458 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-12-03 06:40:08,458 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-03 06:40:08,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-03 06:40:08,459 INFO L130 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2018-12-03 06:40:08,459 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2018-12-03 06:40:08,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 06:40:08,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 06:40:08,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 06:40:08,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 06:40:08,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 06:40:08,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 06:40:08,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 06:40:08,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 06:40:08,460 INFO L130 BoogieDeclarations]: Found specification of procedure g19 [2018-12-03 06:40:08,460 INFO L138 BoogieDeclarations]: Found implementation of procedure g19 [2018-12-03 06:40:08,460 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-03 06:40:08,460 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-03 06:40:08,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 06:40:08,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 06:40:08,704 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 06:40:08,705 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 06:40:08,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:40:08 BoogieIcfgContainer [2018-12-03 06:40:08,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 06:40:08,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 06:40:08,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 06:40:08,707 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 06:40:08,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:40:08" (1/3) ... [2018-12-03 06:40:08,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7aa5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:40:08, skipping insertion in model container [2018-12-03 06:40:08,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:40:08" (2/3) ... [2018-12-03 06:40:08,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7aa5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:40:08, skipping insertion in model container [2018-12-03 06:40:08,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:40:08" (3/3) ... [2018-12-03 06:40:08,709 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2018-12-03 06:40:08,715 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 06:40:08,720 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-03 06:40:08,728 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-03 06:40:08,742 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 06:40:08,743 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 06:40:08,743 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 06:40:08,743 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 06:40:08,743 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 06:40:08,743 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 06:40:08,743 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 06:40:08,743 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 06:40:08,743 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 06:40:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-12-03 06:40:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 06:40:08,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:08,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:40:08,759 INFO L423 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:08,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:08,762 INFO L82 PathProgramCache]: Analyzing trace with hash -471155968, now seen corresponding path program 1 times [2018-12-03 06:40:08,765 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:08,765 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:40:08,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:08,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:08,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:40:08,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:08,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:08,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 06:40:09,294 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|)) is different from true [2018-12-03 06:40:09,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 06:40:09,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:09,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:40:09,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-03 06:40:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:09,318 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:40:09,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:09,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:40:09,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:40:09,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:40:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-12-03 06:40:09,333 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 7 states. [2018-12-03 06:40:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:09,720 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2018-12-03 06:40:09,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:40:09,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 06:40:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:09,728 INFO L225 Difference]: With dead ends: 130 [2018-12-03 06:40:09,728 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 06:40:09,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2018-12-03 06:40:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 06:40:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-12-03 06:40:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 06:40:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2018-12-03 06:40:09,758 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 15 [2018-12-03 06:40:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:09,759 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2018-12-03 06:40:09,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:40:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2018-12-03 06:40:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 06:40:09,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:09,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:40:09,760 INFO L423 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:09,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:09,760 INFO L82 PathProgramCache]: Analyzing trace with hash -471155967, now seen corresponding path program 1 times [2018-12-03 06:40:09,761 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:09,761 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:40:09,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:09,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:09,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:40:09,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:09,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:40:09,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:09,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:09,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 06:40:10,716 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-03 06:40:10,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:10,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:10,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 06:40:10,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:10,744 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-03 06:40:10,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:10,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:10,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2018-12-03 06:40:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:10,765 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:40:10,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:10,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:40:10,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:40:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:40:10,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2018-12-03 06:40:10,768 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand 8 states. [2018-12-03 06:40:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:11,266 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2018-12-03 06:40:11,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:40:11,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-03 06:40:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:11,268 INFO L225 Difference]: With dead ends: 130 [2018-12-03 06:40:11,268 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 06:40:11,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2018-12-03 06:40:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 06:40:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2018-12-03 06:40:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 06:40:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2018-12-03 06:40:11,276 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 15 [2018-12-03 06:40:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:11,276 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2018-12-03 06:40:11,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:40:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2018-12-03 06:40:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 06:40:11,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:11,277 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:40:11,278 INFO L423 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:11,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1840810590, now seen corresponding path program 1 times [2018-12-03 06:40:11,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:11,279 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:40:11,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:11,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:11,714 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|)) is different from true [2018-12-03 06:40:11,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 06:40:11,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:11,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:40:11,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-03 06:40:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:11,731 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:40:11,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:11,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:40:11,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:40:11,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:40:11,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-12-03 06:40:11,733 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 7 states. [2018-12-03 06:40:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:11,995 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-12-03 06:40:11,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:40:11,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 06:40:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:11,996 INFO L225 Difference]: With dead ends: 114 [2018-12-03 06:40:11,996 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 06:40:11,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2018-12-03 06:40:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 06:40:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2018-12-03 06:40:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 06:40:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2018-12-03 06:40:12,001 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 26 [2018-12-03 06:40:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:12,002 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2018-12-03 06:40:12,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:40:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2018-12-03 06:40:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 06:40:12,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:12,002 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:40:12,003 INFO L423 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:12,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:12,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1840810591, now seen corresponding path program 1 times [2018-12-03 06:40:12,003 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:12,003 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:40:12,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:12,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:12,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:40:12,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:12,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:40:12,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:12,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:12,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 06:40:13,213 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-03 06:40:13,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:13,223 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-03 06:40:13,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:13,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:13,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:13,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 06:40:13,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:13,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:13,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-12-03 06:40:13,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:13,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 06:40:13,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:13,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:13,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:13,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 06:40:13,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:13,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:13,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-12-03 06:40:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:40:13,353 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:40:13,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:13,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 06:40:13,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 06:40:13,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 06:40:13,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2018-12-03 06:40:13,356 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 11 states. [2018-12-03 06:40:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:13,983 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2018-12-03 06:40:13,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 06:40:13,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-12-03 06:40:13,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:13,984 INFO L225 Difference]: With dead ends: 122 [2018-12-03 06:40:13,984 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 06:40:13,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2018-12-03 06:40:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 06:40:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2018-12-03 06:40:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 06:40:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2018-12-03 06:40:13,989 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 26 [2018-12-03 06:40:13,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:13,989 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2018-12-03 06:40:13,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 06:40:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2018-12-03 06:40:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 06:40:13,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:13,990 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-03 06:40:13,990 INFO L423 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:13,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:13,991 INFO L82 PathProgramCache]: Analyzing trace with hash 389987670, now seen corresponding path program 1 times [2018-12-03 06:40:13,991 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:13,991 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:40:14,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:14,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:14,047 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:40:14,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:14,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:40:14,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:40:14,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:40:14,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:40:14,049 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 6 states. [2018-12-03 06:40:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:14,069 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2018-12-03 06:40:14,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:40:14,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-03 06:40:14,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:14,070 INFO L225 Difference]: With dead ends: 97 [2018-12-03 06:40:14,070 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 06:40:14,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:40:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 06:40:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-12-03 06:40:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 06:40:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2018-12-03 06:40:14,074 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 26 [2018-12-03 06:40:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:14,075 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2018-12-03 06:40:14,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:40:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2018-12-03 06:40:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 06:40:14,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:14,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:40:14,076 INFO L423 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:14,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash -793070379, now seen corresponding path program 1 times [2018-12-03 06:40:14,076 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:14,076 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:40:14,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:14,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:14,144 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-03 06:40:14,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 06:40:14,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:14,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:14,156 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-03 06:40:14,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-12-03 06:40:14,168 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 20 treesize of output 16 [2018-12-03 06:40:14,171 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 16 treesize of output 4 [2018-12-03 06:40:14,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:14,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:14,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:14,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2018-12-03 06:40:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:14,182 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:40:14,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:14,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:40:14,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:40:14,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:40:14,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:40:14,184 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 6 states. [2018-12-03 06:40:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:14,265 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-12-03 06:40:14,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:40:14,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-03 06:40:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:14,267 INFO L225 Difference]: With dead ends: 99 [2018-12-03 06:40:14,267 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 06:40:14,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:40:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 06:40:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-03 06:40:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 06:40:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-12-03 06:40:14,271 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 27 [2018-12-03 06:40:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:14,271 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-12-03 06:40:14,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:40:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-12-03 06:40:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 06:40:14,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:14,272 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, 1] [2018-12-03 06:40:14,272 INFO L423 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:14,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1303604556, now seen corresponding path program 1 times [2018-12-03 06:40:14,273 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:14,273 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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-03 06:40:14,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:14,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:14,352 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 13 treesize of output 15 [2018-12-03 06:40:14,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:14,355 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 9 [2018-12-03 06:40:14,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:14,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:14,360 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-03 06:40:14,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:14,368 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 2 case distinctions, treesize of input 17 treesize of output 15 [2018-12-03 06:40:14,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 06:40:14,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:40:14,382 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 2 xjuncts. [2018-12-03 06:40:14,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-03 06:40:15,109 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_entry_point_~#a19~0.base_8| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v_entry_point_~#a19~0.base_8| (_ bv0 1))) (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_8|) (_ bv0 1)))) is different from true [2018-12-03 06:40:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:15,131 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:40:15,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:15,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:40:15,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:40:15,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:40:15,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=26, Unknown=1, NotChecked=10, Total=56 [2018-12-03 06:40:15,134 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 8 states. [2018-12-03 06:40:24,729 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-03 06:40:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:32,939 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2018-12-03 06:40:32,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:40:32,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-03 06:40:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:32,941 INFO L225 Difference]: With dead ends: 135 [2018-12-03 06:40:32,941 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 06:40:32,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2018-12-03 06:40:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 06:40:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2018-12-03 06:40:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 06:40:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2018-12-03 06:40:32,946 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 27 [2018-12-03 06:40:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:32,947 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2018-12-03 06:40:32,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:40:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2018-12-03 06:40:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 06:40:32,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:32,948 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 06:40:32,948 INFO L423 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:32,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:32,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1391359420, now seen corresponding path program 1 times [2018-12-03 06:40:32,949 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:32,949 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:40:32,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:32,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:40:33,006 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:40:33,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:33,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:40:33,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:40:33,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:40:33,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:40:33,008 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand 5 states. [2018-12-03 06:40:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:33,018 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-12-03 06:40:33,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:40:33,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-03 06:40:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:33,019 INFO L225 Difference]: With dead ends: 122 [2018-12-03 06:40:33,019 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 06:40:33,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:40:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 06:40:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2018-12-03 06:40:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 06:40:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2018-12-03 06:40:33,023 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 34 [2018-12-03 06:40:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:33,023 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2018-12-03 06:40:33,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:40:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2018-12-03 06:40:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 06:40:33,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:33,024 INFO L402 BasicCegarLoop]: trace histogram [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-03 06:40:33,024 INFO L423 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:33,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:33,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1630214244, now seen corresponding path program 1 times [2018-12-03 06:40:33,025 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:33,025 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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-03 06:40:33,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:33,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:33,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:40:33,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:33,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:33,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-03 06:40:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:40:33,105 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:40:33,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:33,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:40:33,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:40:33,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:40:33,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:40:33,108 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand 5 states. [2018-12-03 06:40:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:33,206 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2018-12-03 06:40:33,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:40:33,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-03 06:40:33,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:33,207 INFO L225 Difference]: With dead ends: 116 [2018-12-03 06:40:33,207 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 06:40:33,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:40:33,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 06:40:33,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2018-12-03 06:40:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 06:40:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2018-12-03 06:40:33,210 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 34 [2018-12-03 06:40:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:33,210 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2018-12-03 06:40:33,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:40:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2018-12-03 06:40:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 06:40:33,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:33,211 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 06:40:33,211 INFO L423 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:33,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1419988572, now seen corresponding path program 1 times [2018-12-03 06:40:33,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:33,212 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:40:33,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:33,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:33,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:40:33,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:40:33,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:33,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:33,297 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-03 06:40:33,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-03 06:40:33,305 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 16 treesize of output 12 [2018-12-03 06:40:33,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, 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 4 [2018-12-03 06:40:33,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:33,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:33,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:33,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-12-03 06:40:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:40:33,315 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:40:33,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:40:33,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:40:33,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:40:33,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:40:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:40:33,317 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 6 states. [2018-12-03 06:40:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:33,385 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2018-12-03 06:40:33,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:40:33,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-03 06:40:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:33,386 INFO L225 Difference]: With dead ends: 108 [2018-12-03 06:40:33,386 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 06:40:33,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:40:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 06:40:33,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 06:40:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 06:40:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2018-12-03 06:40:33,389 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 34 [2018-12-03 06:40:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:33,389 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2018-12-03 06:40:33,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:40:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2018-12-03 06:40:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 06:40:33,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:33,389 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-03 06:40:33,390 INFO L423 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:33,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:33,390 INFO L82 PathProgramCache]: Analyzing trace with hash 776569745, now seen corresponding path program 1 times [2018-12-03 06:40:33,390 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:33,390 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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-03 06:40:33,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:33,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:33,501 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-03 06:40:33,503 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-03 06:40:33,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:33,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:33,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:33,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-03 06:40:34,883 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.offset| (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.offset|)))) is different from true [2018-12-03 06:40:34,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 06:40:34,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:34,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 06:40:34,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:34,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:34,911 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-03 06:40:34,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-03 06:40:34,914 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-03 06:40:34,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 06:40:34,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:34,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:34,917 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-03 06:40:34,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-03 06:40:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:40:34,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:40:35,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:40:35,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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-03 06:40:35,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:35,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:35,135 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-03 06:40:35,137 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-03 06:40:35,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:35,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:35,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:35,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-03 06:40:35,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 06:40:35,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:35,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 06:40:35,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:35,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:35,172 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-03 06:40:35,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-03 06:40:35,176 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-03 06:40:35,179 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 3 [2018-12-03 06:40:35,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:35,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:35,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:35,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-03 06:40:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:40:35,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:40:35,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 06:40:35,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2018-12-03 06:40:35,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 06:40:35,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 06:40:35,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2018-12-03 06:40:35,282 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 14 states. [2018-12-03 06:40:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:40:35,877 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2018-12-03 06:40:35,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 06:40:35,877 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-12-03 06:40:35,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:40:35,878 INFO L225 Difference]: With dead ends: 123 [2018-12-03 06:40:35,878 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 06:40:35,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=494, Unknown=1, NotChecked=46, Total=650 [2018-12-03 06:40:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 06:40:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2018-12-03 06:40:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 06:40:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2018-12-03 06:40:35,881 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 138 transitions. Word has length 35 [2018-12-03 06:40:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:40:35,881 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 138 transitions. [2018-12-03 06:40:35,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 06:40:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2018-12-03 06:40:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 06:40:35,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:40:35,882 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-12-03 06:40:35,882 INFO L423 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:40:35,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:40:35,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1696141606, now seen corresponding path program 1 times [2018-12-03 06:40:35,882 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:40:35,882 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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-03 06:40:35,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:35,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:35,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:40:35,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:35,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:35,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 06:40:36,003 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-03 06:40:36,005 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-03 06:40:36,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:36,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:36,014 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-03 06:40:36,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-03 06:40:41,160 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 06:40:41,168 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 25 treesize of output 20 [2018-12-03 06:40:41,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:41,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-03 06:40:41,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:41,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:41,188 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-03 06:40:41,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-12-03 06:40:41,200 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-03 06:40:41,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-03 06:40:41,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:41,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:41,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:40:41,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-03 06:40:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:41,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:40:43,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:40:43,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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-03 06:40:43,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:40:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:40:43,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:40:43,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:40:43,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:43,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:43,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 06:40:43,514 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-03 06:40:43,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 10 treesize of output 9 [2018-12-03 06:40:43,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:43,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:43,525 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-03 06:40:43,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-12-03 06:40:43,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 06:40:43,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:40:43,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-03 06:40:43,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:43,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:43,558 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-03 06:40:43,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2018-12-03 06:40:43,560 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 23 treesize of output 19 [2018-12-03 06:40:43,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 7 [2018-12-03 06:40:43,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:40:43,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:43,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:40:43,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2018-12-03 06:40:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:40:43,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:40:43,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 06:40:43,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 15 [2018-12-03 06:40:43,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 06:40:43,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 06:40:43,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=254, Unknown=4, NotChecked=0, Total=306 [2018-12-03 06:40:43,710 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. Second operand 16 states. [2018-12-03 06:41:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:41:49,367 INFO L93 Difference]: Finished difference Result 125 states and 150 transitions. [2018-12-03 06:41:49,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 06:41:49,367 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-12-03 06:41:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:41:49,368 INFO L225 Difference]: With dead ends: 125 [2018-12-03 06:41:49,368 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 06:41:49,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=111, Invalid=533, Unknown=6, NotChecked=0, Total=650 [2018-12-03 06:41:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 06:41:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 118. [2018-12-03 06:41:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 06:41:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2018-12-03 06:41:49,371 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 36 [2018-12-03 06:41:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:41:49,371 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2018-12-03 06:41:49,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 06:41:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2018-12-03 06:41:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 06:41:49,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:41:49,372 INFO L402 BasicCegarLoop]: trace histogram [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-03 06:41:49,372 INFO L423 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:41:49,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:41:49,372 INFO L82 PathProgramCache]: Analyzing trace with hash 521616347, now seen corresponding path program 1 times [2018-12-03 06:41:49,372 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:41:49,372 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:41:49,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:41:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:41:49,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:41:49,458 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-03 06:41:49,461 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-03 06:41:49,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,476 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-03 06:41:49,478 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-03 06:41:49,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-12-03 06:41:49,502 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-03 06:41:49,504 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 3 [2018-12-03 06:41:49,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,515 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-03 06:41:49,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-03 06:41:49,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,521 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-12-03 06:41:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:41:49,529 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:41:49,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:41:49,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:41:49,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:41:49,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:41:49,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:41:49,531 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand 6 states. [2018-12-03 06:41:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:41:49,626 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-12-03 06:41:49,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:41:49,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-12-03 06:41:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:41:49,628 INFO L225 Difference]: With dead ends: 104 [2018-12-03 06:41:49,628 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 06:41:49,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:41:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 06:41:49,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 06:41:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 06:41:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2018-12-03 06:41:49,631 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 36 [2018-12-03 06:41:49,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:41:49,631 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2018-12-03 06:41:49,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:41:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2018-12-03 06:41:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 06:41:49,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:41:49,632 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-12-03 06:41:49,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:41:49,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:41:49,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1399113306, now seen corresponding path program 1 times [2018-12-03 06:41:49,633 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:41:49,633 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:41:49,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:41:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:41:49,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:41:49,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:41:49,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:49,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-03 06:41:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:41:49,743 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:41:49,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:41:49,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:41:49,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:41:49,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:41:49,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:41:49,745 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 8 states. [2018-12-03 06:41:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:41:49,966 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2018-12-03 06:41:49,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 06:41:49,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-12-03 06:41:49,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:41:49,967 INFO L225 Difference]: With dead ends: 117 [2018-12-03 06:41:49,968 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 06:41:49,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-03 06:41:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 06:41:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-12-03 06:41:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 06:41:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-12-03 06:41:49,970 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 41 [2018-12-03 06:41:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:41:49,970 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-12-03 06:41:49,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:41:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-12-03 06:41:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 06:41:49,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:41:49,971 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-12-03 06:41:49,971 INFO L423 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:41:49,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:41:49,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1399113307, now seen corresponding path program 1 times [2018-12-03 06:41:49,971 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:41:49,971 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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-03 06:41:49,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:41:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:41:50,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:41:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:41:50,193 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:41:50,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:41:50,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 06:41:50,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 06:41:50,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 06:41:50,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 06:41:50,196 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 11 states. [2018-12-03 06:41:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:41:50,789 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-12-03 06:41:50,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 06:41:50,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-12-03 06:41:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:41:50,791 INFO L225 Difference]: With dead ends: 108 [2018-12-03 06:41:50,791 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 06:41:50,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-12-03 06:41:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 06:41:50,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-12-03 06:41:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 06:41:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-12-03 06:41:50,794 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 41 [2018-12-03 06:41:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:41:50,794 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-12-03 06:41:50,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 06:41:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-12-03 06:41:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 06:41:50,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:41:50,794 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-12-03 06:41:50,795 INFO L423 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:41:50,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:41:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash 422839548, now seen corresponding path program 1 times [2018-12-03 06:41:50,795 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:41:50,795 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:41:50,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:41:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:41:50,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:41:50,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:41:50,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:41:50,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:50,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:50,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:50,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-03 06:41:51,020 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-03 06:41:51,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 06:41:51,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:51,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:51,023 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-03 06:41:51,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-03 06:41:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:41:51,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:41:51,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:41:51,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 06:41:51,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 06:41:51,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 06:41:51,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-03 06:41:51,038 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 14 states. [2018-12-03 06:41:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:41:51,544 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2018-12-03 06:41:51,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 06:41:51,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-12-03 06:41:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:41:51,545 INFO L225 Difference]: With dead ends: 107 [2018-12-03 06:41:51,545 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 06:41:51,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-12-03 06:41:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 06:41:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-03 06:41:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 06:41:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-03 06:41:51,547 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 42 [2018-12-03 06:41:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:41:51,547 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-03 06:41:51,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 06:41:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-03 06:41:51,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 06:41:51,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:41:51,548 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:41:51,548 INFO L423 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:41:51,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:41:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash 223124186, now seen corresponding path program 1 times [2018-12-03 06:41:51,548 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:41:51,548 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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-03 06:41:51,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:41:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:41:51,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:41:51,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:41:51,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:51,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:51,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-03 06:41:51,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:41:51,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:51,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:51,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 06:41:51,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:41:51,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:41:51,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:51,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:51,685 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-03 06:41:51,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-03 06:41:51,777 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-03 06:41:51,779 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-03 06:41:51,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:51,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:51,781 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-03 06:41:51,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-03 06:41:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:41:51,798 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:41:51,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:41:51,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 06:41:51,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 06:41:51,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 06:41:51,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-03 06:41:51,801 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 14 states. [2018-12-03 06:41:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:41:52,486 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2018-12-03 06:41:52,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 06:41:52,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-12-03 06:41:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:41:52,487 INFO L225 Difference]: With dead ends: 127 [2018-12-03 06:41:52,487 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 06:41:52,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-12-03 06:41:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 06:41:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2018-12-03 06:41:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 06:41:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-12-03 06:41:52,490 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 43 [2018-12-03 06:41:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:41:52,491 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-12-03 06:41:52,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 06:41:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-12-03 06:41:52,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 06:41:52,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:41:52,491 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:41:52,492 INFO L423 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:41:52,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:41:52,492 INFO L82 PathProgramCache]: Analyzing trace with hash 434475099, now seen corresponding path program 1 times [2018-12-03 06:41:52,492 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:41:52,492 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:41:52,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:41:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:41:52,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:41:52,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:41:52,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:41:52,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:52,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:52,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:52,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-03 06:41:52,693 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-03 06:41:52,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 06:41:52,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:52,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:52,696 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-03 06:41:52,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-03 06:41:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:41:52,708 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:41:52,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:41:52,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 06:41:52,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 06:41:52,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 06:41:52,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-03 06:41:52,711 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 14 states. [2018-12-03 06:41:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:41:53,178 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-12-03 06:41:53,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 06:41:53,179 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-12-03 06:41:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:41:53,180 INFO L225 Difference]: With dead ends: 152 [2018-12-03 06:41:53,180 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 06:41:53,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-12-03 06:41:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 06:41:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 115. [2018-12-03 06:41:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 06:41:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2018-12-03 06:41:53,185 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 43 [2018-12-03 06:41:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:41:53,186 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-12-03 06:41:53,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 06:41:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2018-12-03 06:41:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 06:41:53,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:41:53,187 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:41:53,187 INFO L423 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:41:53,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:41:53,188 INFO L82 PathProgramCache]: Analyzing trace with hash -803776262, now seen corresponding path program 1 times [2018-12-03 06:41:53,188 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:41:53,188 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:41:53,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:41:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:41:53,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:41:53,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:41:53,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:53,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:53,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-03 06:41:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:41:53,325 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:41:53,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:41:53,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 06:41:53,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 06:41:53,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 06:41:53,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:41:53,327 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 10 states. [2018-12-03 06:41:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:41:53,651 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2018-12-03 06:41:53,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 06:41:53,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-12-03 06:41:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:41:53,652 INFO L225 Difference]: With dead ends: 128 [2018-12-03 06:41:53,652 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 06:41:53,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-12-03 06:41:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 06:41:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-12-03 06:41:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 06:41:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-12-03 06:41:53,656 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 45 [2018-12-03 06:41:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:41:53,656 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-12-03 06:41:53,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 06:41:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-12-03 06:41:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 06:41:53,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:41:53,657 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:41:53,657 INFO L423 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:41:53,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:41:53,657 INFO L82 PathProgramCache]: Analyzing trace with hash -803776261, now seen corresponding path program 1 times [2018-12-03 06:41:53,657 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:41:53,657 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:41:53,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:41:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:41:53,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:41:53,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:41:53,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:53,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:41:53,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:41:53,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:41:53,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 06:41:55,298 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-03 06:41:58,480 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 06:42:00,732 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 06:42:02,785 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 06:42:02,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:42:02,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:42:02,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 06:42:02,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:42:02,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 06:42:02,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:26 [2018-12-03 06:42:04,865 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 06:42:04,871 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 9 treesize of output 12 [2018-12-03 06:42:04,893 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 06:42:04,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 06:42:04,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:42:04,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:42:04,941 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:42:04,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 06:42:04,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:26, output treesize:7 [2018-12-03 06:42:04,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:42:04,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:42:04,985 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 06:42:04,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:42:05,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-12-03 06:42:05,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 30 [2018-12-03 06:42:05,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 06:42:05,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:42:05,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:42:05,085 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:43, output treesize:11 [2018-12-03 06:42:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:42:05,167 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:42:05,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:42:05,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 06:42:05,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 06:42:05,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 06:42:05,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=152, Unknown=3, NotChecked=24, Total=210 [2018-12-03 06:42:05,170 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 15 states. [2018-12-03 06:42:13,730 WARN L180 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 06:42:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:42:27,579 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2018-12-03 06:42:27,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 06:42:27,579 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-12-03 06:42:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:42:27,580 INFO L225 Difference]: With dead ends: 135 [2018-12-03 06:42:27,580 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 06:42:27,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=50, Invalid=257, Unknown=3, NotChecked=32, Total=342 [2018-12-03 06:42:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 06:42:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 121. [2018-12-03 06:42:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 06:42:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-12-03 06:42:27,582 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 45 [2018-12-03 06:42:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:42:27,582 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-12-03 06:42:27,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 06:42:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-12-03 06:42:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 06:42:27,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:42:27,583 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:42:27,583 INFO L423 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:42:27,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:42:27,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1739113668, now seen corresponding path program 1 times [2018-12-03 06:42:27,583 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:42:27,583 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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-03 06:42:27,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:42:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:42:27,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:42:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:42:27,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:42:27,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:42:27,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:42:27,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:42:27,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:42:27,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:42:27,651 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 8 states. [2018-12-03 06:42:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:42:27,681 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-12-03 06:42:27,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:42:27,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-12-03 06:42:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:42:27,681 INFO L225 Difference]: With dead ends: 124 [2018-12-03 06:42:27,682 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 06:42:27,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:42:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 06:42:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-12-03 06:42:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 06:42:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-12-03 06:42:27,684 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 44 [2018-12-03 06:42:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:42:27,685 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-12-03 06:42:27,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:42:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-12-03 06:42:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 06:42:27,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:42:27,685 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:42:27,686 INFO L423 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:42:27,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:42:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1516661095, now seen corresponding path program 1 times [2018-12-03 06:42:27,686 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:42:27,686 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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-03 06:42:27,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:42:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:42:27,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:42:27,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:42:27,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:42:27,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:42:27,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:42:27,853 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-03 06:42:27,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-12-03 06:42:27,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:42:27,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:42:27,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-03 06:42:27,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:42:27,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:42:27,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-12-03 06:42:27,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:42:27,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:42:27,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:42:27,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:12 [2018-12-03 06:42:33,998 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 06:42:36,039 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 06:42:38,082 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 06:42:40,130 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 06:42:40,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:42:40,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 31 [2018-12-03 06:42:40,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:42:40,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2018-12-03 06:42:40,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-03 06:42:40,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:42:40,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-12-03 06:42:40,171 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:42:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-03 06:42:40,184 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 06:42:40,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 06:42:40,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 06:42:40,206 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:34, output treesize:25 [2018-12-03 06:42:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:42:40,245 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:42:40,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:42:40,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-03 06:42:40,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 06:42:40,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 06:42:40,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=295, Unknown=2, NotChecked=0, Total=342 [2018-12-03 06:42:40,247 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 19 states. [2018-12-03 06:44:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:44:06,419 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-12-03 06:44:06,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 06:44:06,419 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-12-03 06:44:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:44:06,419 INFO L225 Difference]: With dead ends: 137 [2018-12-03 06:44:06,419 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 06:44:06,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=130, Invalid=858, Unknown=4, NotChecked=0, Total=992 [2018-12-03 06:44:06,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 06:44:06,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 121. [2018-12-03 06:44:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 06:44:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-12-03 06:44:06,422 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 46 [2018-12-03 06:44:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:44:06,422 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-12-03 06:44:06,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 06:44:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-12-03 06:44:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 06:44:06,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:44:06,423 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:44:06,423 INFO L423 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:44:06,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:44:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1516661094, now seen corresponding path program 1 times [2018-12-03 06:44:06,424 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:44:06,424 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/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-03 06:44:06,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:44:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:44:06,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:44:06,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:44:06,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:06,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:44:06,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:06,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:44:06,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 06:44:07,830 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-03 06:44:07,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:44:07,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:44:07,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 06:44:07,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:07,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 06:44:07,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:07,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:44:07,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-12-03 06:44:08,898 WARN L180 SmtUtils]: Spent 991.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 06:44:10,148 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 06:44:10,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:44:10,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:44:10,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:10,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:44:10,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:44:10,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-12-03 06:44:11,452 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 06:44:13,044 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 06:44:13,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:44:13,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:44:13,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-03 06:44:13,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:13,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 06:44:13,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:13,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:44:13,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:17 [2018-12-03 06:44:13,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-12-03 06:44:13,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-12-03 06:44:13,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:13,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-03 06:44:13,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:13,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:44:13,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:44:13,290 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2018-12-03 06:44:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-12-03 06:44:13,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:44:13,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:44:13,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:44:13,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:44:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:44:13,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:44:18,237 WARN L180 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 06:44:19,616 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 06:44:19,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:44:19,630 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-03 06:44:19,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:19,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:44:19,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:44:19,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 06:44:19,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:19,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:44:19,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:26 [2018-12-03 06:44:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:44:20,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:44:20,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 06:44:20,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2018-12-03 06:44:20,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 06:44:20,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 06:44:20,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=561, Unknown=5, NotChecked=48, Total=702 [2018-12-03 06:44:20,091 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 25 states. [2018-12-03 06:44:35,920 WARN L180 SmtUtils]: Spent 8.03 s on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-03 06:44:38,744 WARN L180 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2018-12-03 06:44:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:44:59,138 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-12-03 06:44:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 06:44:59,139 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-12-03 06:44:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:44:59,140 INFO L225 Difference]: With dead ends: 162 [2018-12-03 06:44:59,140 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 06:44:59,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=209, Invalid=1349, Unknown=6, NotChecked=76, Total=1640 [2018-12-03 06:44:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 06:44:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 120. [2018-12-03 06:44:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 06:44:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-12-03 06:44:59,142 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 46 [2018-12-03 06:44:59,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:44:59,142 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-12-03 06:44:59,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 06:44:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-12-03 06:44:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 06:44:59,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:44:59,143 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:44:59,143 INFO L423 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:44:59,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:44:59,143 INFO L82 PathProgramCache]: Analyzing trace with hash 852739627, now seen corresponding path program 1 times [2018-12-03 06:44:59,143 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:44:59,143 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:44:59,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:44:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:44:59,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:44:59,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 06:44:59,286 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-03 06:44:59,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:44:59,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:44:59,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:44:59,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-03 06:45:00,796 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.offset| (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.offset|)))) is different from true [2018-12-03 06:45:00,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 06:45:00,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:00,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 06:45:00,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:00,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:00,826 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-03 06:45:00,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-03 06:45:00,982 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-03 06:45:00,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 06:45:00,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:00,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:00,986 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-03 06:45:00,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-03 06:45:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:45:01,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:45:01,311 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 06:45:01,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:01,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:01,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2018-12-03 06:45:01,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:45:01,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:45:01,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:45:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:45:01,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:45:01,470 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-03 06:45:01,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 06:45:01,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:01,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:01,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:01,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-03 06:45:01,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 06:45:01,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:01,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 06:45:01,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:01,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:01,514 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-03 06:45:01,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-03 06:45:01,556 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-03 06:45:01,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 06:45:01,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:01,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:01,560 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-03 06:45:01,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-03 06:45:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:45:01,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:45:01,797 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 06:45:01,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:01,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:01,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2018-12-03 06:45:01,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 06:45:01,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-12-03 06:45:01,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 06:45:01,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 06:45:01,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2018-12-03 06:45:01,930 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 16 states. [2018-12-03 06:45:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:45:05,001 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-12-03 06:45:05,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:45:05,001 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-12-03 06:45:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:45:05,002 INFO L225 Difference]: With dead ends: 124 [2018-12-03 06:45:05,002 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 06:45:05,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=129, Invalid=686, Unknown=1, NotChecked=54, Total=870 [2018-12-03 06:45:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 06:45:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2018-12-03 06:45:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 06:45:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-12-03 06:45:05,004 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 46 [2018-12-03 06:45:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:45:05,004 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-12-03 06:45:05,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 06:45:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-12-03 06:45:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 06:45:05,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:45:05,005 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:45:05,005 INFO L423 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:45:05,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:45:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1583667848, now seen corresponding path program 1 times [2018-12-03 06:45:05,005 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:45:05,005 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:45:05,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:45:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:45:05,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:45:05,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:45:05,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:45:05,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:05,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:05,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:05,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-03 06:45:05,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:45:05,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:05,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:45:05,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-12-03 06:45:05,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:05,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2018-12-03 06:45:05,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:05,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2018-12-03 06:45:05,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-03 06:45:05,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:05,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:05,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:05,430 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:12 [2018-12-03 06:45:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:45:05,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:45:05,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:45:05,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-03 06:45:05,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 06:45:05,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 06:45:05,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-03 06:45:05,453 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 18 states. [2018-12-03 06:45:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:45:06,537 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-12-03 06:45:06,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:45:06,537 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-12-03 06:45:06,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:45:06,538 INFO L225 Difference]: With dead ends: 133 [2018-12-03 06:45:06,538 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 06:45:06,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-12-03 06:45:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 06:45:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2018-12-03 06:45:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 06:45:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-03 06:45:06,540 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 46 [2018-12-03 06:45:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:45:06,540 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-03 06:45:06,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 06:45:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-03 06:45:06,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 06:45:06,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:45:06,541 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:45:06,541 INFO L423 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:45:06,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:45:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash 228146322, now seen corresponding path program 1 times [2018-12-03 06:45:06,541 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:45:06,541 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:45:06,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:45:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:45:06,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:45:06,672 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-03 06:45:06,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-03 06:45:06,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:06,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:06,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:06,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-03 06:45:08,117 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.offset| (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.offset|)))) is different from true [2018-12-03 06:45:08,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 06:45:08,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:08,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 06:45:08,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,142 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-03 06:45:08,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-03 06:45:08,188 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-03 06:45:08,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 06:45:08,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,192 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-03 06:45:08,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-03 06:45:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:45:08,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:45:08,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:45:08,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:45:08,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:45:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:45:08,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:45:08,428 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-03 06:45:08,430 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-03 06:45:08,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-03 06:45:08,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-03 06:45:08,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:08,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 06:45:08,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,463 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-03 06:45:08,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-03 06:45:08,591 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-03 06:45:08,592 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 3 [2018-12-03 06:45:08,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:08,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-03 06:45:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:45:08,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:45:08,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 06:45:08,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2018-12-03 06:45:08,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 06:45:08,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 06:45:08,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2018-12-03 06:45:08,748 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 16 states. [2018-12-03 06:45:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:45:11,554 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-03 06:45:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:45:11,555 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-12-03 06:45:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:45:11,555 INFO L225 Difference]: With dead ends: 105 [2018-12-03 06:45:11,555 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 06:45:11,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=155, Invalid=718, Unknown=1, NotChecked=56, Total=930 [2018-12-03 06:45:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 06:45:11,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-12-03 06:45:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 06:45:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-03 06:45:11,557 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 47 [2018-12-03 06:45:11,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:45:11,558 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-03 06:45:11,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 06:45:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-03 06:45:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 06:45:11,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:45:11,558 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:45:11,558 INFO L423 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:45:11,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:45:11,558 INFO L82 PathProgramCache]: Analyzing trace with hash 854953393, now seen corresponding path program 1 times [2018-12-03 06:45:11,559 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:45:11,559 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:45:11,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:45:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:45:11,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:45:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:45:11,622 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:45:11,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:45:11,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:45:11,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:45:11,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:45:11,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:45:11,624 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 5 states. [2018-12-03 06:45:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:45:11,630 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-12-03 06:45:11,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:45:11,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-03 06:45:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:45:11,631 INFO L225 Difference]: With dead ends: 103 [2018-12-03 06:45:11,631 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 06:45:11,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:45:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 06:45:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-12-03 06:45:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 06:45:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-12-03 06:45:11,633 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 46 [2018-12-03 06:45:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:45:11,633 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-12-03 06:45:11,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:45:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-12-03 06:45:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 06:45:11,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:45:11,633 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:45:11,634 INFO L423 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:45:11,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:45:11,634 INFO L82 PathProgramCache]: Analyzing trace with hash 665124698, now seen corresponding path program 1 times [2018-12-03 06:45:11,634 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:45:11,634 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:45:11,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:45:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:45:11,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:45:11,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:45:11,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:11,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:11,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 06:45:11,781 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-03 06:45:11,784 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-03 06:45:11,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:11,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:11,800 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-03 06:45:11,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-12-03 06:45:12,580 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-03 06:45:15,327 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 06:45:17,334 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) (exists ((|f19_#t~ret38.base| (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.base|))))) is different from true [2018-12-03 06:45:17,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:17,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:17,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:17,350 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 30 treesize of output 44 [2018-12-03 06:45:17,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:17,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-12-03 06:45:17,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:17,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-03 06:45:17,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:17,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:17,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:45:17,417 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2018-12-03 06:45:17,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-03 06:45:17,931 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-03 06:45:17,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:17,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:17,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 06:45:17,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:27 [2018-12-03 06:45:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-03 06:45:17,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:45:18,468 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-03 06:45:18,583 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:18,583 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:48, output treesize:1 [2018-12-03 06:45:23,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:45:23,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:45:23,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:45:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:45:23,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:45:23,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:45:23,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:23,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:23,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 06:45:23,963 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-03 06:45:23,965 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-03 06:45:23,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:23,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:23,981 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-03 06:45:23,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-12-03 06:45:23,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:23,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:23,994 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 39 [2018-12-03 06:45:23,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:24,018 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 33 treesize of output 26 [2018-12-03 06:45:24,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:24,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-03 06:45:24,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:24,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:24,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:45:24,046 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:34, output treesize:27 [2018-12-03 06:45:24,672 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 27 treesize of output 21 [2018-12-03 06:45:24,673 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-03 06:45:24,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:24,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:24,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:45:24,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2018-12-03 06:45:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-03 06:45:24,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:45:24,973 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-03 06:45:25,066 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:25,066 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:37, output treesize:1 [2018-12-03 06:45:30,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 06:45:30,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 24 [2018-12-03 06:45:30,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 06:45:30,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 06:45:30,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=717, Unknown=5, NotChecked=110, Total=930 [2018-12-03 06:45:30,419 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 25 states. [2018-12-03 06:45:37,583 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 06:45:38,983 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 47 [2018-12-03 06:45:44,242 WARN L180 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-12-03 06:45:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:45:48,189 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-12-03 06:45:48,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:45:48,189 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-12-03 06:45:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:45:48,190 INFO L225 Difference]: With dead ends: 130 [2018-12-03 06:45:48,190 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 06:45:48,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=161, Invalid=1101, Unknown=6, NotChecked=138, Total=1406 [2018-12-03 06:45:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 06:45:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2018-12-03 06:45:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 06:45:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-12-03 06:45:48,193 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 47 [2018-12-03 06:45:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:45:48,193 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-12-03 06:45:48,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 06:45:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-12-03 06:45:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 06:45:48,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:45:48,193 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:45:48,193 INFO L423 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:45:48,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:45:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1412084645, now seen corresponding path program 1 times [2018-12-03 06:45:48,194 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:45:48,194 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:45:48,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:45:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:45:48,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:45:48,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:45:48,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:45:48,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:45:48,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:45:48,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,321 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-12-03 06:45:48,331 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-03 06:45:48,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 06:45:48,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,340 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-03 06:45:48,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 06:45:48,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-03 06:45:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:45:48,353 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:45:48,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:45:48,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:45:48,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:45:48,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:45:48,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:45:48,355 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 6 states. [2018-12-03 06:45:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:45:48,441 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-12-03 06:45:48,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:45:48,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-03 06:45:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:45:48,442 INFO L225 Difference]: With dead ends: 102 [2018-12-03 06:45:48,442 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 06:45:48,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:45:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 06:45:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 06:45:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 06:45:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-12-03 06:45:48,444 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 47 [2018-12-03 06:45:48,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:45:48,444 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-12-03 06:45:48,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:45:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-12-03 06:45:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 06:45:48,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:45:48,445 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:45:48,445 INFO L423 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:45:48,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:45:48,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1924264879, now seen corresponding path program 1 times [2018-12-03 06:45:48,445 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:45:48,445 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:45:48,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:45:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:45:48,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:45:48,575 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 13 treesize of output 15 [2018-12-03 06:45:48,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:48,577 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 9 [2018-12-03 06:45:48,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,585 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-03 06:45:48,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:48,598 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 2 case distinctions, treesize of input 17 treesize of output 15 [2018-12-03 06:45:48,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 06:45:48,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:45:48,612 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 2 xjuncts. [2018-12-03 06:45:48,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-03 06:45:48,692 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-03 06:45:48,694 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-03 06:45:48,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:48,714 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-03 06:45:48,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-12-03 06:45:57,756 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 06:45:57,764 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 35 treesize of output 28 [2018-12-03 06:45:57,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:45:57,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-12-03 06:45:57,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:57,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:57,805 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-03 06:45:57,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-12-03 06:45:57,808 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 33 treesize of output 27 [2018-12-03 06:45:57,810 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 27 treesize of output 12 [2018-12-03 06:45:57,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:45:57,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:57,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:45:57,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:12 [2018-12-03 06:45:58,817 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_unsafe_19_#t~mem46.base_11| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v_probe_unsafe_19_#t~mem46.base_11| (_ bv0 1))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe_unsafe_19_#t~mem46.base_11|)))) is different from true [2018-12-03 06:46:01,502 WARN L180 SmtUtils]: Spent 646.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 06:46:02,615 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_unsafe_19_#t~mem46.base_11| (_ BitVec 32)) (|v_entry_point_~#a19~0.base_13| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a19~0.base_13| (_ bv1 1)))) (and (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_13|) (_ bv0 1)) (= (select .cse0 |v_probe_unsafe_19_#t~mem46.base_11|) (_ bv0 1)) (= |c_#valid| (store (store .cse0 |v_probe_unsafe_19_#t~mem46.base_11| (_ bv0 1)) |v_entry_point_~#a19~0.base_13| (_ bv0 1)))))) is different from true [2018-12-03 06:46:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:46:04,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:46:04,760 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-03 06:46:04,986 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 25 treesize of output 23 [2018-12-03 06:46:04,989 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 23 treesize of output 27 [2018-12-03 06:46:04,997 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 24 treesize of output 12 [2018-12-03 06:46:04,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:46:04,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:46:05,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:46:05,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 06:46:05,008 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 [2018-12-03 06:46:07,010 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_probe_unsafe_19_#in~a.base_19| (_ BitVec 32)) (|v_ldv_malloc_#res.base_94| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_probe_unsafe_19_#in~a.base_19| (_ bv1 1)))) (or (not (= (select |c_#valid| |v_probe_unsafe_19_#in~a.base_19|) (_ bv0 1))) (= (store (store .cse0 |v_ldv_malloc_#res.base_94| (_ bv0 1)) |v_probe_unsafe_19_#in~a.base_19| (_ bv0 1)) |c_old(#valid)|) (not (= (select .cse0 |v_ldv_malloc_#res.base_94|) (_ bv0 1)))))) is different from false [2018-12-03 06:46:07,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:46:07,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:46:07,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:46:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:46:07,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:46:07,050 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 9 treesize of output 12 [2018-12-03 06:46:07,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:46:07,059 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 06:46:07,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 06:46:07,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:46:07,078 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 2 xjuncts. [2018-12-03 06:46:07,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:19 [2018-12-03 06:46:10,770 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-03 06:46:10,773 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-03 06:46:10,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:46:10,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:46:10,789 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-03 06:46:10,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-12-03 06:46:10,865 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 35 treesize of output 28 [2018-12-03 06:46:10,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:46:10,871 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 28 treesize of output 37 [2018-12-03 06:46:10,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:46:10,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:46:10,897 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-03 06:46:10,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2018-12-03 06:46:10,899 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 33 treesize of output 27 [2018-12-03 06:46:10,901 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 27 treesize of output 12 [2018-12-03 06:46:10,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:46:10,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:46:10,908 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-03 06:46:10,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:12 [2018-12-03 06:46:12,543 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_unsafe_19_#t~mem46.base_16| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_probe_unsafe_19_#t~mem46.base_16|) (_ bv0 1)) (= (store |c_old(#valid)| |v_probe_unsafe_19_#t~mem46.base_16| (_ bv0 1)) |c_#valid|))) is different from true [2018-12-03 06:46:16,259 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_entry_point_~#a19~0.base_19| (_ BitVec 32)) (|v_probe_unsafe_19_#t~mem46.base_11| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_entry_point_~#a19~0.base_19| (_ bv1 1)))) (and (= |c_#valid| (store (store .cse0 |v_probe_unsafe_19_#t~mem46.base_11| (_ bv0 1)) |v_entry_point_~#a19~0.base_19| (_ bv0 1))) (= (select .cse0 |v_probe_unsafe_19_#t~mem46.base_11|) (_ bv0 1)) (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_19|) (_ bv0 1))))) is different from true [2018-12-03 06:46:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:46:18,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:46:18,552 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-03 06:46:18,771 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 29 treesize of output 27 [2018-12-03 06:46:18,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-03 06:46:18,785 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 28 treesize of output 12 [2018-12-03 06:46:18,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:46:18,787 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:46:18,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:46:18,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 06:46:18,797 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:45, output treesize:28 [2018-12-03 06:46:19,518 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_probe_unsafe_19_#in~a.base_25| (_ BitVec 32)) (|v_ldv_malloc_#res.base_106| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_probe_unsafe_19_#in~a.base_25| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 |v_ldv_malloc_#res.base_106|))) (not (= (select |c_#valid| |v_probe_unsafe_19_#in~a.base_25|) (_ bv0 1))) (= (store (store .cse0 |v_ldv_malloc_#res.base_106| (_ bv0 1)) |v_probe_unsafe_19_#in~a.base_25| (_ bv0 1)) |c_old(#valid)|)))) is different from false [2018-12-03 06:46:19,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 06:46:19,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 23 [2018-12-03 06:46:19,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 06:46:19,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 06:46:19,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=315, Unknown=15, NotChecked=246, Total=650 [2018-12-03 06:46:19,536 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 24 states. [2018-12-03 06:46:40,409 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-12-03 06:47:32,736 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 06:47:40,912 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-12-03 06:47:50,477 WARN L180 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2018-12-03 06:48:16,490 WARN L180 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2018-12-03 06:48:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:48:20,390 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-03 06:48:20,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 06:48:20,391 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-12-03 06:48:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:48:20,392 INFO L225 Difference]: With dead ends: 106 [2018-12-03 06:48:20,392 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 06:48:20,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 75.3s TimeCoverageRelationStatistics Valid=125, Invalid=627, Unknown=28, NotChecked=342, Total=1122 [2018-12-03 06:48:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 06:48:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 06:48:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 06:48:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-12-03 06:48:20,394 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 45 [2018-12-03 06:48:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:48:20,394 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-12-03 06:48:20,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 06:48:20,394 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-12-03 06:48:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 06:48:20,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:48:20,394 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:48:20,394 INFO L423 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:48:20,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:48:20,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1517398535, now seen corresponding path program 1 times [2018-12-03 06:48:20,395 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:48:20,395 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:48:20,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:48:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:48:20,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:48:20,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:48:20,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:20,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:20,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 06:48:20,573 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-03 06:48:20,574 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-03 06:48:20,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:20,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:20,583 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-03 06:48:20,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-03 06:48:22,696 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |f19_#t~ret38.base| (_ bv1 1)) |c_#valid|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.base|))) (= (_ bv0 1) (select |c_old(#valid)| |f19_#t~ret38.base|)))) is different from true [2018-12-03 06:48:22,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:22,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:22,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:22,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 52 [2018-12-03 06:48:22,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:22,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-12-03 06:48:22,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:22,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-12-03 06:48:22,743 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:22,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:22,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:22,770 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:55 [2018-12-03 06:48:22,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-12-03 06:48:22,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:22,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:22,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:24 [2018-12-03 06:48:23,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:23,072 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 40 treesize of output 52 [2018-12-03 06:48:23,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:23,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:23,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:53 [2018-12-03 06:48:23,176 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 26 treesize of output 20 [2018-12-03 06:48:23,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:23,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-12-03 06:48:23,180 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:23,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:23,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:23,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-12-03 06:48:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:48:23,234 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:48:23,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:48:23,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-12-03 06:48:23,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 06:48:23,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 06:48:23,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2018-12-03 06:48:23,236 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 23 states. [2018-12-03 06:48:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:48:24,256 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-12-03 06:48:24,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 06:48:24,257 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-12-03 06:48:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:48:24,257 INFO L225 Difference]: With dead ends: 83 [2018-12-03 06:48:24,257 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 06:48:24,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=130, Invalid=865, Unknown=1, NotChecked=60, Total=1056 [2018-12-03 06:48:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 06:48:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 06:48:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 06:48:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-12-03 06:48:24,259 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 48 [2018-12-03 06:48:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:48:24,260 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-12-03 06:48:24,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 06:48:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-12-03 06:48:24,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 06:48:24,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:48:24,260 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:48:24,260 INFO L423 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:48:24,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:48:24,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2045869131, now seen corresponding path program 1 times [2018-12-03 06:48:24,261 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:48:24,261 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:48:24,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:48:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:48:24,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:48:24,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:48:24,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:24,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:24,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 06:48:24,438 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-03 06:48:24,441 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-03 06:48:24,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:24,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:24,457 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-03 06:48:24,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-03 06:48:24,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:48:24,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:24,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:24,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-12-03 06:48:27,655 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 06:48:29,187 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 06:48:29,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 06:48:29,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:29,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-03 06:48:29,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:29,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:29,222 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-03 06:48:29,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2018-12-03 06:48:29,258 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 1 [2018-12-03 06:48:29,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:29,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:29,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-03 06:48:29,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:29,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:29,317 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 19 treesize of output 10 [2018-12-03 06:48:29,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:29,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:29,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2018-12-03 06:48:29,426 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 16 treesize of output 12 [2018-12-03 06:48:29,428 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 12 treesize of output 4 [2018-12-03 06:48:29,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:29,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:29,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:29,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-12-03 06:48:29,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:29,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-03 06:48:29,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:29,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:29,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-03 06:48:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:48:29,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:48:30,214 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 6 treesize of output 1 [2018-12-03 06:48:30,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 06:48:30,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,226 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 18 treesize of output 16 [2018-12-03 06:48:30,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-03 06:48:30,237 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 17 treesize of output 4 [2018-12-03 06:48:30,237 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,239 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,243 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:39, output treesize:6 [2018-12-03 06:48:30,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-12-03 06:48:30,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-12-03 06:48:30,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,469 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 2 xjuncts. [2018-12-03 06:48:30,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:34 [2018-12-03 06:48:30,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:48:30,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:48:30,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:48:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:48:30,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:48:30,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:48:30,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 06:48:30,588 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-03 06:48:30,590 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-03 06:48:30,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,605 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-03 06:48:30,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-03 06:48:30,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 06:48:30,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:30,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-03 06:48:30,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,653 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-03 06:48:30,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2018-12-03 06:48:30,656 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 1 [2018-12-03 06:48:30,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:30,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-03 06:48:30,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:30,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:30,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-12-03 06:48:30,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-12-03 06:48:30,726 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 16 treesize of output 12 [2018-12-03 06:48:30,727 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 12 treesize of output 4 [2018-12-03 06:48:30,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-12-03 06:48:30,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:30,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-03 06:48:30,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:30,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:30,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-03 06:48:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:48:30,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:48:31,120 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 8 treesize of output 1 [2018-12-03 06:48:31,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:31,128 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 18 treesize of output 16 [2018-12-03 06:48:31,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-03 06:48:31,138 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 17 treesize of output 4 [2018-12-03 06:48:31,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:31,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:31,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:31,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:31,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:6 [2018-12-03 06:48:31,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-12-03 06:48:31,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:31,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-12-03 06:48:31,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:31,278 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 2 xjuncts. [2018-12-03 06:48:31,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:34 [2018-12-03 06:48:31,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 06:48:31,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 20 [2018-12-03 06:48:31,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 06:48:31,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 06:48:31,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=778, Unknown=1, NotChecked=0, Total=870 [2018-12-03 06:48:31,347 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 21 states. [2018-12-03 06:48:43,750 WARN L180 SmtUtils]: Spent 3.31 s on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2018-12-03 06:48:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:48:46,979 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-03 06:48:46,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 06:48:46,979 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-12-03 06:48:46,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:48:46,980 INFO L225 Difference]: With dead ends: 91 [2018-12-03 06:48:46,980 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 06:48:46,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 107 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=250, Invalid=2099, Unknown=3, NotChecked=0, Total=2352 [2018-12-03 06:48:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 06:48:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-12-03 06:48:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 06:48:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-12-03 06:48:46,982 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 50 [2018-12-03 06:48:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:48:46,982 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-12-03 06:48:46,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 06:48:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-12-03 06:48:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 06:48:46,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:48:46,982 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:48:46,983 INFO L423 AbstractCegarLoop]: === Iteration 33 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:48:46,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:48:46,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2045869132, now seen corresponding path program 1 times [2018-12-03 06:48:46,983 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:48:46,983 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:48:47,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:48:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:48:47,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:48:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:48:47,155 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:48:47,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:48:47,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:48:47,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 06:48:47,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 06:48:47,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:48:47,158 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 9 states. [2018-12-03 06:48:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:48:47,357 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-03 06:48:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:48:47,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-03 06:48:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:48:47,359 INFO L225 Difference]: With dead ends: 85 [2018-12-03 06:48:47,359 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 06:48:47,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:48:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 06:48:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 06:48:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 06:48:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-12-03 06:48:47,361 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 50 [2018-12-03 06:48:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:48:47,361 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-12-03 06:48:47,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 06:48:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-12-03 06:48:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 06:48:47,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:48:47,362 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:48:47,362 INFO L423 AbstractCegarLoop]: === Iteration 34 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:48:47,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:48:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1002566357, now seen corresponding path program 1 times [2018-12-03 06:48:47,362 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:48:47,362 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:48:47,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:48:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:48:47,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:48:47,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:48:47,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:48:47,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:47,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:47,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:47,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-03 06:48:47,648 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-03 06:48:47,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 06:48:47,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:47,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:47,651 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-03 06:48:47,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-03 06:48:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 06:48:47,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:48:47,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:48:47,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-03 06:48:47,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 06:48:47,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 06:48:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-03 06:48:47,669 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 16 states. [2018-12-03 06:48:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:48:50,378 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-03 06:48:50,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:48:50,379 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-12-03 06:48:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:48:50,379 INFO L225 Difference]: With dead ends: 88 [2018-12-03 06:48:50,379 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 06:48:50,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-12-03 06:48:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 06:48:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 06:48:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 06:48:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-12-03 06:48:50,381 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 51 [2018-12-03 06:48:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:48:50,381 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-12-03 06:48:50,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 06:48:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-12-03 06:48:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 06:48:50,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:48:50,382 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:48:50,382 INFO L423 AbstractCegarLoop]: === Iteration 35 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:48:50,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:48:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1014785909, now seen corresponding path program 1 times [2018-12-03 06:48:50,382 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:48:50,382 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:48:50,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:48:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:48:50,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:48:50,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:48:50,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:50,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:50,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 06:48:50,588 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-03 06:48:50,590 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-03 06:48:50,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:50,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:50,605 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-03 06:48:50,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-12-03 06:48:52,753 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |f19_#t~ret38.base| (_ bv1 1)) |c_#valid|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.base|))) (= (_ bv0 1) (select |c_old(#valid)| |f19_#t~ret38.base|)))) is different from true [2018-12-03 06:48:52,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:52,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:52,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:52,767 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 30 treesize of output 44 [2018-12-03 06:48:52,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:52,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-12-03 06:48:52,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:52,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-03 06:48:52,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:52,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:52,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:52,833 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:51 [2018-12-03 06:48:53,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:53,255 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:48:53,256 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:48:53,268 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 2 case distinctions, treesize of input 41 treesize of output 82 [2018-12-03 06:48:53,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-03 06:48:53,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:48:53,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:83 [2018-12-03 06:48:53,601 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 43 treesize of output 35 [2018-12-03 06:48:53,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:53,605 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-12-03 06:48:53,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:53,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:53,635 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 35 treesize of output 27 [2018-12-03 06:48:53,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:53,639 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 27 treesize of output 17 [2018-12-03 06:48:53,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:53,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:53,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 06:48:53,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:38 [2018-12-03 06:48:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:48:53,737 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:48:53,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:48:53,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-12-03 06:48:53,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 06:48:53,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 06:48:53,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2018-12-03 06:48:53,740 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 24 states. [2018-12-03 06:48:55,286 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-03 06:48:55,542 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-03 06:48:55,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:48:55,742 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-12-03 06:48:55,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 06:48:55,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-12-03 06:48:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:48:55,743 INFO L225 Difference]: With dead ends: 90 [2018-12-03 06:48:55,743 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 06:48:55,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=124, Invalid=871, Unknown=1, NotChecked=60, Total=1056 [2018-12-03 06:48:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 06:48:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 06:48:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 06:48:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-12-03 06:48:55,745 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 52 [2018-12-03 06:48:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:48:55,745 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-12-03 06:48:55,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 06:48:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-12-03 06:48:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 06:48:55,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:48:55,746 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:48:55,746 INFO L423 AbstractCegarLoop]: === Iteration 36 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:48:55,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:48:55,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1997466789, now seen corresponding path program 1 times [2018-12-03 06:48:55,747 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:48:55,747 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:48:55,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:48:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:48:55,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:48:55,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:48:55,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:55,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:55,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 06:48:55,946 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-03 06:48:55,948 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-03 06:48:55,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:55,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:55,966 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-03 06:48:55,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-03 06:48:55,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:48:55,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:56,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:56,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-12-03 06:48:57,550 WARN L854 $PredicateComparison]: unable to prove that (exists ((|f19_#t~ret38.base| (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base| (store (select |c_old(#memory_$Pointer$.base)| |c_f19_#in~a.base|) |c_f19_#in~a.offset| |f19_#t~ret38.base|)))) is different from true [2018-12-03 06:48:57,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 06:48:57,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:57,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-03 06:48:57,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:57,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:57,588 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-03 06:48:57,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-12-03 06:48:57,590 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 1 [2018-12-03 06:48:57,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:57,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:57,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:1 [2018-12-03 06:48:57,594 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 1 [2018-12-03 06:48:57,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:57,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:57,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:1 [2018-12-03 06:48:57,598 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 21 treesize of output 17 [2018-12-03 06:48:57,601 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 17 treesize of output 5 [2018-12-03 06:48:57,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:57,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:57,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:57,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2018-12-03 06:48:57,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:57,639 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 06:48:57,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-03 06:48:57,651 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 2 xjuncts. [2018-12-03 06:48:57,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:28 [2018-12-03 06:48:57,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:57,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:57,684 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 23 treesize of output 15 [2018-12-03 06:48:57,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:57,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:57,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 [2018-12-03 06:48:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:48:57,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:48:58,047 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-03 06:48:58,206 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 6 treesize of output 1 [2018-12-03 06:48:58,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,212 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 6 treesize of output 1 [2018-12-03 06:48:58,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,217 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 18 treesize of output 16 [2018-12-03 06:48:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-03 06:48:58,228 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 17 treesize of output 4 [2018-12-03 06:48:58,228 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,234 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:43, output treesize:6 [2018-12-03 06:48:58,323 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 10 [2018-12-03 06:48:58,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-12-03 06:48:58,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:48:58,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:28 [2018-12-03 06:48:58,513 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-03 06:48:58,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,532 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 14 treesize of output 1 [2018-12-03 06:48:58,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:144, output treesize:26 [2018-12-03 06:48:58,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:48:58,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:48:58,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:48:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:48:58,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:48:58,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:48:58,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 06:48:58,781 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-03 06:48:58,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 06:48:58,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,800 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-03 06:48:58,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-12-03 06:48:58,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-03 06:48:58,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:58,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-03 06:48:58,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,887 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-03 06:48:58,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-12-03 06:48:58,890 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 1 [2018-12-03 06:48:58,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:1 [2018-12-03 06:48:58,892 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 1 [2018-12-03 06:48:58,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:1 [2018-12-03 06:48:58,896 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 21 treesize of output 17 [2018-12-03 06:48:58,898 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 17 treesize of output 5 [2018-12-03 06:48:58,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,903 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-03 06:48:58,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-12-03 06:48:58,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:58,913 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 06:48:58,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-03 06:48:58,925 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 2 xjuncts. [2018-12-03 06:48:58,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:28 [2018-12-03 06:48:58,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:58,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:48:58,949 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 23 treesize of output 15 [2018-12-03 06:48:58,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:58,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:48:58,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 [2018-12-03 06:48:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:48:58,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:48:59,259 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 8 treesize of output 1 [2018-12-03 06:48:59,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:59,264 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 18 treesize of output 16 [2018-12-03 06:48:59,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-03 06:48:59,274 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 17 treesize of output 4 [2018-12-03 06:48:59,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:59,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:59,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:59,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:59,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:39, output treesize:6 [2018-12-03 06:48:59,315 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 10 [2018-12-03 06:48:59,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:59,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-12-03 06:48:59,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:59,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:48:59,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:28 [2018-12-03 06:48:59,441 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 6 treesize of output 1 [2018-12-03 06:48:59,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:48:59,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:48:59,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-12-03 06:48:59,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 06:48:59,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-12-03 06:48:59,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 06:48:59,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 06:48:59,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=577, Unknown=3, NotChecked=48, Total=702 [2018-12-03 06:48:59,519 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 20 states. [2018-12-03 06:49:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:49:08,894 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-12-03 06:49:08,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 06:49:08,895 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-12-03 06:49:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:49:08,895 INFO L225 Difference]: With dead ends: 90 [2018-12-03 06:49:08,895 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 06:49:08,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=175, Invalid=1308, Unknown=3, NotChecked=74, Total=1560 [2018-12-03 06:49:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 06:49:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-12-03 06:49:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 06:49:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-12-03 06:49:08,897 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 56 [2018-12-03 06:49:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:49:08,897 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-12-03 06:49:08,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 06:49:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-12-03 06:49:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 06:49:08,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:49:08,898 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:49:08,898 INFO L423 AbstractCegarLoop]: === Iteration 37 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:49:08,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:49:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1789714576, now seen corresponding path program 1 times [2018-12-03 06:49:08,898 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:49:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:49:08,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:49:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:49:08,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:49:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 06:49:08,980 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:49:08,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:49:08,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:49:08,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:49:08,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:49:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:49:08,982 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 8 states. [2018-12-03 06:49:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:49:09,003 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-12-03 06:49:09,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:49:09,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-12-03 06:49:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:49:09,003 INFO L225 Difference]: With dead ends: 89 [2018-12-03 06:49:09,003 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 06:49:09,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:49:09,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 06:49:09,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 06:49:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 06:49:09,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-12-03 06:49:09,005 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 57 [2018-12-03 06:49:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:49:09,005 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-12-03 06:49:09,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:49:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-12-03 06:49:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 06:49:09,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:49:09,005 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:49:09,006 INFO L423 AbstractCegarLoop]: === Iteration 38 === [disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err4REQUIRES_VIOLATION, probe_unsafe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_unsafe_19Err0REQUIRES_VIOLATION, probe_unsafe_19Err5REQUIRES_VIOLATION, probe_unsafe_19Err1REQUIRES_VIOLATION, probe_unsafe_19Err2REQUIRES_VIOLATION, probe_unsafe_19Err3REQUIRES_VIOLATION, probe_unsafe_19Err7ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION]=== [2018-12-03 06:49:09,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:49:09,006 INFO L82 PathProgramCache]: Analyzing trace with hash 284796283, now seen corresponding path program 1 times [2018-12-03 06:49:09,006 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:49:09,006 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/cvc4 Starting monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:49:09,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:49:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:49:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:49:09,434 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 06:49:09,456 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 06:49:09,457 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 06:49:09,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:49:09 BoogieIcfgContainer [2018-12-03 06:49:09,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 06:49:09,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 06:49:09,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 06:49:09,466 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 06:49:09,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:40:08" (3/4) ... [2018-12-03 06:49:09,467 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 06:49:09,475 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 06:49:09,475 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-03 06:49:09,507 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_84154aeb-0f49-4add-9341-04020146a675/bin-2019/utaipan/witness.graphml [2018-12-03 06:49:09,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 06:49:09,508 INFO L168 Benchmark]: Toolchain (without parser) took 541490.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 939.3 MB in the beginning and 841.3 MB in the end (delta: 98.1 MB). Peak memory consumption was 290.5 MB. Max. memory is 11.5 GB. [2018-12-03 06:49:09,508 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:49:09,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-03 06:49:09,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:49:09,508 INFO L168 Benchmark]: Boogie Preprocessor took 18.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:49:09,509 INFO L168 Benchmark]: RCFGBuilder took 280.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-03 06:49:09,509 INFO L168 Benchmark]: TraceAbstraction took 540759.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 848.9 MB in the end (delta: 226.2 MB). Peak memory consumption was 277.6 MB. Max. memory is 11.5 GB. [2018-12-03 06:49:09,509 INFO L168 Benchmark]: Witness Printer took 41.92 ms. Allocated memory is still 1.2 GB. Free memory was 848.9 MB in the beginning and 841.3 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-12-03 06:49:09,510 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.53 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 18.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 280.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 540759.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 848.9 MB in the end (delta: 226.2 MB). Peak memory consumption was 277.6 MB. Max. memory is 11.5 GB. * Witness Printer took 41.92 ms. Allocated memory is still 1.2 GB. Free memory was 848.9 MB in the beginning and 841.3 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1478]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={-1216356918:0}] [L1492] CALL entry_point() VAL [ldv_global_msg_list={-1216356918:0}] [L1483] struct A19 a19; VAL [a19={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1484] CALL, EXPR probe_unsafe_19(&a19) VAL [a={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1455] int ret = - -3; VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ret=3] [L1457] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={-1216356918:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={-1557892848:0}, ldv_global_msg_list={-1216356918:0}, malloc(size)={-1557892848:0}, size=4] [L1457] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ldv_malloc(sizeof(int))={-1557892848:0}, ret=3] [L1457] a->q = (int *)ldv_malloc(sizeof(int)) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ldv_malloc(sizeof(int))={-1557892848:0}, ret=3] [L1458] EXPR a->q VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}, ret=3] [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) VAL [a={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1440] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={-1216356918:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={-134218281:0}, ldv_global_msg_list={-1216356918:0}, malloc(size)={-134218281:0}, size=4] [L1440] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ldv_malloc(sizeof(int))={-134218281:0}] [L1440] a->p = (int *)ldv_malloc(sizeof(int)) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ldv_malloc(sizeof(int))={-134218281:0}] [L1441] a->p VAL [a={134218272:0}, a={134218272:0}, a->p={-134218281:0}, ldv_global_msg_list={-1216356918:0}] [L1441] COND TRUE a->p [L1442] return 0; VAL [\result=0, a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1460] RET, EXPR f19(a) VAL [a={134218272:0}, a={134218272:0}, f19(a)=0, ldv_global_msg_list={-1216356918:0}, ret=3] [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1464] CALL, EXPR g19() VAL [ldv_global_msg_list={-1216356918:0}] [L1451] return __VERIFIER_nondet_int(); [L1464] RET, EXPR g19() VAL [a={134218272:0}, a={134218272:0}, g19()=0, ldv_global_msg_list={-1216356918:0}, ret=0] [L1464] COND TRUE !g19() [L1470] CALL f19_undo(a) VAL [a={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1447] EXPR a->p VAL [a={134218272:0}, a={134218272:0}, a->p={-134218281:0}, ldv_global_msg_list={-1216356918:0}] [L1447] free(a->p) VAL [a={134218272:0}, a={134218272:0}, a->p={-134218281:0}, ldv_global_msg_list={-1216356918:0}] [L1447] free(a->p) [L1470] RET f19_undo(a) VAL [a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1472] EXPR a->q VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1472] free(a->q) VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1472] free(a->q) [L1474] return ret; VAL [\result=0, a={134218272:0}, a={134218272:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1484] RET, EXPR probe_unsafe_19(&a19) VAL [a19={134218272:0}, ldv_global_msg_list={-1216356918:0}, probe_unsafe_19(&a19)=0] [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 VAL [a19={134218272:0}, ldv_global_msg_list={-1216356918:0}, ret=0] [L1487] CALL disconnect_19(&a19) VAL [a={134218272:0}, ldv_global_msg_list={-1216356918:0}] [L1478] EXPR a->q VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}] [L1478] free(a->q) VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}] [L1478] free(a->q) VAL [a={134218272:0}, a={134218272:0}, a->q={-1557892848:0}, ldv_global_msg_list={-1216356918:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 85 locations, 21 error locations. UNSAFE Result, 540.7s OverallTime, 38 OverallIterations, 2 TraceHistogramMax, 413.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2688 SDtfs, 2711 SDslu, 13011 SDs, 0 SdLazy, 11377 SolverSat, 903 SolverUnsat, 189 SolverUnknown, 0 SolverNotchecked, 320.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2404 GetRequests, 1671 SyntacticMatches, 61 SemanticMatches, 672 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 204.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 398 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 123.0s InterpolantComputationTime, 1961 NumberOfCodeBlocks, 1961 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1857 ConstructedInterpolants, 336 QuantifiedInterpolants, 685367 SizeOfPredicates, 380 NumberOfNonLiveVariables, 7579 ConjunctsInSsa, 923 ConjunctsInUnsatCore, 46 InterpolantComputations, 29 PerfectInterpolantSequences, 122/164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...