./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.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_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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 4b81e1cb0abdf40bd1ce21baa6dd37e529c3fc9b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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 4b81e1cb0abdf40bd1ce21baa6dd37e529c3fc9b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 13:21:42,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 13:21:42,221 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 13:21:42,230 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 13:21:42,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 13:21:42,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 13:21:42,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 13:21:42,233 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 13:21:42,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 13:21:42,234 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 13:21:42,235 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 13:21:42,235 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 13:21:42,236 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 13:21:42,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 13:21:42,237 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 13:21:42,238 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 13:21:42,239 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 13:21:42,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 13:21:42,241 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 13:21:42,242 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 13:21:42,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 13:21:42,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 13:21:42,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 13:21:42,246 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 13:21:42,246 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 13:21:42,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 13:21:42,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 13:21:42,248 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 13:21:42,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 13:21:42,249 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 13:21:42,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 13:21:42,250 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 13:21:42,250 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 13:21:42,250 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 13:21:42,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 13:21:42,251 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 13:21:42,252 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 13:21:42,259 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 13:21:42,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 13:21:42,260 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 13:21:42,260 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 13:21:42,260 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 13:21:42,260 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 13:21:42,260 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 13:21:42,260 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 13:21:42,260 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 13:21:42,260 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 13:21:42,261 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 13:21:42,261 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 13:21:42,261 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 13:21:42,261 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 13:21:42,261 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 13:21:42,261 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 13:21:42,261 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 13:21:42,261 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 13:21:42,261 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 13:21:42,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 13:21:42,262 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 13:21:42,262 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 13:21:42,262 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 13:21:42,262 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 13:21:42,262 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 13:21:42,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 13:21:42,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 13:21:42,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 13:21:42,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 13:21:42,262 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 13:21:42,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 13:21:42,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 13:21:42,263 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 13:21:42,263 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 13:21:42,263 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 13:21:42,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 13:21:42,263 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_27029956-b178-44b8-9a5f-c38aa1975938/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 -> 4b81e1cb0abdf40bd1ce21baa6dd37e529c3fc9b [2018-12-09 13:21:42,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 13:21:42,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 13:21:42,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 13:21:42,293 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 13:21:42,293 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 13:21:42,293 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-09 13:21:42,335 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/data/b1228917b/7bcf85ecee0e4111be86d7496348cc31/FLAGac8e2dfd4 [2018-12-09 13:21:42,766 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 13:21:42,766 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-09 13:21:42,773 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/data/b1228917b/7bcf85ecee0e4111be86d7496348cc31/FLAGac8e2dfd4 [2018-12-09 13:21:42,781 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/data/b1228917b/7bcf85ecee0e4111be86d7496348cc31 [2018-12-09 13:21:42,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 13:21:42,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 13:21:42,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 13:21:42,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 13:21:42,786 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 13:21:42,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:21:42" (1/1) ... [2018-12-09 13:21:42,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5fc0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:42, skipping insertion in model container [2018-12-09 13:21:42,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:21:42" (1/1) ... [2018-12-09 13:21:42,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 13:21:42,818 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 13:21:43,036 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:21:43,045 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 13:21:43,080 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:21:43,113 INFO L195 MainTranslator]: Completed translation [2018-12-09 13:21:43,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43 WrapperNode [2018-12-09 13:21:43,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 13:21:43,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 13:21:43,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 13:21:43,114 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 13:21:43,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43" (1/1) ... [2018-12-09 13:21:43,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43" (1/1) ... [2018-12-09 13:21:43,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 13:21:43,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 13:21:43,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 13:21:43,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 13:21:43,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43" (1/1) ... [2018-12-09 13:21:43,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43" (1/1) ... [2018-12-09 13:21:43,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43" (1/1) ... [2018-12-09 13:21:43,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43" (1/1) ... [2018-12-09 13:21:43,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43" (1/1) ... [2018-12-09 13:21:43,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43" (1/1) ... [2018-12-09 13:21:43,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43" (1/1) ... [2018-12-09 13:21:43,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 13:21:43,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 13:21:43,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 13:21:43,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 13:21:43,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 13:21:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2018-12-09 13:21:43,188 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-12-09 13:21:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure f19 [2018-12-09 13:21:43,188 INFO L138 BoogieDeclarations]: Found implementation of procedure f19 [2018-12-09 13:21:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 13:21:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure probe_19 [2018-12-09 13:21:43,189 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-12-09 13:21:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-12-09 13:21:43,189 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-12-09 13:21:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 13:21:43,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 13:21:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 13:21:43,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 13:21:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 13:21:43,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 13:21:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 13:21:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 13:21:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 13:21:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 13:21:43,190 INFO L130 BoogieDeclarations]: Found specification of procedure g19 [2018-12-09 13:21:43,190 INFO L138 BoogieDeclarations]: Found implementation of procedure g19 [2018-12-09 13:21:43,190 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 13:21:43,190 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 13:21:43,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 13:21:43,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 13:21:43,385 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 13:21:43,385 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 13:21:43,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:21:43 BoogieIcfgContainer [2018-12-09 13:21:43,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 13:21:43,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 13:21:43,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 13:21:43,388 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 13:21:43,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:21:42" (1/3) ... [2018-12-09 13:21:43,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ae3d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:21:43, skipping insertion in model container [2018-12-09 13:21:43,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:43" (2/3) ... [2018-12-09 13:21:43,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ae3d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:21:43, skipping insertion in model container [2018-12-09 13:21:43,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:21:43" (3/3) ... [2018-12-09 13:21:43,390 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-09 13:21:43,395 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 13:21:43,400 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-09 13:21:43,408 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-09 13:21:43,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 13:21:43,423 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 13:21:43,423 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 13:21:43,423 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 13:21:43,423 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 13:21:43,423 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 13:21:43,423 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 13:21:43,423 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 13:21:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-12-09 13:21:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 13:21:43,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:43,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:21:43,440 INFO L423 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-09 13:21:43,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:43,443 INFO L82 PathProgramCache]: Analyzing trace with hash -364091227, now seen corresponding path program 1 times [2018-12-09 13:21:43,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:21:43,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:43,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:43,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:43,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:21:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:21:43,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:43,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:21:43,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:21:43,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 13:21:43,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 13:21:43,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 13:21:43,616 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 7 states. [2018-12-09 13:21:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:43,907 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-12-09 13:21:43,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 13:21:43,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-09 13:21:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:43,916 INFO L225 Difference]: With dead ends: 149 [2018-12-09 13:21:43,916 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 13:21:43,917 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-09 13:21:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 13:21:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 82. [2018-12-09 13:21:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 13:21:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-12-09 13:21:43,948 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 15 [2018-12-09 13:21:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:43,949 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-12-09 13:21:43,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 13:21:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-12-09 13:21:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 13:21:43,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:43,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:21:43,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-09 13:21:43,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash -364091226, now seen corresponding path program 1 times [2018-12-09 13:21:43,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:21:43,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:43,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:43,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:43,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:21:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:21:44,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:44,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 13:21:44,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:21:44,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 13:21:44,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 13:21:44,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 13:21:44,046 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 8 states. [2018-12-09 13:21:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:44,420 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2018-12-09 13:21:44,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 13:21:44,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 13:21:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:44,421 INFO L225 Difference]: With dead ends: 145 [2018-12-09 13:21:44,421 INFO L226 Difference]: Without dead ends: 145 [2018-12-09 13:21:44,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-09 13:21:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-09 13:21:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 79. [2018-12-09 13:21:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 13:21:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-12-09 13:21:44,427 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 15 [2018-12-09 13:21:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:44,428 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-12-09 13:21:44,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 13:21:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-12-09 13:21:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 13:21:44,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:44,428 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-09 13:21:44,428 INFO L423 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-09 13:21:44,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1509820408, now seen corresponding path program 1 times [2018-12-09 13:21:44,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:21:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:44,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:44,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:21:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:44,480 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-09 13:21:44,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:44,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:21:44,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:21:44,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 13:21:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 13:21:44,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 13:21:44,481 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 7 states. [2018-12-09 13:21:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:44,673 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2018-12-09 13:21:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 13:21:44,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 13:21:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:44,674 INFO L225 Difference]: With dead ends: 126 [2018-12-09 13:21:44,674 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 13:21:44,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-09 13:21:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 13:21:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 77. [2018-12-09 13:21:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 13:21:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-09 13:21:44,679 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 26 [2018-12-09 13:21:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:44,679 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-09 13:21:44,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 13:21:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-09 13:21:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 13:21:44,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:44,680 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-09 13:21:44,680 INFO L423 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-09 13:21:44,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:44,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1509820409, now seen corresponding path program 1 times [2018-12-09 13:21:44,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:21:44,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:44,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:44,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:44,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:21:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:44,794 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-09 13:21:44,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:44,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 13:21:44,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:21:44,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 13:21:44,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 13:21:44,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-09 13:21:44,796 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 12 states. [2018-12-09 13:21:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:45,111 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2018-12-09 13:21:45,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 13:21:45,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-12-09 13:21:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:45,112 INFO L225 Difference]: With dead ends: 104 [2018-12-09 13:21:45,112 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 13:21:45,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-09 13:21:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 13:21:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2018-12-09 13:21:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 13:21:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-12-09 13:21:45,116 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 26 [2018-12-09 13:21:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:45,117 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-09 13:21:45,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 13:21:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-12-09 13:21:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 13:21:45,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:45,117 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-09 13:21:45,118 INFO L423 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-09 13:21:45,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:45,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1532388828, now seen corresponding path program 1 times [2018-12-09 13:21:45,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:21:45,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:45,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:21:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:21:45,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:45,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:21:45,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:21:45,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:21:45,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:21:45,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:21:45,145 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-12-09 13:21:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:45,172 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-12-09 13:21:45,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 13:21:45,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 13:21:45,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:45,173 INFO L225 Difference]: With dead ends: 82 [2018-12-09 13:21:45,173 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 13:21:45,174 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-09 13:21:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 13:21:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-12-09 13:21:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-09 13:21:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-12-09 13:21:45,177 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 26 [2018-12-09 13:21:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:45,177 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-12-09 13:21:45,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:21:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-12-09 13:21:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 13:21:45,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:45,177 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-09 13:21:45,178 INFO L423 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-09 13:21:45,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:45,178 INFO L82 PathProgramCache]: Analyzing trace with hash -24837019, now seen corresponding path program 1 times [2018-12-09 13:21:45,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:21:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:45,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:21:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:21:45,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:45,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 13:21:45,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:21:45,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 13:21:45,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 13:21:45,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 13:21:45,227 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 8 states. [2018-12-09 13:21:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:45,292 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-12-09 13:21:45,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 13:21:45,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-09 13:21:45,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:45,293 INFO L225 Difference]: With dead ends: 95 [2018-12-09 13:21:45,293 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 13:21:45,293 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-09 13:21:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 13:21:45,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2018-12-09 13:21:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 13:21:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-12-09 13:21:45,296 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 26 [2018-12-09 13:21:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:45,296 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-12-09 13:21:45,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 13:21:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-12-09 13:21:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 13:21:45,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:45,297 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-09 13:21:45,297 INFO L423 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-09 13:21:45,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:45,297 INFO L82 PathProgramCache]: Analyzing trace with hash -24837018, now seen corresponding path program 1 times [2018-12-09 13:21:45,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:21:45,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:45,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:21:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:21:45,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:45,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:21:45,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:21:45,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:21:45,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:21:45,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:21:45,328 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 6 states. [2018-12-09 13:21:45,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:45,340 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-12-09 13:21:45,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 13:21:45,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 13:21:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:45,341 INFO L225 Difference]: With dead ends: 89 [2018-12-09 13:21:45,341 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 13:21:45,342 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-09 13:21:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 13:21:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-12-09 13:21:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 13:21:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-12-09 13:21:45,344 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 26 [2018-12-09 13:21:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:45,344 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-12-09 13:21:45,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:21:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-12-09 13:21:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 13:21:45,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:45,345 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-09 13:21:45,345 INFO L423 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-09 13:21:45,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:45,345 INFO L82 PathProgramCache]: Analyzing trace with hash -768724897, now seen corresponding path program 1 times [2018-12-09 13:21:45,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:21:45,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:45,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:21:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:21:45,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:45,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:21:45,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:21:45,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 13:21:45,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 13:21:45,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 13:21:45,372 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 4 states. [2018-12-09 13:21:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:45,439 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-12-09 13:21:45,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 13:21:45,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-09 13:21:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:45,440 INFO L225 Difference]: With dead ends: 113 [2018-12-09 13:21:45,441 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 13:21:45,441 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-09 13:21:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 13:21:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-12-09 13:21:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 13:21:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-12-09 13:21:45,446 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 27 [2018-12-09 13:21:45,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:45,447 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-12-09 13:21:45,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 13:21:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-12-09 13:21:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 13:21:45,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:45,448 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-09 13:21:45,448 INFO L423 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-09 13:21:45,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash 840552866, now seen corresponding path program 1 times [2018-12-09 13:21:45,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:21:45,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:45,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:21:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:45,487 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-09 13:21:45,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:45,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 13:21:45,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:21:45,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 13:21:45,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 13:21:45,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 13:21:45,488 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 5 states. [2018-12-09 13:21:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:45,498 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2018-12-09 13:21:45,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 13:21:45,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-09 13:21:45,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:45,499 INFO L225 Difference]: With dead ends: 107 [2018-12-09 13:21:45,499 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 13:21:45,499 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-09 13:21:45,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 13:21:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-12-09 13:21:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 13:21:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2018-12-09 13:21:45,504 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 35 [2018-12-09 13:21:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:45,505 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2018-12-09 13:21:45,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 13:21:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2018-12-09 13:21:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 13:21:45,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:45,506 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-09 13:21:45,506 INFO L423 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-09 13:21:45,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:45,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1728056547, now seen corresponding path program 1 times [2018-12-09 13:21:45,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:21:45,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:21:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:45,549 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-09 13:21:45,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:45,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:21:45,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:21:45,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:21:45,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:21:45,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:21:45,550 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 6 states. [2018-12-09 13:21:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:45,587 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-12-09 13:21:45,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 13:21:45,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-12-09 13:21:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:45,587 INFO L225 Difference]: With dead ends: 103 [2018-12-09 13:21:45,587 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 13:21:45,587 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-09 13:21:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 13:21:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-09 13:21:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 13:21:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-12-09 13:21:45,591 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 35 [2018-12-09 13:21:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:45,592 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-12-09 13:21:45,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:21:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-12-09 13:21:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 13:21:45,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:45,593 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-09 13:21:45,593 INFO L423 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err1REQUIRES_VIOLATION, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr1REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err3REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err0REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err4REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err2REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err1REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err0REQUIRES_VIOLATION]=== [2018-12-09 13:21:45,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:45,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1434653540, now seen corresponding path program 1 times [2018-12-09 13:21:45,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:21:45,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:45,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:21:45,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:21:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:45,695 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-09 13:21:45,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:21:45,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:21:45,696 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-12-09 13:21:45,698 INFO L205 CegarAbsIntRunner]: [24], [26], [29], [30], [36], [37], [38], [41], [42], [43], [44], [45], [49], [61], [63], [66], [67], [74], [76], [79], [91], [94], [103], [105], [106], [107], [108], [109], [111], [115], [116], [117], [118] [2018-12-09 13:21:45,721 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:21:45,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:21:45,843 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:21:45,844 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-09 13:21:45,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:45,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:21:45,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:21:45,852 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:21:45,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:45,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:21:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:45,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:21:45,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:21:45,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:21:45,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:45,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:45,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:45,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 13:21:46,341 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-09 13:21:46,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 13:21:46,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 13:21:46,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:46,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:46,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:21:46,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-12-09 13:21:46,364 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-09 13:21:46,365 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-09 13:21:46,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:46,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:46,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:46,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 13:21:46,370 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-09 13:21:46,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:21:46,454 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-09 13:21:46,655 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:21:46,656 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-09 13:21:46,660 INFO L168 Benchmark]: Toolchain (without parser) took 3876.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 952.4 MB in the beginning and 912.3 MB in the end (delta: 40.1 MB). Peak memory consumption was 240.4 MB. Max. memory is 11.5 GB. [2018-12-09 13:21:46,661 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:21:46,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -134.5 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-12-09 13:21:46,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.70 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-09 13:21:46,663 INFO L168 Benchmark]: Boogie Preprocessor took 18.45 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-09 13:21:46,663 INFO L168 Benchmark]: RCFGBuilder took 229.22 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: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2018-12-09 13:21:46,663 INFO L168 Benchmark]: TraceAbstraction took 3272.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 912.3 MB in the end (delta: 138.6 MB). Peak memory consumption was 221.5 MB. Max. memory is 11.5 GB. [2018-12-09 13:21:46,665 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -134.5 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.70 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 18.45 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 229.22 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: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3272.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 912.3 MB in the end (delta: 138.6 MB). Peak memory consumption was 221.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-09 13:21:47,955 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 13:21:47,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 13:21:47,963 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 13:21:47,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 13:21:47,963 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 13:21:47,964 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 13:21:47,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 13:21:47,966 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 13:21:47,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 13:21:47,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 13:21:47,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 13:21:47,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 13:21:47,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 13:21:47,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 13:21:47,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 13:21:47,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 13:21:47,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 13:21:47,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 13:21:47,974 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 13:21:47,975 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 13:21:47,976 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 13:21:47,977 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 13:21:47,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 13:21:47,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 13:21:47,978 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 13:21:47,979 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 13:21:47,980 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 13:21:47,980 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 13:21:47,981 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 13:21:47,981 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 13:21:47,981 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 13:21:47,982 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 13:21:47,982 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 13:21:47,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 13:21:47,983 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 13:21:47,983 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 13:21:47,993 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 13:21:47,993 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 13:21:47,994 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 13:21:47,994 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 13:21:47,994 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 13:21:47,994 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 13:21:47,994 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 13:21:47,994 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 13:21:47,995 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 13:21:47,995 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 13:21:47,995 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 13:21:47,995 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 13:21:47,995 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 13:21:47,995 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 13:21:47,996 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 13:21:47,996 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 13:21:47,996 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 13:21:47,996 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 13:21:47,996 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 13:21:47,996 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 13:21:47,996 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 13:21:47,996 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 13:21:47,997 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 13:21:47,997 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 13:21:47,997 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 13:21:47,997 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 13:21:47,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 13:21:47,997 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 13:21:47,997 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 13:21:47,997 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 13:21:47,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 13:21:47,997 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 13:21:47,997 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 13:21:47,998 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 13:21:47,998 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 13:21:47,998 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 13:21:47,998 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_27029956-b178-44b8-9a5f-c38aa1975938/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 -> 4b81e1cb0abdf40bd1ce21baa6dd37e529c3fc9b [2018-12-09 13:21:48,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 13:21:48,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 13:21:48,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 13:21:48,035 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 13:21:48,036 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 13:21:48,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-09 13:21:48,080 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/data/e82545231/487f041147644b418030523855a2227d/FLAGaf9efe946 [2018-12-09 13:21:48,434 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 13:21:48,435 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/sv-benchmarks/c/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-09 13:21:48,444 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/data/e82545231/487f041147644b418030523855a2227d/FLAGaf9efe946 [2018-12-09 13:21:48,455 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/data/e82545231/487f041147644b418030523855a2227d [2018-12-09 13:21:48,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 13:21:48,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 13:21:48,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 13:21:48,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 13:21:48,462 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 13:21:48,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:21:48" (1/1) ... [2018-12-09 13:21:48,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d255691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48, skipping insertion in model container [2018-12-09 13:21:48,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:21:48" (1/1) ... [2018-12-09 13:21:48,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 13:21:48,502 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 13:21:48,711 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:21:48,756 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 13:21:48,790 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:21:48,825 INFO L195 MainTranslator]: Completed translation [2018-12-09 13:21:48,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48 WrapperNode [2018-12-09 13:21:48,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 13:21:48,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 13:21:48,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 13:21:48,826 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 13:21:48,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48" (1/1) ... [2018-12-09 13:21:48,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48" (1/1) ... [2018-12-09 13:21:48,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 13:21:48,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 13:21:48,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 13:21:48,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 13:21:48,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48" (1/1) ... [2018-12-09 13:21:48,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48" (1/1) ... [2018-12-09 13:21:48,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48" (1/1) ... [2018-12-09 13:21:48,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48" (1/1) ... [2018-12-09 13:21:48,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48" (1/1) ... [2018-12-09 13:21:48,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48" (1/1) ... [2018-12-09 13:21:48,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48" (1/1) ... [2018-12-09 13:21:48,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 13:21:48,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 13:21:48,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 13:21:48,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 13:21:48,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 13:21:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2018-12-09 13:21:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-12-09 13:21:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure f19 [2018-12-09 13:21:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure f19 [2018-12-09 13:21:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 13:21:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure probe_19 [2018-12-09 13:21:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-12-09 13:21:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-12-09 13:21:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-12-09 13:21:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 13:21:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 13:21:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 13:21:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 13:21:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 13:21:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 13:21:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 13:21:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 13:21:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 13:21:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 13:21:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure g19 [2018-12-09 13:21:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure g19 [2018-12-09 13:21:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 13:21:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 13:21:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 13:21:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 13:21:49,130 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 13:21:49,130 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 13:21:49,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:21:49 BoogieIcfgContainer [2018-12-09 13:21:49,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 13:21:49,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 13:21:49,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 13:21:49,133 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 13:21:49,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:21:48" (1/3) ... [2018-12-09 13:21:49,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d51f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:21:49, skipping insertion in model container [2018-12-09 13:21:49,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:48" (2/3) ... [2018-12-09 13:21:49,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d51f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:21:49, skipping insertion in model container [2018-12-09 13:21:49,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:21:49" (3/3) ... [2018-12-09 13:21:49,135 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-12-09 13:21:49,140 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 13:21:49,144 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-09 13:21:49,153 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-09 13:21:49,169 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 13:21:49,169 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 13:21:49,170 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 13:21:49,170 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 13:21:49,170 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 13:21:49,170 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 13:21:49,170 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 13:21:49,170 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 13:21:49,170 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 13:21:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-12-09 13:21:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 13:21:49,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:49,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:21:49,186 INFO L423 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:21:49,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:49,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1778700408, now seen corresponding path program 1 times [2018-12-09 13:21:49,192 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:21:49,192 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:21:49,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:49,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:21:49,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 6 treesize of output 5 [2018-12-09 13:21:49,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:49,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:49,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 13:21:49,845 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-09 13:21:49,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:49,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:49,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 13:21:49,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:49,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:21:49,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-09 13:21:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:21:49,884 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:21:49,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:49,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 13:21:49,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 13:21:49,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 13:21:49,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2018-12-09 13:21:49,899 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 8 states. [2018-12-09 13:21:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:52,308 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2018-12-09 13:21:52,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 13:21:52,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 13:21:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:52,319 INFO L225 Difference]: With dead ends: 134 [2018-12-09 13:21:52,320 INFO L226 Difference]: Without dead ends: 131 [2018-12-09 13:21:52,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2018-12-09 13:21:52,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-09 13:21:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 91. [2018-12-09 13:21:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 13:21:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2018-12-09 13:21:52,357 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 15 [2018-12-09 13:21:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:52,358 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2018-12-09 13:21:52,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 13:21:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2018-12-09 13:21:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 13:21:52,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:52,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:21:52,359 INFO L423 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:21:52,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:52,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1778700407, now seen corresponding path program 1 times [2018-12-09 13:21:52,360 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:21:52,360 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:21:52,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:52,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:21:52,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:21:52,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:52,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:21:52,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:52,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:52,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 13:21:53,526 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-09 13:21:53,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:53,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:53,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 13:21:53,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:53,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 13:21:53,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:53,557 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-09 13:21:53,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-12-09 13:21:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:21:53,568 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:21:53,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:53,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 13:21:53,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 13:21:53,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 13:21:53,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2018-12-09 13:21:53,572 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand 8 states. [2018-12-09 13:21:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:53,978 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2018-12-09 13:21:53,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 13:21:53,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 13:21:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:53,979 INFO L225 Difference]: With dead ends: 130 [2018-12-09 13:21:53,980 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 13:21:53,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2018-12-09 13:21:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 13:21:53,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2018-12-09 13:21:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 13:21:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2018-12-09 13:21:53,986 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 15 [2018-12-09 13:21:53,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:53,986 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2018-12-09 13:21:53,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 13:21:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2018-12-09 13:21:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 13:21:53,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:53,987 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-09 13:21:53,987 INFO L423 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:21:53,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash 73867160, now seen corresponding path program 1 times [2018-12-09 13:21:53,988 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:21:53,988 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:21:54,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:54,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:21:54,640 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-09 13:21:54,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:54,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:54,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 13:21:54,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:54,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:21:54,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-09 13:21:54,669 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-09 13:21:54,670 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:21:54,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:54,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 13:21:54,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 13:21:54,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 13:21:54,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2018-12-09 13:21:54,672 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 8 states. [2018-12-09 13:21:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:57,057 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-12-09 13:21:57,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 13:21:57,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-09 13:21:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:57,058 INFO L225 Difference]: With dead ends: 114 [2018-12-09 13:21:57,058 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 13:21:57,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2018-12-09 13:21:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 13:21:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2018-12-09 13:21:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 13:21:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2018-12-09 13:21:57,063 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 26 [2018-12-09 13:21:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:57,063 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2018-12-09 13:21:57,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 13:21:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2018-12-09 13:21:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 13:21:57,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:57,064 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-09 13:21:57,065 INFO L423 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:21:57,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:57,065 INFO L82 PathProgramCache]: Analyzing trace with hash 73867161, now seen corresponding path program 1 times [2018-12-09 13:21:57,065 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:21:57,065 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:21:57,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:57,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:21:57,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:21:57,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:57,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 6 treesize of output 5 [2018-12-09 13:21:57,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:57,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:57,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 13:21:58,061 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-09 13:21:58,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:58,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 13:21:58,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:58,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:58,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:58,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 13:21:58,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:58,096 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-09 13:21:58,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-12-09 13:21:58,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:58,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 13:21:58,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:58,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:58,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:58,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 13:21:58,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:58,174 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-09 13:21:58,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-12-09 13:21:58,199 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-09 13:21:58,199 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:21:58,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:58,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 13:21:58,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 13:21:58,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 13:21:58,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2018-12-09 13:21:58,201 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 11 states. [2018-12-09 13:21:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:58,789 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2018-12-09 13:21:58,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 13:21:58,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-12-09 13:21:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:58,790 INFO L225 Difference]: With dead ends: 122 [2018-12-09 13:21:58,791 INFO L226 Difference]: Without dead ends: 122 [2018-12-09 13:21:58,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2018-12-09 13:21:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-09 13:21:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2018-12-09 13:21:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 13:21:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2018-12-09 13:21:58,796 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 26 [2018-12-09 13:21:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:58,797 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2018-12-09 13:21:58,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 13:21:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2018-12-09 13:21:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 13:21:58,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:58,797 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-09 13:21:58,798 INFO L423 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:21:58,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash 439120609, now seen corresponding path program 1 times [2018-12-09 13:21:58,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:21:58,798 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:21:58,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:58,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:21:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:21:58,853 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:21:58,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:58,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:21:58,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:21:58,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:21:58,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:21:58,855 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 6 states. [2018-12-09 13:21:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:58,875 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2018-12-09 13:21:58,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 13:21:58,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 13:21:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:58,876 INFO L225 Difference]: With dead ends: 97 [2018-12-09 13:21:58,876 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 13:21:58,877 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-09 13:21:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 13:21:58,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-12-09 13:21:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-09 13:21:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2018-12-09 13:21:58,881 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 26 [2018-12-09 13:21:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:58,881 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2018-12-09 13:21:58,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:21:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2018-12-09 13:21:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 13:21:58,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:58,882 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-09 13:21:58,882 INFO L423 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:21:58,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash 729089443, now seen corresponding path program 1 times [2018-12-09 13:21:58,883 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:21:58,883 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:21:58,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:58,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:21:58,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:21:58,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:21:58,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:58,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:58,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:58,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-12-09 13:21:58,974 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-09 13:21:58,976 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-09 13:21:58,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:58,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:58,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:58,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2018-12-09 13:21:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:21:58,986 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:21:58,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:21:58,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:21:58,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:21:58,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:21:58,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:21:58,989 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 6 states. [2018-12-09 13:21:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:21:59,121 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-12-09 13:21:59,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 13:21:59,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-09 13:21:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:21:59,124 INFO L225 Difference]: With dead ends: 99 [2018-12-09 13:21:59,124 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 13:21:59,124 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-09 13:21:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 13:21:59,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-09 13:21:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 13:21:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-12-09 13:21:59,132 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 27 [2018-12-09 13:21:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:21:59,133 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-12-09 13:21:59,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:21:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-12-09 13:21:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 13:21:59,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:21:59,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:21:59,134 INFO L423 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:21:59,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:21:59,135 INFO L82 PathProgramCache]: Analyzing trace with hash 218555266, now seen corresponding path program 1 times [2018-12-09 13:21:59,135 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:21:59,135 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:21:59,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:21:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:21:59,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:21:59,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 13:21:59,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:59,254 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-09 13:21:59,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:21:59,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:21:59,259 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-09 13:21:59,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:21:59,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-09 13:21:59,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 13:21:59,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:21:59,284 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-09 13:21:59,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-09 13:22:01,318 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-09 13:22:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:22:01,334 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:22:01,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:22:01,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 13:22:01,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 13:22:01,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 13:22:01,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=26, Unknown=1, NotChecked=10, Total=56 [2018-12-09 13:22:01,337 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 8 states. [2018-12-09 13:22:19,471 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-09 13:22:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:22:49,703 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2018-12-09 13:22:49,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 13:22:49,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-09 13:22:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:22:49,705 INFO L225 Difference]: With dead ends: 135 [2018-12-09 13:22:49,705 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 13:22:49,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2018-12-09 13:22:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 13:22:49,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2018-12-09 13:22:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 13:22:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2018-12-09 13:22:49,711 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 27 [2018-12-09 13:22:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:22:49,711 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2018-12-09 13:22:49,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 13:22:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2018-12-09 13:22:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 13:22:49,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:22:49,713 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-09 13:22:49,713 INFO L423 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:22:49,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:22:49,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1599342211, now seen corresponding path program 1 times [2018-12-09 13:22:49,713 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:22:49,714 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:22:49,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:22:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:22:49,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:22:49,778 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-09 13:22:49,779 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:22:49,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:22:49,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 13:22:49,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 13:22:49,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 13:22:49,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 13:22:49,780 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand 5 states. [2018-12-09 13:22:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:22:49,794 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2018-12-09 13:22:49,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 13:22:49,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-09 13:22:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:22:49,795 INFO L225 Difference]: With dead ends: 114 [2018-12-09 13:22:49,795 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 13:22:49,795 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-09 13:22:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 13:22:49,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-12-09 13:22:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 13:22:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2018-12-09 13:22:49,798 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 34 [2018-12-09 13:22:49,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:22:49,799 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2018-12-09 13:22:49,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 13:22:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2018-12-09 13:22:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 13:22:49,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:22:49,799 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-09 13:22:49,799 INFO L423 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:22:49,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:22:49,800 INFO L82 PathProgramCache]: Analyzing trace with hash -325948579, now seen corresponding path program 1 times [2018-12-09 13:22:49,800 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:22:49,800 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:22:49,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:22:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:22:49,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:22:49,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 13:22:49,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:49,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:49,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-09 13:22:49,882 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-09 13:22:49,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:22:49,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:22:49,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 13:22:49,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 13:22:49,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 13:22:49,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 13:22:49,884 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand 5 states. [2018-12-09 13:22:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:22:49,976 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2018-12-09 13:22:49,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 13:22:49,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-09 13:22:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:22:49,977 INFO L225 Difference]: With dead ends: 116 [2018-12-09 13:22:49,977 INFO L226 Difference]: Without dead ends: 116 [2018-12-09 13:22:49,977 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-09 13:22:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-09 13:22:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2018-12-09 13:22:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-09 13:22:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2018-12-09 13:22:49,981 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 34 [2018-12-09 13:22:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:22:49,981 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2018-12-09 13:22:49,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 13:22:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2018-12-09 13:22:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 13:22:49,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:22:49,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] [2018-12-09 13:22:49,982 INFO L423 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:22:49,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:22:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1570713059, now seen corresponding path program 1 times [2018-12-09 13:22:49,982 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:22:49,982 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:22:49,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:22:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:22:50,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:22:50,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 13:22:50,072 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-09 13:22:50,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:50,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:50,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:50,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-09 13:22:50,091 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-09 13:22:50,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, 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-09 13:22:50,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:50,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:50,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:50,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-12-09 13:22:50,101 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-09 13:22:50,101 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:22:50,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:22:50,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:22:50,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:22:50,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:22:50,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:22:50,104 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 6 states. [2018-12-09 13:22:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:22:50,210 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2018-12-09 13:22:50,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 13:22:50,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-09 13:22:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:22:50,211 INFO L225 Difference]: With dead ends: 108 [2018-12-09 13:22:50,211 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 13:22:50,211 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-09 13:22:50,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 13:22:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-09 13:22:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-09 13:22:50,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2018-12-09 13:22:50,214 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 34 [2018-12-09 13:22:50,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:22:50,214 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2018-12-09 13:22:50,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:22:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2018-12-09 13:22:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 13:22:50,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:22:50,215 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-09 13:22:50,215 INFO L423 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:22:50,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:22:50,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1740867549, now seen corresponding path program 1 times [2018-12-09 13:22:50,216 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:22:50,216 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:22:50,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:22:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:22:50,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:22:50,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:22:50,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:22:50,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:50,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:50,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:50,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-09 13:22:51,594 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-09 13:22:51,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 13:22:51,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:22:51,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 13:22:51,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-09 13:22:51,622 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-09 13:22:51,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 13:22:51,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 13:22:51,634 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-09 13:22:51,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:22:51,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:22:51,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:22:51,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:22:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:22:51,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:22:51,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:22:51,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:22:51,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 13:22:51,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 13:22:51,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:22:51,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 13:22:51,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-09 13:22:51,909 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-09 13:22:51,911 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-09 13:22:51,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:51,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 13:22:51,915 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-09 13:22:51,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:22:52,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:22:52,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2018-12-09 13:22:52,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 13:22:52,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 13:22:52,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2018-12-09 13:22:52,023 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 14 states. [2018-12-09 13:22:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:22:52,586 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2018-12-09 13:22:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 13:22:52,586 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-12-09 13:22:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:22:52,587 INFO L225 Difference]: With dead ends: 123 [2018-12-09 13:22:52,587 INFO L226 Difference]: Without dead ends: 123 [2018-12-09 13:22:52,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=494, Unknown=1, NotChecked=46, Total=650 [2018-12-09 13:22:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-09 13:22:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2018-12-09 13:22:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-09 13:22:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2018-12-09 13:22:52,591 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 138 transitions. Word has length 35 [2018-12-09 13:22:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:22:52,591 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 138 transitions. [2018-12-09 13:22:52,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 13:22:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2018-12-09 13:22:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 13:22:52,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:22:52,592 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-09 13:22:52,592 INFO L423 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:22:52,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:22:52,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1867680955, now seen corresponding path program 1 times [2018-12-09 13:22:52,593 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:22:52,593 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:22:52,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:22:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:22:52,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:22:52,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-09 13:22:52,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:52,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:52,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 13:22:52,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:22:52,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:22:52,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:52,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:52,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:52,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2018-12-09 13:22:57,907 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 13:22:57,915 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-09 13:22:57,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:22:57,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-09 13:22:57,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:57,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:57,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:57,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-12-09 13:22:57,937 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-09 13:22:57,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 13:22:57,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:57,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:57,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:22:57,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-12-09 13:22:57,962 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-09 13:22:57,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:22:58,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:22:58,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:22:58,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:22:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:22:58,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:22:58,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:22:58,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:58,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:58,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 13:22:58,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:22:58,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:22:58,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:58,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:58,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:58,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-12-09 13:22:58,279 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-09 13:22:58,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:22:58,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-09 13:22:58,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:58,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:58,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:58,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2018-12-09 13:22:58,302 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-09 13:22:58,304 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-09 13:22:58,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:22:58,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:58,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:22:58,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2018-12-09 13:22:58,308 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-09 13:22:58,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:22:58,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:22:58,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 14 [2018-12-09 13:22:58,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 13:22:58,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 13:22:58,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=225, Unknown=3, NotChecked=0, Total=272 [2018-12-09 13:22:58,443 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. Second operand 15 states. [2018-12-09 13:23:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:23:50,908 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2018-12-09 13:23:50,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 13:23:50,908 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-12-09 13:23:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:23:50,909 INFO L225 Difference]: With dead ends: 132 [2018-12-09 13:23:50,909 INFO L226 Difference]: Without dead ends: 132 [2018-12-09 13:23:50,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=97, Invalid=450, Unknown=5, NotChecked=0, Total=552 [2018-12-09 13:23:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-09 13:23:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2018-12-09 13:23:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-09 13:23:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2018-12-09 13:23:50,913 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 36 [2018-12-09 13:23:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:23:50,913 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2018-12-09 13:23:50,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 13:23:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2018-12-09 13:23:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 13:23:50,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:23:50,914 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-09 13:23:50,914 INFO L423 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:23:50,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:23:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash -209528388, now seen corresponding path program 1 times [2018-12-09 13:23:50,915 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:23:50,915 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:23:50,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:23:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:23:50,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:23:50,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:23:51,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:23:51,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:51,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:51,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:23:51,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:23:51,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:51,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:51,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:51,023 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-12-09 13:23:51,037 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-09 13:23:51,038 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-09 13:23:51,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:51,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:51,049 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-09 13:23:51,051 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-09 13:23:51,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:51,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:51,054 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-09 13:23:51,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-12-09 13:23:51,063 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-09 13:23:51,063 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:23:51,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:23:51,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:23:51,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:23:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:23:51,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:23:51,066 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand 6 states. [2018-12-09 13:23:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:23:51,149 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-12-09 13:23:51,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 13:23:51,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-12-09 13:23:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:23:51,150 INFO L225 Difference]: With dead ends: 104 [2018-12-09 13:23:51,150 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 13:23:51,150 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-09 13:23:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 13:23:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-09 13:23:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 13:23:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2018-12-09 13:23:51,154 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 36 [2018-12-09 13:23:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:23:51,154 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2018-12-09 13:23:51,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:23:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2018-12-09 13:23:51,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 13:23:51,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:23:51,155 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-09 13:23:51,155 INFO L423 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:23:51,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:23:51,155 INFO L82 PathProgramCache]: Analyzing trace with hash -309113979, now seen corresponding path program 1 times [2018-12-09 13:23:51,156 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:23:51,156 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:23:51,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:23:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:23:51,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:23:51,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 13:23:51,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:51,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:51,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-09 13:23:51,277 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-09 13:23:51,277 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:23:51,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:23:51,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 13:23:51,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 13:23:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 13:23:51,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 13:23:51,279 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 8 states. [2018-12-09 13:23:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:23:51,504 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2018-12-09 13:23:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 13:23:51,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-12-09 13:23:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:23:51,506 INFO L225 Difference]: With dead ends: 117 [2018-12-09 13:23:51,506 INFO L226 Difference]: Without dead ends: 117 [2018-12-09 13:23:51,506 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-09 13:23:51,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-09 13:23:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-12-09 13:23:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 13:23:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-12-09 13:23:51,509 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 41 [2018-12-09 13:23:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:23:51,509 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-12-09 13:23:51,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 13:23:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-12-09 13:23:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 13:23:51,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:23:51,510 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-09 13:23:51,510 INFO L423 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:23:51,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:23:51,511 INFO L82 PathProgramCache]: Analyzing trace with hash -309113978, now seen corresponding path program 1 times [2018-12-09 13:23:51,511 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:23:51,511 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:23:51,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:23:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:23:51,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:23:51,731 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-09 13:23:51,731 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:23:51,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:23:51,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 13:23:51,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 13:23:51,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 13:23:51,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 13:23:51,733 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 11 states. [2018-12-09 13:23:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:23:52,274 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-12-09 13:23:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 13:23:52,275 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-12-09 13:23:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:23:52,276 INFO L225 Difference]: With dead ends: 108 [2018-12-09 13:23:52,276 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 13:23:52,276 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-09 13:23:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 13:23:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-12-09 13:23:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 13:23:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-12-09 13:23:52,284 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 41 [2018-12-09 13:23:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:23:52,284 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-12-09 13:23:52,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 13:23:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-12-09 13:23:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 13:23:52,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:23:52,285 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-09 13:23:52,285 INFO L423 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:23:52,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:23:52,286 INFO L82 PathProgramCache]: Analyzing trace with hash -992598774, now seen corresponding path program 1 times [2018-12-09 13:23:52,286 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:23:52,286 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:23:52,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:23:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:23:52,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:23:52,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 13:23:52,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 13:23:52,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:52,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:52,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:52,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 13:23:52,484 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-09 13:23:52,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 13:23:52,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:52,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:52,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:52,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 13:23:52,500 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-09 13:23:52,500 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:23:52,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:23:52,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 13:23:52,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 13:23:52,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 13:23:52,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-09 13:23:52,502 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 14 states. [2018-12-09 13:23:52,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:23:52,993 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2018-12-09 13:23:52,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 13:23:52,993 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-12-09 13:23:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:23:52,994 INFO L225 Difference]: With dead ends: 107 [2018-12-09 13:23:52,994 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 13:23:52,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-12-09 13:23:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 13:23:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-09 13:23:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 13:23:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-09 13:23:52,996 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 42 [2018-12-09 13:23:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:23:52,996 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-09 13:23:52,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 13:23:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-09 13:23:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 13:23:52,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:23:52,997 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-09 13:23:52,997 INFO L423 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:23:52,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:23:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash -705790875, now seen corresponding path program 1 times [2018-12-09 13:23:52,997 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:23:52,997 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:23:53,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:23:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:23:53,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:23:53,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 13:23:53,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:53,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:53,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-09 13:23:53,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:23:53,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:53,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:53,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 13:23:53,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 13:23:53,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 13:23:53,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:53,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:53,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:53,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 13:23:53,237 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-09 13:23:53,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 13:23:53,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:53,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:53,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:53,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-09 13:23:53,257 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-09 13:23:53,257 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:23:53,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:23:53,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 13:23:53,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 13:23:53,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 13:23:53,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-09 13:23:53,259 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 14 states. [2018-12-09 13:23:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:23:55,914 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2018-12-09 13:23:55,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 13:23:55,914 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-12-09 13:23:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:23:55,915 INFO L225 Difference]: With dead ends: 127 [2018-12-09 13:23:55,915 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 13:23:55,915 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-09 13:23:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 13:23:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2018-12-09 13:23:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-09 13:23:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-12-09 13:23:55,918 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 43 [2018-12-09 13:23:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:23:55,918 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-12-09 13:23:55,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 13:23:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-12-09 13:23:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 13:23:55,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:23:55,919 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-09 13:23:55,919 INFO L423 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:23:55,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:23:55,919 INFO L82 PathProgramCache]: Analyzing trace with hash -494439962, now seen corresponding path program 1 times [2018-12-09 13:23:55,919 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:23:55,920 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:23:55,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:23:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:23:55,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:23:56,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 13:23:56,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 13:23:56,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:56,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:56,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:56,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 13:23:56,125 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-09 13:23:56,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 13:23:56,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:56,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:56,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:56,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 13:23:56,140 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-09 13:23:56,140 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:23:56,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:23:56,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 13:23:56,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 13:23:56,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 13:23:56,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-09 13:23:56,143 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 14 states. [2018-12-09 13:23:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:23:56,705 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-12-09 13:23:56,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 13:23:56,705 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-12-09 13:23:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:23:56,706 INFO L225 Difference]: With dead ends: 152 [2018-12-09 13:23:56,706 INFO L226 Difference]: Without dead ends: 152 [2018-12-09 13:23:56,706 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-09 13:23:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-09 13:23:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 115. [2018-12-09 13:23:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-09 13:23:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2018-12-09 13:23:56,708 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 43 [2018-12-09 13:23:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:23:56,709 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-12-09 13:23:56,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 13:23:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2018-12-09 13:23:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 13:23:56,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:23:56,709 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-09 13:23:56,710 INFO L423 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:23:56,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:23:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1002486348, now seen corresponding path program 1 times [2018-12-09 13:23:56,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:23:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:23:56,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:23:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:23:56,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:23:56,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 13:23:56,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:56,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:56,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-09 13:23:56,848 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-09 13:23:56,849 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:23:56,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:23:56,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 13:23:56,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 13:23:56,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 13:23:56,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 13:23:56,851 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 10 states. [2018-12-09 13:23:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:23:57,218 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2018-12-09 13:23:57,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 13:23:57,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-12-09 13:23:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:23:57,219 INFO L225 Difference]: With dead ends: 128 [2018-12-09 13:23:57,219 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 13:23:57,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-12-09 13:23:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 13:23:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-12-09 13:23:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 13:23:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-12-09 13:23:57,222 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 45 [2018-12-09 13:23:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:23:57,222 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-12-09 13:23:57,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 13:23:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-12-09 13:23:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 13:23:57,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:23:57,222 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-09 13:23:57,222 INFO L423 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:23:57,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:23:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1002486349, now seen corresponding path program 1 times [2018-12-09 13:23:57,223 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:23:57,223 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:23:57,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:23:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:23:57,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:23:57,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:23:57,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:57,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:23:57,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:23:57,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:23:57,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 13:23:58,200 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-09 13:24:00,583 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-09 13:24:02,767 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-09 13:24:04,343 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-09 13:24:04,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:24:04,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:24:04,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 13:24:04,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:24:04,374 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-09 13:24:04,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:26 [2018-12-09 13:24:06,427 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-09 13:24:06,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 13:24:06,453 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-09 13:24:06,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 13:24:06,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:24:06,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 13:24:06,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:24:06,529 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-09 13:24:06,529 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:26, output treesize:7 [2018-12-09 13:24:06,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:24:06,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:24:06,544 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-09 13:24:06,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:24:06,575 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-09 13:24:06,596 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-09 13:24:06,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 13:24:06,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:24:06,669 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-09 13:24:06,670 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:43, output treesize:11 [2018-12-09 13:24:06,768 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-09 13:24:06,768 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:24:06,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:24:06,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 13:24:06,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 13:24:06,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 13:24:06,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=152, Unknown=3, NotChecked=24, Total=210 [2018-12-09 13:24:06,771 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 15 states. [2018-12-09 13:24:15,534 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 13:24:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:24:28,505 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2018-12-09 13:24:28,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 13:24:28,506 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-12-09 13:24:28,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:24:28,506 INFO L225 Difference]: With dead ends: 135 [2018-12-09 13:24:28,506 INFO L226 Difference]: Without dead ends: 135 [2018-12-09 13:24:28,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=50, Invalid=257, Unknown=3, NotChecked=32, Total=342 [2018-12-09 13:24:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-09 13:24:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 121. [2018-12-09 13:24:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 13:24:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-12-09 13:24:28,509 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 45 [2018-12-09 13:24:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:24:28,509 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-12-09 13:24:28,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 13:24:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-12-09 13:24:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 13:24:28,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:24:28,509 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-09 13:24:28,509 INFO L423 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:24:28,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:24:28,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1171715165, now seen corresponding path program 1 times [2018-12-09 13:24:28,510 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:24:28,510 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:24:28,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:24:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:24:28,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:24:28,579 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-09 13:24:28,579 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:24:28,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:24:28,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 13:24:28,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 13:24:28,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 13:24:28,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 13:24:28,581 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 8 states. [2018-12-09 13:24:28,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:24:28,612 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-12-09 13:24:28,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 13:24:28,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-12-09 13:24:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:24:28,613 INFO L225 Difference]: With dead ends: 124 [2018-12-09 13:24:28,613 INFO L226 Difference]: Without dead ends: 124 [2018-12-09 13:24:28,613 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-09 13:24:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-09 13:24:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-12-09 13:24:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 13:24:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-12-09 13:24:28,616 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 44 [2018-12-09 13:24:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:24:28,616 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-12-09 13:24:28,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 13:24:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-12-09 13:24:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 13:24:28,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:24:28,617 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-09 13:24:28,617 INFO L423 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:24:28,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:24:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1943975022, now seen corresponding path program 1 times [2018-12-09 13:24:28,618 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:24:28,618 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:24:28,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:24:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:24:28,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:24:28,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 13:24:28,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 13:24:28,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:24:28,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:24:28,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:24:28,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-09 13:24:28,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:24:28,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:24:28,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-09 13:24:28,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:24:28,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:24:28,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2018-12-09 13:24:28,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 7 treesize of output 1 [2018-12-09 13:24:28,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:24:28,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:24:28,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-09 13:24:34,923 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-09 13:24:36,962 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-09 13:24:39,003 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-09 13:24:41,039 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-09 13:24:41,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:24:41,044 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-09 13:24:41,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:24:41,062 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-09 13:24:41,065 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 18 treesize of output 16 [2018-12-09 13:24:41,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:24:41,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-09 13:24:41,077 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:24:41,088 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-09 13:24:41,089 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:24:41,099 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-09 13:24:41,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 13:24:41,112 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-12-09 13:24:41,156 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-09 13:24:41,157 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:24:41,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:24:41,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 13:24:41,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 13:24:41,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 13:24:41,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=261, Unknown=2, NotChecked=0, Total=306 [2018-12-09 13:24:41,159 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 18 states. [2018-12-09 13:26:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:26:11,001 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-12-09 13:26:11,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 13:26:11,001 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-12-09 13:26:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:26:11,002 INFO L225 Difference]: With dead ends: 137 [2018-12-09 13:26:11,002 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 13:26:11,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=122, Invalid=744, Unknown=4, NotChecked=0, Total=870 [2018-12-09 13:26:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 13:26:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 121. [2018-12-09 13:26:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 13:26:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-12-09 13:26:11,004 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 46 [2018-12-09 13:26:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:26:11,004 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-12-09 13:26:11,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 13:26:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-12-09 13:26:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 13:26:11,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:26:11,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] [2018-12-09 13:26:11,005 INFO L423 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:26:11,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:26:11,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1943975023, now seen corresponding path program 1 times [2018-12-09 13:26:11,005 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:26:11,006 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:26:11,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:26:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:26:11,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:26:11,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:26:11,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:11,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:26:11,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:11,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:11,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 13:26:11,885 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-09 13:26:11,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:26:11,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:26:11,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 13:26:11,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:11,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 13:26:11,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:11,915 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-09 13:26:11,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-12-09 13:26:12,849 WARN L180 SmtUtils]: Spent 880.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-09 13:26:14,113 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-09 13:26:14,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 13:26:14,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 13:26:14,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:14,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:14,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:26:14,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-12-09 13:26:15,384 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 13:26:17,444 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 13:26:17,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:26:17,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:26:17,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-09 13:26:17,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:17,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 13:26:17,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:17,479 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-09 13:26:17,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:17 [2018-12-09 13:26:17,684 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-09 13:26:17,687 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-09 13:26:17,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:17,710 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-09 13:26:17,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:17,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:17,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:26:17,718 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2018-12-09 13:26:17,732 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-09 13:26:17,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:26:18,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:26:18,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:26:18,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:26:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:26:18,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:26:21,836 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-09 13:26:23,444 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-09 13:26:23,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:26:23,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 13:26:23,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:23,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:26:23,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:26:23,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 13:26:23,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:23,518 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-09 13:26:23,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:26 [2018-12-09 13:26:23,896 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-09 13:26:23,897 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:26:23,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 13:26:23,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2018-12-09 13:26:23,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 13:26:23,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 13:26:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=4, NotChecked=48, Total=702 [2018-12-09 13:26:23,913 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 25 states. [2018-12-09 13:26:40,932 WARN L180 SmtUtils]: Spent 7.87 s on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-09 13:26:43,703 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2018-12-09 13:26:57,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:26:57,234 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-12-09 13:26:57,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 13:26:57,235 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-12-09 13:26:57,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:26:57,236 INFO L225 Difference]: With dead ends: 162 [2018-12-09 13:26:57,236 INFO L226 Difference]: Without dead ends: 162 [2018-12-09 13:26:57,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=209, Invalid=1350, Unknown=5, NotChecked=76, Total=1640 [2018-12-09 13:26:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-09 13:26:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 120. [2018-12-09 13:26:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-09 13:26:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-12-09 13:26:57,239 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 46 [2018-12-09 13:26:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:26:57,239 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-12-09 13:26:57,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 13:26:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-12-09 13:26:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 13:26:57,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:26:57,240 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-09 13:26:57,240 INFO L423 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:26:57,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:26:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1012305689, now seen corresponding path program 1 times [2018-12-09 13:26:57,241 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:26:57,241 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:26:57,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:26:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:26:57,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:26:57,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:26:57,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:26:57,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:57,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:57,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:57,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 13:26:58,794 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-09 13:26:58,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-09 13:26:58,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:26:58,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 13:26:58,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:58,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:58,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:58,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-09 13:26:58,957 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-09 13:26:58,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 13:26:58,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:58,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:58,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:58,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 13:26:58,975 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-09 13:26:58,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:26:59,296 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 13:26:59,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2018-12-09 13:26:59,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:26:59,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:26:59,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:26:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:26:59,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:26:59,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:26:59,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:26:59,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 13:26:59,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 13:26:59,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:26:59,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 13:26:59,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-09 13:26:59,544 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-09 13:26:59,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 13:26:59,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 13:26:59,550 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-09 13:26:59,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:26:59,765 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 13:26:59,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:26:59,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2018-12-09 13:26:59,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:26:59,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-12-09 13:26:59,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 13:26:59,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 13:26:59,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2018-12-09 13:26:59,901 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 16 states. [2018-12-09 13:27:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:27:02,870 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-12-09 13:27:02,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 13:27:02,871 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-12-09 13:27:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:27:02,871 INFO L225 Difference]: With dead ends: 124 [2018-12-09 13:27:02,871 INFO L226 Difference]: Without dead ends: 124 [2018-12-09 13:27:02,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=686, Unknown=1, NotChecked=54, Total=870 [2018-12-09 13:27:02,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-09 13:27:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2018-12-09 13:27:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-09 13:27:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-12-09 13:27:02,875 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 46 [2018-12-09 13:27:02,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:27:02,875 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-12-09 13:27:02,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 13:27:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-12-09 13:27:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 13:27:02,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:27:02,876 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-09 13:27:02,876 INFO L423 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:27:02,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:27:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1876968269, now seen corresponding path program 1 times [2018-12-09 13:27:02,876 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:27:02,876 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:27:02,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:27:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:27:02,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:27:03,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 13:27:03,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 13:27:03,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:03,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:03,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:03,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 13:27:03,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 13:27:03,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:03,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:27:03,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-12-09 13:27:03,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:03,349 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-09 13:27:03,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:03,368 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-09 13:27:03,370 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-09 13:27:03,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:03,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:03,380 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-09 13:27:03,380 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:13 [2018-12-09 13:27:03,402 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-09 13:27:03,402 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:27:03,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:27:03,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 13:27:03,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 13:27:03,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 13:27:03,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-09 13:27:03,404 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 18 states. [2018-12-09 13:27:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:27:04,586 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-12-09 13:27:04,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 13:27:04,587 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-12-09 13:27:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:27:04,587 INFO L225 Difference]: With dead ends: 133 [2018-12-09 13:27:04,587 INFO L226 Difference]: Without dead ends: 133 [2018-12-09 13:27:04,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-12-09 13:27:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-09 13:27:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2018-12-09 13:27:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 13:27:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-09 13:27:04,589 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 46 [2018-12-09 13:27:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:27:04,590 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-09 13:27:04,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 13:27:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-09 13:27:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 13:27:04,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:27:04,590 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-09 13:27:04,590 INFO L423 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:27:04,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:27:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash 133683600, now seen corresponding path program 1 times [2018-12-09 13:27:04,591 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:27:04,591 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:27:04,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:27:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:27:04,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:27:04,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:27:04,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:27:04,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:04,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:04,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:04,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-09 13:27:06,230 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-09 13:27:06,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 13:27:06,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:06,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 13:27:06,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-09 13:27:06,304 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-09 13:27:06,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 13:27:06,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 13:27:06,317 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-09 13:27:06,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:27:06,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:27:06,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:27:06,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:27:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:27:06,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:27:06,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:27:06,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:27:06,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 13:27:06,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 13:27:06,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:06,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 13:27:06,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-09 13:27:06,721 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-09 13:27:06,723 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-09 13:27:06,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:06,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 13:27:06,727 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-09 13:27:06,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:27:06,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:27:06,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2018-12-09 13:27:06,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 13:27:06,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 13:27:06,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2018-12-09 13:27:06,836 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 16 states. [2018-12-09 13:27:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:27:09,546 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-09 13:27:09,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 13:27:09,547 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-12-09 13:27:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:27:09,547 INFO L225 Difference]: With dead ends: 105 [2018-12-09 13:27:09,547 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 13:27:09,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=155, Invalid=718, Unknown=1, NotChecked=56, Total=930 [2018-12-09 13:27:09,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 13:27:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-12-09 13:27:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 13:27:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-09 13:27:09,549 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 47 [2018-12-09 13:27:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:27:09,550 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-09 13:27:09,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 13:27:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-09 13:27:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 13:27:09,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:27:09,550 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-09 13:27:09,550 INFO L423 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:27:09,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:27:09,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1316705324, now seen corresponding path program 1 times [2018-12-09 13:27:09,551 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:27:09,551 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:27:09,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:27:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:27:09,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:27:09,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:27:09,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:09,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:09,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 13:27:09,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:27:09,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:27:09,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:09,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:09,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:09,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-12-09 13:27:10,276 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-09 13:27:13,052 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 13:27:15,055 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-09 13:27:15,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:15,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:15,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:15,071 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-09 13:27:15,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:15,109 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-09 13:27:15,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:15,115 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-09 13:27:15,115 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:15,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:15,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: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:27:15,145 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:38 [2018-12-09 13:27:15,485 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-09 13:27:15,487 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-09 13:27:15,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:15,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:15,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 13:27:15,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2018-12-09 13:27:15,554 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-09 13:27:15,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:27:15,983 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-09 13:27:16,120 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:16,121 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:44, output treesize:1 [2018-12-09 13:27:22,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:27:22,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:27:22,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:27:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:27:22,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:27:22,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:27:22,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:22,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:22,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 13:27:22,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:27:22,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:27:22,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:22,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:22,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:22,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-09 13:27:22,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:22,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:22,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2018-12-09 13:27:22,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:22,562 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-09 13:27:22,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:22,568 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 28 treesize of output 37 [2018-12-09 13:27:22,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:22,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:22,592 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-09 13:27:22,592 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:29 [2018-12-09 13:27:23,107 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-09 13:27:23,109 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-09 13:27:23,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:23,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:23,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:27:23,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2018-12-09 13:27:23,159 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-09 13:27:23,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:27:23,498 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:23,498 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:37, output treesize:1 [2018-12-09 13:27:27,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:27:27,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2018-12-09 13:27:27,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 13:27:27,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 13:27:27,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=717, Unknown=5, NotChecked=110, Total=930 [2018-12-09 13:27:27,981 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 25 states. [2018-12-09 13:27:42,467 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-12-09 13:27:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:27:48,081 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-12-09 13:27:48,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 13:27:48,082 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-12-09 13:27:48,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:27:48,082 INFO L225 Difference]: With dead ends: 131 [2018-12-09 13:27:48,082 INFO L226 Difference]: Without dead ends: 131 [2018-12-09 13:27:48,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=161, Invalid=1102, Unknown=5, NotChecked=138, Total=1406 [2018-12-09 13:27:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-09 13:27:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2018-12-09 13:27:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-09 13:27:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-12-09 13:27:48,085 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 47 [2018-12-09 13:27:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:27:48,085 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-12-09 13:27:48,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 13:27:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-12-09 13:27:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 13:27:48,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:27:48,085 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-09 13:27:48,086 INFO L423 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:27:48,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:27:48,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1013558168, now seen corresponding path program 1 times [2018-12-09 13:27:48,086 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:27:48,086 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:27:48,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:27:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:27:48,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:27:48,145 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-09 13:27:48,146 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:27:48,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:27:48,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 13:27:48,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 13:27:48,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 13:27:48,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 13:27:48,147 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 5 states. [2018-12-09 13:27:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:27:48,153 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-12-09 13:27:48,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 13:27:48,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 13:27:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:27:48,154 INFO L225 Difference]: With dead ends: 121 [2018-12-09 13:27:48,154 INFO L226 Difference]: Without dead ends: 121 [2018-12-09 13:27:48,154 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-09 13:27:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-09 13:27:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-12-09 13:27:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-09 13:27:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-12-09 13:27:48,156 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 46 [2018-12-09 13:27:48,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:27:48,156 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-12-09 13:27:48,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 13:27:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-12-09 13:27:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 13:27:48,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:27:48,157 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-09 13:27:48,157 INFO L423 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:27:48,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:27:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash -760504019, now seen corresponding path program 1 times [2018-12-09 13:27:48,157 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:27:48,157 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:27:48,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:27:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:27:48,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:27:48,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 13:27:48,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 13:27:48,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 13:27:48,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 13:27:48,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-12-09 13:27:48,293 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-09 13:27:48,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 13:27:48,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,303 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-09 13:27:48,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 13:27:48,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,308 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-09 13:27:48,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-09 13:27:48,316 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-09 13:27:48,316 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:27:48,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:27:48,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:27:48,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:27:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:27:48,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:27:48,318 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 6 states. [2018-12-09 13:27:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:27:48,406 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-12-09 13:27:48,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 13:27:48,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-09 13:27:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:27:48,407 INFO L225 Difference]: With dead ends: 102 [2018-12-09 13:27:48,407 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 13:27:48,408 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-09 13:27:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 13:27:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-09 13:27:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 13:27:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-12-09 13:27:48,409 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 47 [2018-12-09 13:27:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:27:48,409 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-12-09 13:27:48,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:27:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-12-09 13:27:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 13:27:48,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:27:48,410 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-09 13:27:48,410 INFO L423 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:27:48,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:27:48,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1964684199, now seen corresponding path program 1 times [2018-12-09 13:27:48,410 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:27:48,410 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:27:48,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:27:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:27:48,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:27:48,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2018-12-09 13:27:48,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:48,542 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-09 13:27:48,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,549 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-09 13:27:48,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:48,557 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-09 13:27:48,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 13:27:48,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:27:48,570 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-09 13:27:48,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-09 13:27:48,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:27:48,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:27:48,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:48,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-12-09 13:27:57,581 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 13:27:57,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-12-09 13:27:57,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:27:57,602 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-09 13:27:57,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:57,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:57,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:57,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-12-09 13:27:57,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 33 treesize of output 27 [2018-12-09 13:27:57,637 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-09 13:27:57,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:27:57,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:57,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:27:57,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:12 [2018-12-09 13:27:59,670 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_19_#t~mem46.base_11| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_probe_19_#t~mem46.base_11|)) (= (store |c_old(#valid)| |v_probe_19_#t~mem46.base_11| (_ bv0 1)) |c_#valid|))) is different from true [2018-12-09 13:28:02,299 WARN L180 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-09 13:28:03,697 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_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_19_#t~mem46.base_11|) (_ bv0 1)) (= |c_#valid| (store (store .cse0 |v_probe_19_#t~mem46.base_11| (_ bv0 1)) |v_entry_point_~#a19~0.base_13| (_ bv0 1)))))) is different from true [2018-12-09 13:28:05,768 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-09 13:28:05,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:28:06,034 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 13:28:06,277 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-09 13:28:06,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 13:28:06,289 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-09 13:28:06,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:28:06,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:28:06,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:28:06,300 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-09 13:28:06,300 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 [2018-12-09 13:28:08,302 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_probe_19_~a.base_49 (_ BitVec 32)) (|v_probe_19_#t~ret42.base_38| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| v_probe_19_~a.base_49 (_ bv1 1)))) (or (not (= (select |c_#valid| v_probe_19_~a.base_49) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 |v_probe_19_#t~ret42.base_38|))) (= |c_old(#valid)| (store (store .cse0 |v_probe_19_#t~ret42.base_38| (_ bv0 1)) v_probe_19_~a.base_49 (_ bv0 1)))))) is different from false [2018-12-09 13:28:08,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:28:08,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:28:08,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:28:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:28:08,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:28:11,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:28:11,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:28:11,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:28:11,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:28:11,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:28:11,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-12-09 13:28:12,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-12-09 13:28:12,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:28:12,023 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-09 13:28:12,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:28:12,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:28:12,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:28:12,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2018-12-09 13:28:12,055 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-09 13:28:12,057 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-09 13:28:12,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:28:12,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:28:12,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:28:12,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:12 [2018-12-09 13:28:12,705 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_19_#t~mem46.base_16| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v_probe_19_#t~mem46.base_16| (_ bv0 1))) (= (select |c_old(#valid)| |v_probe_19_#t~mem46.base_16|) (_ bv0 1)))) is different from true [2018-12-09 13:28:16,751 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_entry_point_~#a19~0.base_19| (_ BitVec 32)) (|v_probe_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_19_#t~mem46.base_11| (_ bv0 1)) |v_entry_point_~#a19~0.base_19| (_ bv0 1))) (= (_ bv0 1) (select .cse0 |v_probe_19_#t~mem46.base_11|)) (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_19|) (_ bv0 1))))) is different from true [2018-12-09 13:28:16,755 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-09 13:28:16,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:28:16,979 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 13:28:17,187 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-09 13:28:17,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 13:28:17,201 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-09 13:28:17,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:28:17,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:28:17,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:28:17,213 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-09 13:28:17,213 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:45, output treesize:28 [2018-12-09 13:28:19,216 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_probe_19_~a.base_56 (_ BitVec 32)) (|v_probe_19_#t~ret42.base_48| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| v_probe_19_~a.base_56 (_ bv1 1)))) (or (not (= (select |c_#valid| v_probe_19_~a.base_56) (_ bv0 1))) (not (= (select .cse0 |v_probe_19_#t~ret42.base_48|) (_ bv0 1))) (= (store (store .cse0 |v_probe_19_#t~ret42.base_48| (_ bv0 1)) v_probe_19_~a.base_56 (_ bv0 1)) |c_old(#valid)|)))) is different from false [2018-12-09 13:28:19,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:28:19,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 23 [2018-12-09 13:28:19,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 13:28:19,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 13:28:19,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=315, Unknown=15, NotChecked=246, Total=650 [2018-12-09 13:28:19,234 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 24 states. [2018-12-09 13:29:27,253 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 13:29:41,328 WARN L180 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2018-12-09 13:29:49,103 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2018-12-09 13:30:10,186 WARN L180 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2018-12-09 13:30:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:30:16,275 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-09 13:30:16,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 13:30:16,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-12-09 13:30:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:30:16,275 INFO L225 Difference]: With dead ends: 106 [2018-12-09 13:30:16,275 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 13:30:16,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 74.6s TimeCoverageRelationStatistics Valid=131, Invalid=677, Unknown=28, NotChecked=354, Total=1190 [2018-12-09 13:30:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 13:30:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-09 13:30:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 13:30:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-12-09 13:30:16,277 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 45 [2018-12-09 13:30:16,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:30:16,277 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-12-09 13:30:16,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 13:30:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-12-09 13:30:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 13:30:16,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:30:16,278 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-09 13:30:16,278 INFO L423 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:30:16,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:30:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash -150775570, now seen corresponding path program 1 times [2018-12-09 13:30:16,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:30:16,278 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:30:16,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:30:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:30:16,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:30:16,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:30:16,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:16,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:16,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 13:30:16,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:30:16,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:30:16,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:16,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:16,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:16,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2018-12-09 13:30:18,302 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-09 13:30:18,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:18,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:18,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:18,317 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 46 [2018-12-09 13:30:18,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:18,347 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-09 13:30:18,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:18,351 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-09 13:30:18,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:18,358 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:18,388 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-09 13:30:18,388 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:55 [2018-12-09 13:30:18,509 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 28 treesize of output 21 [2018-12-09 13:30:18,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:18,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:18,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:24 [2018-12-09 13:30:18,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:18,692 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 58 [2018-12-09 13:30:18,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:18,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:18,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:53 [2018-12-09 13:30:18,798 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-09 13:30:18,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:18,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-12-09 13:30:18,802 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:18,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:18,815 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-09 13:30:18,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2018-12-09 13:30:18,862 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-09 13:30:18,862 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:30:18,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:30:18,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-09 13:30:18,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 13:30:18,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 13:30:18,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=366, Unknown=1, NotChecked=38, Total=462 [2018-12-09 13:30:18,865 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 22 states. [2018-12-09 13:30:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:30:20,112 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-12-09 13:30:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 13:30:20,112 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-12-09 13:30:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:30:20,113 INFO L225 Difference]: With dead ends: 83 [2018-12-09 13:30:20,113 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 13:30:20,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=121, Invalid=812, Unknown=1, NotChecked=58, Total=992 [2018-12-09 13:30:20,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 13:30:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-09 13:30:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 13:30:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-12-09 13:30:20,116 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 48 [2018-12-09 13:30:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:30:20,116 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-12-09 13:30:20,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 13:30:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-12-09 13:30:20,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 13:30:20,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:30:20,117 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-09 13:30:20,117 INFO L423 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:30:20,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:30:20,118 INFO L82 PathProgramCache]: Analyzing trace with hash 32119129, now seen corresponding path program 1 times [2018-12-09 13:30:20,118 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:30:20,118 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:30:20,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:30:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:30:20,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:30:20,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:30:20,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:20,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:20,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 13:30:20,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 13:30:20,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:20,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:30:20,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:30:20,332 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:20,336 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:20,349 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-09 13:30:20,349 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-12-09 13:30:21,949 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 13:30:21,956 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-09 13:30:21,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:21,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-09 13:30:21,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:21,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:21,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:21,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-12-09 13:30:22,014 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-09 13:30:22,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:22,016 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-09 13:30:22,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-12-09 13:30:22,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:22,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:22,066 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-09 13:30:22,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:22,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:22,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2018-12-09 13:30:22,167 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-09 13:30:22,169 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-09 13:30:22,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:22,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:22,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:22,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-12-09 13:30:22,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:22,211 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-09 13:30:22,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:22,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:22,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-09 13:30:22,367 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-09 13:30:22,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:30:22,993 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 13:30:23,105 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-09 13:30:23,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,112 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-09 13:30:23,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,118 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-09 13:30:23,119 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,123 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-09 13:30:23,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 13:30:23,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 13:30:23,133 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,135 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,137 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,141 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:64, output treesize:6 [2018-12-09 13:30:23,298 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-09 13:30:23,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,326 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 21 treesize of output 14 [2018-12-09 13:30:23,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,347 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-09 13:30:23,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2018-12-09 13:30:23,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:30:23,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:30:23,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:30:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:30:23,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:30:23,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 13:30:23,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 13:30:23,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:30:23,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:30:23,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-09 13:30:23,491 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-09 13:30:23,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:23,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-09 13:30:23,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,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-09 13:30:23,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-12-09 13:30:23,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 11 treesize of output 1 [2018-12-09 13:30:23,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,518 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-09 13:30:23,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-12-09 13:30:23,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:23,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:23,575 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-09 13:30:23,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-12-09 13:30:23,584 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-09 13:30:23,586 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-09 13:30:23,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-12-09 13:30:23,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:23,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 13:30:23,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:23,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-09 13:30:23,639 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-09 13:30:23,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:30:23,946 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-09 13:30:23,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,952 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-09 13:30:23,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,957 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-09 13:30:23,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-09 13:30:23,967 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-09 13:30:23,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,969 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:23,974 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:52, output treesize:6 [2018-12-09 13:30:24,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-12-09 13:30:24,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:24,087 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 14 [2018-12-09 13:30:24,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:24,111 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-09 13:30:24,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2018-12-09 13:30:24,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:30:24,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-12-09 13:30:24,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 13:30:24,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 13:30:24,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2018-12-09 13:30:24,181 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 20 states. [2018-12-09 13:30:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:30:27,899 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-09 13:30:27,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 13:30:27,899 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-12-09 13:30:27,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:30:27,900 INFO L225 Difference]: With dead ends: 91 [2018-12-09 13:30:27,900 INFO L226 Difference]: Without dead ends: 91 [2018-12-09 13:30:27,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=236, Invalid=1834, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 13:30:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-09 13:30:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-12-09 13:30:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 13:30:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-12-09 13:30:27,902 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 50 [2018-12-09 13:30:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:30:27,902 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-12-09 13:30:27,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 13:30:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-12-09 13:30:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 13:30:27,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:30:27,902 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-09 13:30:27,903 INFO L423 AbstractCegarLoop]: === Iteration 33 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:30:27,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:30:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash 32119130, now seen corresponding path program 1 times [2018-12-09 13:30:27,903 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:30:27,903 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:30:27,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:30:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:30:28,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:30:28,078 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-09 13:30:28,078 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:30:28,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:30:28,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 13:30:28,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 13:30:28,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 13:30:28,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 13:30:28,081 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 9 states. [2018-12-09 13:30:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:30:28,307 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-09 13:30:28,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 13:30:28,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-09 13:30:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:30:28,308 INFO L225 Difference]: With dead ends: 85 [2018-12-09 13:30:28,308 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 13:30:28,308 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-09 13:30:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 13:30:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-09 13:30:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 13:30:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-12-09 13:30:28,309 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 50 [2018-12-09 13:30:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:30:28,310 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-12-09 13:30:28,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 13:30:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-12-09 13:30:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 13:30:28,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:30:28,310 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-09 13:30:28,310 INFO L423 AbstractCegarLoop]: === Iteration 34 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:30:28,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:30:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash 995692982, now seen corresponding path program 1 times [2018-12-09 13:30:28,310 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:30:28,310 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:30:28,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:30:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:30:28,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:30:28,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 13:30:28,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 13:30:28,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:28,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:28,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:28,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 13:30:28,605 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-09 13:30:28,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 13:30:28,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:28,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:28,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:28,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 13:30:28,626 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-09 13:30:28,626 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:30:28,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:30:28,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 13:30:28,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 13:30:28,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 13:30:28,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-09 13:30:28,628 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 16 states. [2018-12-09 13:30:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:30:31,305 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-09 13:30:31,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 13:30:31,305 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-12-09 13:30:31,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:30:31,306 INFO L225 Difference]: With dead ends: 88 [2018-12-09 13:30:31,306 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 13:30:31,306 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-09 13:30:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 13:30:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-09 13:30:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 13:30:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-12-09 13:30:31,307 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 51 [2018-12-09 13:30:31,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:30:31,308 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-12-09 13:30:31,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 13:30:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-12-09 13:30:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 13:30:31,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:30:31,308 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-09 13:30:31,308 INFO L423 AbstractCegarLoop]: === Iteration 35 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:30:31,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:30:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash 801711417, now seen corresponding path program 1 times [2018-12-09 13:30:31,308 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:30:31,308 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:30:31,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:30:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:30:31,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:30:31,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 6 treesize of output 5 [2018-12-09 13:30:31,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:31,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:31,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 13:30:31,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:30:31,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:30:31,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:31,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:31,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:31,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-12-09 13:30:33,641 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-09 13:30:33,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:33,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:33,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:33,659 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-09 13:30:33,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:33,687 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-09 13:30:33,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:33,692 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-09 13:30:33,692 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:33,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:33,724 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-09 13:30:33,724 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:52 [2018-12-09 13:30:34,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:34,116 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 13:30:34,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:34,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 83 [2018-12-09 13:30:34,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 13:30:34,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:30:34,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:75 [2018-12-09 13:30:34,442 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-09 13:30:34,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:34,445 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-09 13:30:34,445 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:34,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:34,478 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-09 13:30:34,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:34,481 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-09 13:30:34,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:34,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:34,501 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-09 13:30:34,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:38 [2018-12-09 13:30:34,571 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-09 13:30:34,571 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:30:34,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:30:34,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-12-09 13:30:34,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 13:30:34,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 13:30:34,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=409, Unknown=1, NotChecked=40, Total=506 [2018-12-09 13:30:34,573 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 23 states. [2018-12-09 13:30:36,121 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-09 13:30:36,396 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-09 13:30:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:30:36,653 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-12-09 13:30:36,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 13:30:36,653 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-12-09 13:30:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:30:36,654 INFO L225 Difference]: With dead ends: 90 [2018-12-09 13:30:36,654 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 13:30:36,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=119, Invalid=814, Unknown=1, NotChecked=58, Total=992 [2018-12-09 13:30:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 13:30:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-09 13:30:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 13:30:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-12-09 13:30:36,655 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 52 [2018-12-09 13:30:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:30:36,656 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-12-09 13:30:36,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 13:30:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-12-09 13:30:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 13:30:36,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:30:36,656 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-09 13:30:36,656 INFO L423 AbstractCegarLoop]: === Iteration 36 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:30:36,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:30:36,656 INFO L82 PathProgramCache]: Analyzing trace with hash 798875024, now seen corresponding path program 1 times [2018-12-09 13:30:36,656 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:30:36,657 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:30:36,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:30:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:30:36,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:30:36,722 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-09 13:30:36,722 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:30:36,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:30:36,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:30:36,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:30:36,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:30:36,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:30:36,724 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 6 states. [2018-12-09 13:30:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:30:36,739 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-09 13:30:36,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 13:30:36,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-09 13:30:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:30:36,740 INFO L225 Difference]: With dead ends: 79 [2018-12-09 13:30:36,740 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 13:30:36,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 13:30:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 13:30:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-12-09 13:30:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 13:30:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-09 13:30:36,741 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 56 [2018-12-09 13:30:36,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:30:36,742 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-09 13:30:36,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:30:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-09 13:30:36,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 13:30:36,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:30:36,742 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-09 13:30:36,742 INFO L423 AbstractCegarLoop]: === Iteration 37 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:30:36,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:30:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1003425580, now seen corresponding path program 1 times [2018-12-09 13:30:36,742 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:30:36,742 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/cvc4 Starting monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 13:30:36,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:30:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:30:36,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:30:36,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, 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-09 13:30:36,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:36,921 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-09 13:30:36,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 13:30:36,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:30:36,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 13:30:36,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:36,930 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-09 13:30:36,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:36,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:36,946 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-09 13:30:36,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-09 13:30:37,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:30:37,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:30:37,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:37,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:37,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:37,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-12-09 13:30:39,170 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-09 13:30:39,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-12-09 13:30:39,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:39,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:39,191 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 43 treesize of output 64 [2018-12-09 13:30:39,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:39,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:39,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:39,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:55 [2018-12-09 13:30:39,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:39,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-12-09 13:30:39,328 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 41 treesize of output 35 [2018-12-09 13:30:39,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:39,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:30:39,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:39,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:35 [2018-12-09 13:30:39,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-12-09 13:30:39,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 13:30:39,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:39,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-12-09 13:30:41,674 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 13:30:41,849 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 58 treesize of output 46 [2018-12-09 13:30:41,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:41,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:30:41,855 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 46 treesize of output 33 [2018-12-09 13:30:41,856 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:41,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:41,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:30:41,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:30 [2018-12-09 13:30:42,802 WARN L180 SmtUtils]: Spent 851.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 13:30:43,985 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_19_#t~mem46.base_21| (_ BitVec 32)) (v_arrayElimCell_95 (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |v_probe_19_#t~mem46.base_21| (_ bv1 1)))) (let ((.cse0 (store .cse1 v_arrayElimCell_95 (_ bv0 1)))) (and (= (_ bv1 1) (select .cse0 |c_probe_19_#in~a.base|)) (= |c_#valid| (store .cse0 |v_probe_19_#t~mem46.base_21| (_ bv0 1))) (= (_ bv0 1) (select |c_old(#valid)| |v_probe_19_#t~mem46.base_21|)) (= (_ bv0 1) (select .cse1 v_arrayElimCell_95)))))) is different from true [2018-12-09 13:30:48,072 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-09 13:30:50,079 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_probe_19_#t~mem46.base_21| (_ BitVec 32)) (|v_entry_point_~#a19~0.base_27| (_ BitVec 32)) (v_arrayElimCell_95 (_ BitVec 32))) (let ((.cse2 (store |c_old(#valid)| |v_entry_point_~#a19~0.base_27| (_ bv1 1)))) (let ((.cse0 (store .cse2 |v_probe_19_#t~mem46.base_21| (_ bv1 1)))) (let ((.cse1 (store .cse0 v_arrayElimCell_95 (_ bv0 1)))) (and (= (select .cse0 v_arrayElimCell_95) (_ bv0 1)) (= (bvadd (select .cse1 |v_entry_point_~#a19~0.base_27|) (_ bv1 1)) (_ bv0 1)) (= (select .cse2 |v_probe_19_#t~mem46.base_21|) (_ bv0 1)) (= (select |c_old(#valid)| |v_entry_point_~#a19~0.base_27|) (_ bv0 1)) (= |c_#valid| (store (store .cse1 |v_probe_19_#t~mem46.base_21| (_ bv0 1)) |v_entry_point_~#a19~0.base_27| (_ bv0 1)))))))) is different from true [2018-12-09 13:30:50,234 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-09 13:30:50,235 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:30:50,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:30:50,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-12-09 13:30:50,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 13:30:50,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 13:30:50,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=439, Unknown=4, NotChecked=132, Total=650 [2018-12-09 13:30:50,237 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 26 states. [2018-12-09 13:31:30,123 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-12-09 13:31:45,322 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 27 [2018-12-09 13:31:51,730 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-12-09 13:31:57,231 WARN L180 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-12-09 13:32:03,409 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-12-09 13:32:20,258 WARN L180 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-12-09 13:32:22,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:32:22,349 INFO L93 Difference]: Finished difference Result 80 states and 79 transitions. [2018-12-09 13:32:22,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 13:32:22,350 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-12-09 13:32:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:32:22,350 INFO L225 Difference]: With dead ends: 80 [2018-12-09 13:32:22,350 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 13:32:22,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 75.9s TimeCoverageRelationStatistics Valid=162, Invalid=1091, Unknown=19, NotChecked=210, Total=1482 [2018-12-09 13:32:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 13:32:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-09 13:32:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 13:32:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2018-12-09 13:32:22,351 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 57 [2018-12-09 13:32:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:32:22,352 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2018-12-09 13:32:22,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 13:32:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2018-12-09 13:32:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 13:32:22,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:32:22,352 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, 1, 1] [2018-12-09 13:32:22,352 INFO L423 AbstractCegarLoop]: === Iteration 38 === [disconnect_19Err1REQUIRES_VIOLATION, disconnect_19Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_19Err0REQUIRES_VIOLATION, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr0REQUIRES_VIOLATION, f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE, f19_undoErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, f19Err0REQUIRES_VIOLATION, f19Err1REQUIRES_VIOLATION, f19Err2REQUIRES_VIOLATION, f19Err3REQUIRES_VIOLATION, probe_19Err3REQUIRES_VIOLATION, probe_19Err2REQUIRES_VIOLATION, probe_19Err1REQUIRES_VIOLATION, probe_19Err7ASSERT_VIOLATIONMEMORY_FREE, probe_19Err0REQUIRES_VIOLATION, probe_19Err5REQUIRES_VIOLATION, probe_19Err6ASSERT_VIOLATIONMEMORY_FREE, probe_19Err4REQUIRES_VIOLATION]=== [2018-12-09 13:32:22,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:32:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 347050180, now seen corresponding path program 1 times [2018-12-09 13:32:22,353 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 13:32:22,353 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/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-09 13:32:22,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:32:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:32:22,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:32:22,571 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-09 13:32:22,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:22,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-09 13:32:22,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 13:32:22,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:32:22,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2018-12-09 13:32:22,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:22,588 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-09 13:32:22,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 13:32:22,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:32:22,603 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-09 13:32:22,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-09 13:32:22,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 13:32:22,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 13:32:22,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:32:22,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:32:22,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:32:22,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-12-09 13:32:24,851 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-09 13:32:24,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-12-09 13:32:24,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:24,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:24,869 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 55 treesize of output 78 [2018-12-09 13:32:24,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:32:24,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:32:24,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-09 13:32:24,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:63 [2018-12-09 13:32:25,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:25,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2018-12-09 13:32:25,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:25,043 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 31 treesize of output 47 [2018-12-09 13:32:25,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:32:25,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:32:25,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:25,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:25,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:25,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 74 [2018-12-09 13:32:25,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 64 [2018-12-09 13:32:25,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 13:32:25,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:32:25,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 13:32:25,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:48 [2018-12-09 13:32:25,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:25,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-12-09 13:32:25,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:25,412 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 13:32:25,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2018-12-09 13:32:25,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:32:25,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:32:25,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:32:25,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-12-09 13:32:25,905 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 94 treesize of output 80 [2018-12-09 13:32:25,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 50 [2018-12-09 13:32:25,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 13:32:26,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:32:26,018 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2018-12-09 13:32:26,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 13:32:26,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-12-09 13:32:26,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 13:32:26,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 13:32:26,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 13:32:26,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:87 [2018-12-09 13:32:34,385 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2018-12-09 13:33:12,703 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-09 13:33:12,703 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 13:33:12,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:33:12,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-12-09 13:33:12,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 13:33:12,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 13:33:12,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=599, Unknown=22, NotChecked=50, Total=756 [2018-12-09 13:33:12,706 INFO L87 Difference]: Start difference. First operand 61 states and 60 transitions. Second operand 28 states. [2018-12-09 13:34:21,278 WARN L180 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-12-09 13:35:11,388 WARN L180 SmtUtils]: Spent 890.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 13:35:15,853 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2018-12-09 13:35:17,759 WARN L180 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-12-09 13:35:45,617 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-09 13:35:45,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:35:45,732 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2018-12-09 13:35:45,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 13:35:45,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-12-09 13:35:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:35:45,733 INFO L225 Difference]: With dead ends: 60 [2018-12-09 13:35:45,733 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 13:35:45,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 91.0s TimeCoverageRelationStatistics Valid=201, Invalid=1406, Unknown=37, NotChecked=78, Total=1722 [2018-12-09 13:35:45,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 13:35:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 13:35:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 13:35:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 13:35:45,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-12-09 13:35:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:35:45,734 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 13:35:45,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 13:35:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 13:35:45,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 13:35:45,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:35:45 BoogieIcfgContainer [2018-12-09 13:35:45,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 13:35:45,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 13:35:45,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 13:35:45,737 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 13:35:45,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:21:49" (3/4) ... [2018-12-09 13:35:45,739 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 13:35:45,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure disconnect_19 [2018-12-09 13:35:45,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2018-12-09 13:35:45,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 13:35:45,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f19_undo [2018-12-09 13:35:45,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 13:35:45,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2018-12-09 13:35:45,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g19 [2018-12-09 13:35:45,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f19 [2018-12-09 13:35:45,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure probe_19 [2018-12-09 13:35:45,748 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-09 13:35:45,748 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 13:35:45,748 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 13:35:45,774 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_27029956-b178-44b8-9a5f-c38aa1975938/bin-2019/utaipan/witness.graphml [2018-12-09 13:35:45,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 13:35:45,775 INFO L168 Benchmark]: Toolchain (without parser) took 837316.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:35:45,775 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:35:45,775 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-09 13:35:45,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:35:45,776 INFO L168 Benchmark]: Boogie Preprocessor took 18.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:35:45,776 INFO L168 Benchmark]: RCFGBuilder took 264.62 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.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-12-09 13:35:45,776 INFO L168 Benchmark]: TraceAbstraction took 836605.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -12.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:35:45,776 INFO L168 Benchmark]: Witness Printer took 37.70 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: 29.1 kB). Peak memory consumption was 29.1 kB. Max. memory is 11.5 GB. [2018-12-09 13:35:45,777 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.19 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 365.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.96 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.26 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 264.62 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.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 836605.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -12.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 37.70 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: 29.1 kB). Peak memory consumption was 29.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1478]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1478]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1478]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1478]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1447]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1447]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1447]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1447]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1490]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1440]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1440]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1441]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1441]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1458]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1458]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1457]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1472]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1457]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1472]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1472]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1472]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 85 locations, 21 error locations. SAFE Result, 836.5s OverallTime, 38 OverallIterations, 2 TraceHistogramMax, 656.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2704 SDtfs, 2884 SDslu, 13671 SDs, 0 SdLazy, 12219 SolverSat, 939 SolverUnsat, 269 SolverUnknown, 0 SolverNotchecked, 473.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2352 GetRequests, 1594 SyntacticMatches, 55 SemanticMatches, 703 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 3477 ImplicationChecksByTransitivity, 346.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=12, 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, 38 MinimizatonAttempts, 394 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 175.8s InterpolantComputationTime, 1907 NumberOfCodeBlocks, 1907 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1861 ConstructedInterpolants, 366 QuantifiedInterpolants, 841335 SizeOfPredicates, 386 NumberOfNonLiveVariables, 7598 ConjunctsInSsa, 971 ConjunctsInUnsatCore, 46 InterpolantComputations, 31 PerfectInterpolantSequences, 130/164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...