./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/960521-1_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/960521-1_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 eb7eb63578fa102ef7ac00d7bef40ee74bd144d9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/960521-1_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 eb7eb63578fa102ef7ac00d7bef40ee74bd144d9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:02:22,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:02:22,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:02:22,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:02:22,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:02:22,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:02:22,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:02:22,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:02:22,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:02:22,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:02:22,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:02:22,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:02:22,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:02:22,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:02:22,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:02:22,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:02:22,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:02:22,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:02:22,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:02:22,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:02:22,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:02:22,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:02:22,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:02:22,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:02:22,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:02:22,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:02:22,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:02:22,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:02:22,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:02:22,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:02:22,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:02:22,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:02:22,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:02:22,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:02:22,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:02:22,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:02:22,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:02:22,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:02:22,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:02:22,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:02:22,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:02:22,440 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 14:02:22,452 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:02:22,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:02:22,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:02:22,453 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:02:22,454 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:02:22,454 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:02:22,454 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:02:22,454 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:02:22,454 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:02:22,454 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:02:22,455 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:02:22,455 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:02:22,455 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:02:22,455 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:02:22,455 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:02:22,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:02:22,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:02:22,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:02:22,456 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:02:22,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:02:22,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:02:22,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:02:22,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:02:22,457 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:02:22,457 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:02:22,457 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:02:22,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:02:22,458 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:02:22,458 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:02:22,458 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:02:22,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:02:22,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:02:22,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:02:22,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:02:22,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:02:22,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:02:22,459 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:02:22,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:02:22,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:02:22,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:02:22,460 INFO L138 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/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 -> eb7eb63578fa102ef7ac00d7bef40ee74bd144d9 [2019-12-07 14:02:22,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:02:22,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:02:22,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:02:22,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:02:22,574 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:02:22,575 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/960521-1_1-2.i [2019-12-07 14:02:22,610 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/data/7b82fa6c6/47fe4ab3a6694af193145bfae5aa6fc2/FLAG5d402c42a [2019-12-07 14:02:23,078 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:02:23,078 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/sv-benchmarks/c/list-ext-properties/960521-1_1-2.i [2019-12-07 14:02:23,088 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/data/7b82fa6c6/47fe4ab3a6694af193145bfae5aa6fc2/FLAG5d402c42a [2019-12-07 14:02:23,096 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/data/7b82fa6c6/47fe4ab3a6694af193145bfae5aa6fc2 [2019-12-07 14:02:23,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:02:23,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:02:23,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:02:23,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:02:23,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:02:23,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:02:23" (1/1) ... [2019-12-07 14:02:23,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68125288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23, skipping insertion in model container [2019-12-07 14:02:23,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:02:23" (1/1) ... [2019-12-07 14:02:23,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:02:23,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:02:23,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:02:23,330 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:02:23,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:02:23,388 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:02:23,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23 WrapperNode [2019-12-07 14:02:23,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:02:23,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:02:23,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:02:23,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:02:23,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23" (1/1) ... [2019-12-07 14:02:23,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23" (1/1) ... [2019-12-07 14:02:23,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:02:23,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:02:23,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:02:23,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:02:23,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23" (1/1) ... [2019-12-07 14:02:23,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23" (1/1) ... [2019-12-07 14:02:23,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23" (1/1) ... [2019-12-07 14:02:23,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23" (1/1) ... [2019-12-07 14:02:23,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23" (1/1) ... [2019-12-07 14:02:23,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23" (1/1) ... [2019-12-07 14:02:23,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23" (1/1) ... [2019-12-07 14:02:23,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:02:23,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:02:23,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:02:23,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:02:23,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:02:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 14:02:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:02:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:02:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:02:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:02:23,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:02:23,719 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:02:23,719 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 14:02:23,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:02:23 BoogieIcfgContainer [2019-12-07 14:02:23,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:02:23,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:02:23,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:02:23,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:02:23,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:02:23" (1/3) ... [2019-12-07 14:02:23,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601382c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:02:23, skipping insertion in model container [2019-12-07 14:02:23,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:23" (2/3) ... [2019-12-07 14:02:23,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601382c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:02:23, skipping insertion in model container [2019-12-07 14:02:23,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:02:23" (3/3) ... [2019-12-07 14:02:23,724 INFO L109 eAbstractionObserver]: Analyzing ICFG 960521-1_1-2.i [2019-12-07 14:02:23,731 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:02:23,735 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 14:02:23,742 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 14:02:23,754 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:02:23,754 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:02:23,754 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:02:23,755 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:02:23,755 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:02:23,755 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:02:23,755 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:02:23,755 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:02:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-12-07 14:02:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 14:02:23,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:23,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 14:02:23,771 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:23,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:23,775 INFO L82 PathProgramCache]: Analyzing trace with hash 3767634, now seen corresponding path program 1 times [2019-12-07 14:02:23,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:23,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891588630] [2019-12-07 14:02:23,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:23,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891588630] [2019-12-07 14:02:23,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:23,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:02:23,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528738446] [2019-12-07 14:02:23,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 14:02:23,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:23,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 14:02:23,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 14:02:23,870 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2019-12-07 14:02:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:23,880 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-12-07 14:02:23,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 14:02:23,881 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-07 14:02:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:23,887 INFO L225 Difference]: With dead ends: 50 [2019-12-07 14:02:23,887 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 14:02:23,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 14:02:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 14:02:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 14:02:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 14:02:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-12-07 14:02:23,912 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 4 [2019-12-07 14:02:23,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:23,912 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-12-07 14:02:23,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 14:02:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-12-07 14:02:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:02:23,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:23,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:02:23,913 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:23,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:23,913 INFO L82 PathProgramCache]: Analyzing trace with hash 116582307, now seen corresponding path program 1 times [2019-12-07 14:02:23,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:23,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850764263] [2019-12-07 14:02:23,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:23,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850764263] [2019-12-07 14:02:23,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:23,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:02:23,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237658481] [2019-12-07 14:02:23,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:02:23,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:23,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:02:23,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:02:23,952 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2019-12-07 14:02:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:23,986 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-12-07 14:02:23,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:02:23,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:02:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:23,987 INFO L225 Difference]: With dead ends: 48 [2019-12-07 14:02:23,987 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 14:02:23,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:02:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 14:02:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 14:02:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 14:02:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-12-07 14:02:23,992 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 5 [2019-12-07 14:02:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:23,992 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-12-07 14:02:23,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:02:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-12-07 14:02:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:02:23,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:23,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:02:23,993 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:23,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:23,993 INFO L82 PathProgramCache]: Analyzing trace with hash 116582308, now seen corresponding path program 1 times [2019-12-07 14:02:23,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:23,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273482603] [2019-12-07 14:02:23,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:24,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273482603] [2019-12-07 14:02:24,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:24,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:02:24,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512691685] [2019-12-07 14:02:24,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:02:24,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:02:24,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:02:24,032 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 4 states. [2019-12-07 14:02:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:24,071 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-12-07 14:02:24,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:02:24,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 14:02:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:24,072 INFO L225 Difference]: With dead ends: 47 [2019-12-07 14:02:24,072 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 14:02:24,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:02:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 14:02:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-12-07 14:02:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 14:02:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-12-07 14:02:24,078 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 5 [2019-12-07 14:02:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:24,078 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-12-07 14:02:24,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:02:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-12-07 14:02:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:02:24,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:24,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:24,079 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:24,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:24,079 INFO L82 PathProgramCache]: Analyzing trace with hash 366524148, now seen corresponding path program 1 times [2019-12-07 14:02:24,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:24,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524238855] [2019-12-07 14:02:24,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:24,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524238855] [2019-12-07 14:02:24,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:24,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:02:24,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287185544] [2019-12-07 14:02:24,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:02:24,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:24,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:02:24,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:02:24,122 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2019-12-07 14:02:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:24,149 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-12-07 14:02:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:02:24,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 14:02:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:24,150 INFO L225 Difference]: With dead ends: 44 [2019-12-07 14:02:24,150 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 14:02:24,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:02:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 14:02:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 14:02:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 14:02:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-12-07 14:02:24,154 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 7 [2019-12-07 14:02:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:24,154 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-12-07 14:02:24,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:02:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-12-07 14:02:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:02:24,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:24,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:24,154 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:24,155 INFO L82 PathProgramCache]: Analyzing trace with hash 366524149, now seen corresponding path program 1 times [2019-12-07 14:02:24,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:24,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720914308] [2019-12-07 14:02:24,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:24,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720914308] [2019-12-07 14:02:24,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:24,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:02:24,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126518185] [2019-12-07 14:02:24,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:02:24,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:24,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:02:24,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:02:24,220 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 6 states. [2019-12-07 14:02:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:24,282 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-12-07 14:02:24,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:02:24,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 14:02:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:24,283 INFO L225 Difference]: With dead ends: 78 [2019-12-07 14:02:24,283 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 14:02:24,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:02:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 14:02:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 44. [2019-12-07 14:02:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 14:02:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-12-07 14:02:24,288 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 7 [2019-12-07 14:02:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:24,288 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-12-07 14:02:24,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:02:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-12-07 14:02:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:02:24,288 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:24,288 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:24,289 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash 42454203, now seen corresponding path program 1 times [2019-12-07 14:02:24,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:24,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83830617] [2019-12-07 14:02:24,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:24,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83830617] [2019-12-07 14:02:24,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683651365] [2019-12-07 14:02:24,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:24,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:02:24,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:24,388 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:24,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:02:24,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2019-12-07 14:02:24,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269037778] [2019-12-07 14:02:24,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:02:24,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:24,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:02:24,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:02:24,406 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 7 states. [2019-12-07 14:02:24,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:24,452 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-12-07 14:02:24,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:02:24,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-07 14:02:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:24,453 INFO L225 Difference]: With dead ends: 82 [2019-12-07 14:02:24,453 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 14:02:24,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:02:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 14:02:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 52. [2019-12-07 14:02:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 14:02:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-12-07 14:02:24,457 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 9 [2019-12-07 14:02:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:24,457 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-12-07 14:02:24,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:02:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-12-07 14:02:24,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:02:24,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:24,458 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:24,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:24,659 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:24,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1316152702, now seen corresponding path program 1 times [2019-12-07 14:02:24,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:24,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303484779] [2019-12-07 14:02:24,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:02:24,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303484779] [2019-12-07 14:02:24,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:24,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:02:24,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817366871] [2019-12-07 14:02:24,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:02:24,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:24,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:02:24,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:02:24,710 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-12-07 14:02:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:24,745 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-12-07 14:02:24,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:02:24,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 14:02:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:24,746 INFO L225 Difference]: With dead ends: 49 [2019-12-07 14:02:24,746 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 14:02:24,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:02:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 14:02:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 14:02:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 14:02:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-12-07 14:02:24,749 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 10 [2019-12-07 14:02:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:24,749 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-12-07 14:02:24,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:02:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-12-07 14:02:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:02:24,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:24,750 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:24,750 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:24,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1316152703, now seen corresponding path program 1 times [2019-12-07 14:02:24,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:24,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979917963] [2019-12-07 14:02:24,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:02:24,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979917963] [2019-12-07 14:02:24,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:24,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:02:24,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183940484] [2019-12-07 14:02:24,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:02:24,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:24,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:02:24,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:02:24,806 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2019-12-07 14:02:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:24,854 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-12-07 14:02:24,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:02:24,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 14:02:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:24,855 INFO L225 Difference]: With dead ends: 44 [2019-12-07 14:02:24,855 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 14:02:24,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:02:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 14:02:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 14:02:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 14:02:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-12-07 14:02:24,859 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 10 [2019-12-07 14:02:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:24,860 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-12-07 14:02:24,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:02:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-12-07 14:02:24,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:02:24,861 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:24,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:24,861 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:24,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2146028126, now seen corresponding path program 1 times [2019-12-07 14:02:24,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:24,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556373868] [2019-12-07 14:02:24,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:02:24,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556373868] [2019-12-07 14:02:24,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:24,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:02:24,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179775251] [2019-12-07 14:02:24,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:02:24,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:24,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:02:24,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:02:24,902 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-12-07 14:02:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:24,954 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-12-07 14:02:24,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:02:24,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:02:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:24,955 INFO L225 Difference]: With dead ends: 66 [2019-12-07 14:02:24,955 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 14:02:24,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:02:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 14:02:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-12-07 14:02:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 14:02:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-12-07 14:02:24,959 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 11 [2019-12-07 14:02:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:24,960 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-12-07 14:02:24,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:02:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-12-07 14:02:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:02:24,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:24,961 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:24,961 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:24,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:24,962 INFO L82 PathProgramCache]: Analyzing trace with hash -224366304, now seen corresponding path program 1 times [2019-12-07 14:02:24,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:24,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896224830] [2019-12-07 14:02:24,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:02:25,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896224830] [2019-12-07 14:02:25,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059929047] [2019-12-07 14:02:25,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:25,047 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 14:02:25,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:25,076 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_21|], 1=[|v_#valid_44|]} [2019-12-07 14:02:25,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:02:25,091 INFO L377 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 13 treesize of output 15 [2019-12-07 14:02:25,092 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:25,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:25,107 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:25,107 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:25,117 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:25,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:02:25,121 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:37 [2019-12-07 14:02:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:25,191 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:25,237 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:02:25,241 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:25,241 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:25,244 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:25,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:02:25,247 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:25,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:25,251 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:25,251 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:02:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:25,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [943380100] [2019-12-07 14:02:25,275 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-12-07 14:02:25,275 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:02:25,278 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:02:25,282 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:02:25,283 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:02:25,679 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:02:26,186 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-12-07 14:02:26,247 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:02:26,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:02:26,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2019-12-07 14:02:26,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370468890] [2019-12-07 14:02:26,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:02:26,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:26,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:02:26,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:02:26,248 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 13 states. [2019-12-07 14:02:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:26,728 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-12-07 14:02:26,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:02:26,729 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-12-07 14:02:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:26,729 INFO L225 Difference]: With dead ends: 96 [2019-12-07 14:02:26,729 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 14:02:26,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2019-12-07 14:02:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 14:02:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 47. [2019-12-07 14:02:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 14:02:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-12-07 14:02:26,733 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 11 [2019-12-07 14:02:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:26,733 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-12-07 14:02:26,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:02:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-12-07 14:02:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:02:26,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:26,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:26,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:26,935 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:26,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1735716657, now seen corresponding path program 1 times [2019-12-07 14:02:26,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:26,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023523302] [2019-12-07 14:02:26,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:02:26,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023523302] [2019-12-07 14:02:26,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:26,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:02:26,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529690033] [2019-12-07 14:02:26,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:02:26,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:26,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:02:26,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:02:26,977 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 3 states. [2019-12-07 14:02:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:26,989 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-12-07 14:02:26,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:02:26,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 14:02:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:26,989 INFO L225 Difference]: With dead ends: 45 [2019-12-07 14:02:26,990 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 14:02:26,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:02:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 14:02:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-12-07 14:02:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 14:02:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-12-07 14:02:26,992 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2019-12-07 14:02:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:26,992 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-12-07 14:02:26,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:02:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-12-07 14:02:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:02:26,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:26,993 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:26,993 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1125355387, now seen corresponding path program 1 times [2019-12-07 14:02:26,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:26,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016733664] [2019-12-07 14:02:26,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 14:02:27,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016733664] [2019-12-07 14:02:27,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:27,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:02:27,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978077956] [2019-12-07 14:02:27,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:02:27,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:27,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:02:27,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:02:27,038 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2019-12-07 14:02:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:27,099 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-12-07 14:02:27,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:02:27,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-07 14:02:27,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:27,100 INFO L225 Difference]: With dead ends: 62 [2019-12-07 14:02:27,100 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 14:02:27,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:02:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 14:02:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 45. [2019-12-07 14:02:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 14:02:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-12-07 14:02:27,102 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2019-12-07 14:02:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:27,102 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-12-07 14:02:27,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:02:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-12-07 14:02:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:02:27,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:27,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:27,103 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1563039845, now seen corresponding path program 1 times [2019-12-07 14:02:27,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:27,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822152332] [2019-12-07 14:02:27,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:27,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822152332] [2019-12-07 14:02:27,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:27,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:02:27,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854988003] [2019-12-07 14:02:27,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:02:27,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:27,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:02:27,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:02:27,297 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 8 states. [2019-12-07 14:02:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:27,437 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-12-07 14:02:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:02:27,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 14:02:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:27,438 INFO L225 Difference]: With dead ends: 57 [2019-12-07 14:02:27,438 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 14:02:27,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:02:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 14:02:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2019-12-07 14:02:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 14:02:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-12-07 14:02:27,441 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 16 [2019-12-07 14:02:27,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:27,441 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-12-07 14:02:27,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:02:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-12-07 14:02:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:02:27,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:27,441 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:27,442 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:27,442 INFO L82 PathProgramCache]: Analyzing trace with hash 865279256, now seen corresponding path program 1 times [2019-12-07 14:02:27,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:27,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939756511] [2019-12-07 14:02:27,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 14:02:27,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939756511] [2019-12-07 14:02:27,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963522694] [2019-12-07 14:02:27,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:27,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:02:27,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:02:27,551 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:02:27,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1795476000] [2019-12-07 14:02:27,583 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 14:02:27,583 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:02:27,583 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:02:27,583 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:02:27,584 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:02:27,909 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:02:27,914 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:02:27,997 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:02:28,003 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:02:28,044 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:02:28,440 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-12-07 14:02:28,510 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:02:28,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:02:28,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2019-12-07 14:02:28,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210416277] [2019-12-07 14:02:28,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:02:28,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:02:28,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:02:28,511 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 12 states. [2019-12-07 14:02:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:28,770 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-12-07 14:02:28,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:02:28,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-07 14:02:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:28,771 INFO L225 Difference]: With dead ends: 88 [2019-12-07 14:02:28,771 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 14:02:28,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2019-12-07 14:02:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 14:02:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2019-12-07 14:02:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 14:02:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-12-07 14:02:28,774 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 16 [2019-12-07 14:02:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:28,774 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-12-07 14:02:28,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:02:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-12-07 14:02:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:02:28,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:28,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:28,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:28,976 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:28,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1623763425, now seen corresponding path program 1 times [2019-12-07 14:02:28,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:28,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749717704] [2019-12-07 14:02:28,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:02:29,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749717704] [2019-12-07 14:02:29,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:29,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:02:29,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614900149] [2019-12-07 14:02:29,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:02:29,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:29,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:02:29,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:02:29,014 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 3 states. [2019-12-07 14:02:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:29,032 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2019-12-07 14:02:29,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:02:29,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 14:02:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:29,033 INFO L225 Difference]: With dead ends: 55 [2019-12-07 14:02:29,033 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 14:02:29,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:02:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 14:02:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-12-07 14:02:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 14:02:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2019-12-07 14:02:29,035 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 17 [2019-12-07 14:02:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:29,035 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-12-07 14:02:29,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:02:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2019-12-07 14:02:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:02:29,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:29,036 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:29,036 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:29,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:29,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1053908182, now seen corresponding path program 1 times [2019-12-07 14:02:29,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:29,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611019810] [2019-12-07 14:02:29,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:02:29,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611019810] [2019-12-07 14:02:29,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:29,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:02:29,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503018211] [2019-12-07 14:02:29,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:02:29,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:29,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:02:29,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:02:29,083 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 7 states. [2019-12-07 14:02:29,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:29,130 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-12-07 14:02:29,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:02:29,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 14:02:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:29,131 INFO L225 Difference]: With dead ends: 64 [2019-12-07 14:02:29,131 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 14:02:29,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:02:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 14:02:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2019-12-07 14:02:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 14:02:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-12-07 14:02:29,133 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 17 [2019-12-07 14:02:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:29,133 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-12-07 14:02:29,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:02:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-12-07 14:02:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:02:29,134 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:29,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:29,134 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:29,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:29,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1202941259, now seen corresponding path program 1 times [2019-12-07 14:02:29,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:29,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130096926] [2019-12-07 14:02:29,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:02:29,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130096926] [2019-12-07 14:02:29,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:29,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:02:29,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890536455] [2019-12-07 14:02:29,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:02:29,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:29,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:02:29,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:02:29,151 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 4 states. [2019-12-07 14:02:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:29,167 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2019-12-07 14:02:29,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:02:29,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 14:02:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:29,167 INFO L225 Difference]: With dead ends: 53 [2019-12-07 14:02:29,167 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 14:02:29,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:02:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 14:02:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 14:02:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 14:02:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-12-07 14:02:29,169 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 18 [2019-12-07 14:02:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:29,170 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-12-07 14:02:29,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:02:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-12-07 14:02:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:02:29,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:29,170 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:29,170 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:29,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash -680343432, now seen corresponding path program 1 times [2019-12-07 14:02:29,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:29,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415701837] [2019-12-07 14:02:29,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:02:29,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415701837] [2019-12-07 14:02:29,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:29,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:02:29,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398705697] [2019-12-07 14:02:29,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:02:29,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:29,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:02:29,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:02:29,216 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 5 states. [2019-12-07 14:02:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:29,256 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-12-07 14:02:29,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:02:29,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 14:02:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:29,257 INFO L225 Difference]: With dead ends: 52 [2019-12-07 14:02:29,257 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 14:02:29,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:02:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 14:02:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 14:02:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 14:02:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-12-07 14:02:29,258 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2019-12-07 14:02:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:29,258 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-12-07 14:02:29,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:02:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-12-07 14:02:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:02:29,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:29,259 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:29,259 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash -957132563, now seen corresponding path program 1 times [2019-12-07 14:02:29,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:02:29,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180515935] [2019-12-07 14:02:29,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:02:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:29,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180515935] [2019-12-07 14:02:29,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720946381] [2019-12-07 14:02:29,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:29,965 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 14:02:29,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:32,389 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:34,633 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@271191f3 [2019-12-07 14:02:34,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1907592985] [2019-12-07 14:02:34,634 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 14:02:34,634 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:02:34,634 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:02:34,634 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:02:34,634 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:02:34,643 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@271191f3 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) 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:120) 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) [2019-12-07 14:02:34,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:02:34,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-12-07 14:02:34,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968700088] [2019-12-07 14:02:34,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:02:34,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:02:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:02:34,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=741, Unknown=2, NotChecked=0, Total=870 [2019-12-07 14:02:34,645 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 13 states. [2019-12-07 14:02:34,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 14:02:34,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:34,846 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@271191f3 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) 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:120) 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) [2019-12-07 14:02:34,850 INFO L168 Benchmark]: Toolchain (without parser) took 11751.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 938.2 MB in the beginning and 1.2 GB in the end (delta: -295.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:02:34,851 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:02:34,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:02:34,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:02:34,852 INFO L168 Benchmark]: Boogie Preprocessor took 19.37 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:02:34,852 INFO L168 Benchmark]: RCFGBuilder took 280.96 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.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:02:34,853 INFO L168 Benchmark]: TraceAbstraction took 11128.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -148.3 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:02:34,856 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.37 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 280.96 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.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11128.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -148.3 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@271191f3 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@271191f3: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 14:02:36,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:02:36,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:02:36,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:02:36,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:02:36,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:02:36,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:02:36,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:02:36,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:02:36,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:02:36,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:02:36,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:02:36,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:02:36,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:02:36,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:02:36,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:02:36,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:02:36,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:02:36,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:02:36,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:02:36,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:02:36,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:02:36,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:02:36,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:02:36,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:02:36,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:02:36,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:02:36,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:02:36,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:02:36,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:02:36,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:02:36,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:02:36,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:02:36,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:02:36,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:02:36,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:02:36,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:02:36,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:02:36,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:02:36,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:02:36,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:02:36,271 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 14:02:36,284 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:02:36,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:02:36,285 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:02:36,285 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:02:36,286 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:02:36,286 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:02:36,286 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:02:36,286 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:02:36,286 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:02:36,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:02:36,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:02:36,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:02:36,288 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:02:36,288 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:02:36,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:02:36,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:02:36,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:02:36,289 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:02:36,289 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:02:36,289 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:02:36,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:02:36,289 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:02:36,290 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:02:36,290 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:02:36,290 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:02:36,290 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:02:36,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:02:36,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:02:36,291 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:02:36,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:02:36,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:02:36,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:02:36,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:02:36,292 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 14:02:36,292 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:02:36,292 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:02:36,292 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:02:36,292 INFO L138 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/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 -> eb7eb63578fa102ef7ac00d7bef40ee74bd144d9 [2019-12-07 14:02:36,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:02:36,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:02:36,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:02:36,479 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:02:36,479 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:02:36,480 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/960521-1_1-2.i [2019-12-07 14:02:36,524 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/data/39437fc2f/75a8d4c27ae449da8c8f2a1260254d44/FLAG025a5a8d2 [2019-12-07 14:02:36,891 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:02:36,891 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/sv-benchmarks/c/list-ext-properties/960521-1_1-2.i [2019-12-07 14:02:36,899 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/data/39437fc2f/75a8d4c27ae449da8c8f2a1260254d44/FLAG025a5a8d2 [2019-12-07 14:02:37,289 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/data/39437fc2f/75a8d4c27ae449da8c8f2a1260254d44 [2019-12-07 14:02:37,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:02:37,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:02:37,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:02:37,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:02:37,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:02:37,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:02:37" (1/1) ... [2019-12-07 14:02:37,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e91b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37, skipping insertion in model container [2019-12-07 14:02:37,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:02:37" (1/1) ... [2019-12-07 14:02:37,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:02:37,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:02:37,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:02:37,552 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:02:37,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:02:37,614 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:02:37,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37 WrapperNode [2019-12-07 14:02:37,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:02:37,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:02:37,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:02:37,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:02:37,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37" (1/1) ... [2019-12-07 14:02:37,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37" (1/1) ... [2019-12-07 14:02:37,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:02:37,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:02:37,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:02:37,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:02:37,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37" (1/1) ... [2019-12-07 14:02:37,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37" (1/1) ... [2019-12-07 14:02:37,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37" (1/1) ... [2019-12-07 14:02:37,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37" (1/1) ... [2019-12-07 14:02:37,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37" (1/1) ... [2019-12-07 14:02:37,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37" (1/1) ... [2019-12-07 14:02:37,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37" (1/1) ... [2019-12-07 14:02:37,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:02:37,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:02:37,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:02:37,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:02:37,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:02:37,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 14:02:37,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:02:37,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:02:37,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 14:02:37,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:02:37,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:02:37,965 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:02:37,966 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 14:02:37,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:02:37 BoogieIcfgContainer [2019-12-07 14:02:37,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:02:37,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:02:37,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:02:37,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:02:37,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:02:37" (1/3) ... [2019-12-07 14:02:37,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66924f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:02:37, skipping insertion in model container [2019-12-07 14:02:37,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:02:37" (2/3) ... [2019-12-07 14:02:37,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66924f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:02:37, skipping insertion in model container [2019-12-07 14:02:37,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:02:37" (3/3) ... [2019-12-07 14:02:37,972 INFO L109 eAbstractionObserver]: Analyzing ICFG 960521-1_1-2.i [2019-12-07 14:02:37,978 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:02:37,983 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 14:02:37,990 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 14:02:38,002 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:02:38,002 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:02:38,003 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:02:38,003 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:02:38,003 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:02:38,003 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:02:38,003 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:02:38,003 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:02:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2019-12-07 14:02:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:02:38,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:38,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:02:38,020 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:38,024 INFO L82 PathProgramCache]: Analyzing trace with hash 28697864, now seen corresponding path program 1 times [2019-12-07 14:02:38,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:02:38,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876950660] [2019-12-07 14:02:38,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:38,081 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:02:38,085 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:38,143 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:02:38,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:02:38,144 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:38,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:38,150 INFO L534 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. [2019-12-07 14:02:38,150 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 14:02:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:38,162 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:38,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876950660] [2019-12-07 14:02:38,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:38,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 14:02:38,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250769020] [2019-12-07 14:02:38,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:02:38,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:02:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:02:38,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:02:38,181 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2019-12-07 14:02:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:38,243 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-12-07 14:02:38,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:02:38,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:02:38,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:38,250 INFO L225 Difference]: With dead ends: 54 [2019-12-07 14:02:38,250 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 14:02:38,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:02:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 14:02:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 14:02:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 14:02:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-12-07 14:02:38,274 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 5 [2019-12-07 14:02:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:38,274 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-12-07 14:02:38,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:02:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-12-07 14:02:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:02:38,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:38,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:02:38,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:02:38,477 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:38,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash 28697865, now seen corresponding path program 1 times [2019-12-07 14:02:38,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:02:38,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631496916] [2019-12-07 14:02:38,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:38,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:02:38,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:38,560 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:02:38,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:02:38,561 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:38,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:38,568 INFO L534 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. [2019-12-07 14:02:38,568 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-12-07 14:02:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:38,582 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:38,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631496916] [2019-12-07 14:02:38,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:38,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 14:02:38,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462819481] [2019-12-07 14:02:38,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:02:38,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:02:38,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:02:38,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:02:38,638 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 6 states. [2019-12-07 14:02:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:38,881 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2019-12-07 14:02:38,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:02:38,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-12-07 14:02:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:38,884 INFO L225 Difference]: With dead ends: 150 [2019-12-07 14:02:38,884 INFO L226 Difference]: Without dead ends: 150 [2019-12-07 14:02:38,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:02:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-12-07 14:02:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 56. [2019-12-07 14:02:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 14:02:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-12-07 14:02:38,892 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 5 [2019-12-07 14:02:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:38,892 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-12-07 14:02:38,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:02:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-12-07 14:02:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:02:38,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:38,893 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-12-07 14:02:39,094 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:02:39,095 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:39,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:39,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1810564201, now seen corresponding path program 1 times [2019-12-07 14:02:39,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:02:39,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763333897] [2019-12-07 14:02:39,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:39,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:02:39,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:39,204 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:02:39,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:02:39,204 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:39,211 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:39,212 INFO L534 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. [2019-12-07 14:02:39,212 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-12-07 14:02:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:39,233 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:39,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763333897] [2019-12-07 14:02:39,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [866250824] [2019-12-07 14:02:39,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:02:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:39,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:02:39,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:39,415 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:02:39,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:02:39,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:39,422 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:39,422 INFO L534 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. [2019-12-07 14:02:39,423 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-12-07 14:02:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:39,423 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:39,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545118543] [2019-12-07 14:02:39,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:39,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:02:39,531 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:39,558 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:02:39,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:02:39,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:39,565 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:39,566 INFO L534 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. [2019-12-07 14:02:39,566 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-12-07 14:02:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:39,567 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:39,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:02:39,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 9 [2019-12-07 14:02:39,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180505510] [2019-12-07 14:02:39,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:02:39,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:02:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:02:39,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:02:39,572 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 10 states. [2019-12-07 14:02:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:40,450 INFO L93 Difference]: Finished difference Result 346 states and 367 transitions. [2019-12-07 14:02:40,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:02:40,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-12-07 14:02:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:40,454 INFO L225 Difference]: With dead ends: 346 [2019-12-07 14:02:40,454 INFO L226 Difference]: Without dead ends: 346 [2019-12-07 14:02:40,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:02:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-12-07 14:02:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 60. [2019-12-07 14:02:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 14:02:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-12-07 14:02:40,468 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 7 [2019-12-07 14:02:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:40,468 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-12-07 14:02:40,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:02:40,468 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-12-07 14:02:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 14:02:40,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:40,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:41,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3,5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:41,073 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:41,074 INFO L82 PathProgramCache]: Analyzing trace with hash 239563854, now seen corresponding path program 1 times [2019-12-07 14:02:41,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:02:41,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388541468] [2019-12-07 14:02:41,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:41,111 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:02:41,112 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:41,128 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:02:41,128 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 14:02:41,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:41,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:41,141 INFO L534 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. [2019-12-07 14:02:41,141 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-12-07 14:02:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:41,155 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:41,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388541468] [2019-12-07 14:02:41,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:41,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 14:02:41,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842359587] [2019-12-07 14:02:41,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:02:41,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:02:41,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:02:41,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:02:41,164 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 4 states. [2019-12-07 14:02:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:41,212 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-12-07 14:02:41,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:02:41,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 14:02:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:41,214 INFO L225 Difference]: With dead ends: 57 [2019-12-07 14:02:41,214 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 14:02:41,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:02:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 14:02:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-12-07 14:02:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 14:02:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-12-07 14:02:41,218 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 8 [2019-12-07 14:02:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:41,219 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-12-07 14:02:41,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:02:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-12-07 14:02:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 14:02:41,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:41,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:41,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 14:02:41,420 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:41,421 INFO L82 PathProgramCache]: Analyzing trace with hash 239563855, now seen corresponding path program 1 times [2019-12-07 14:02:41,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:02:41,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371491793] [2019-12-07 14:02:41,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:41,494 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:02:41,496 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:41,503 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_39|]} [2019-12-07 14:02:41,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:02:41,508 INFO L377 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 9 treesize of output 11 [2019-12-07 14:02:41,508 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:41,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:41,520 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:41,520 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:41,528 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:41,529 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:02:41,529 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:02:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:41,560 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:41,687 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:02:41,691 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:41,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:41,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:41,702 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:02:41,702 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:41,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:41,710 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:41,710 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:02:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:41,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371491793] [2019-12-07 14:02:41,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:41,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 14:02:41,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158248572] [2019-12-07 14:02:41,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:02:41,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:02:41,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:02:41,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:02:41,731 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 8 states. [2019-12-07 14:02:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:42,694 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2019-12-07 14:02:42,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:02:42,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-12-07 14:02:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:42,696 INFO L225 Difference]: With dead ends: 184 [2019-12-07 14:02:42,696 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 14:02:42,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:02:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 14:02:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 77. [2019-12-07 14:02:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 14:02:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-12-07 14:02:42,701 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 8 [2019-12-07 14:02:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:42,701 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-12-07 14:02:42,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:02:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-12-07 14:02:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:02:42,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:42,702 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:42,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:02:42,903 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:42,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:42,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1976198929, now seen corresponding path program 1 times [2019-12-07 14:02:42,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:02:42,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039352418] [2019-12-07 14:02:42,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:42,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:02:42,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:43,008 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_41|]} [2019-12-07 14:02:43,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:02:43,012 INFO L377 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 9 treesize of output 11 [2019-12-07 14:02:43,012 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,021 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,025 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:43,025 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,034 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,035 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:02:43,035 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:02:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:43,085 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:43,228 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:02:43,233 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:43,233 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,241 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:02:43,241 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,249 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,249 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:02:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:43,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039352418] [2019-12-07 14:02:43,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [83541154] [2019-12-07 14:02:43,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:02:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:43,398 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:02:43,399 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:43,409 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_43|]} [2019-12-07 14:02:43,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:02:43,413 INFO L377 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 9 treesize of output 11 [2019-12-07 14:02:43,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,425 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:43,425 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,432 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:02:43,432 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:02:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:43,435 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:43,438 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:02:43,443 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:43,443 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,450 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:02:43,451 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,458 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:02:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:43,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987280839] [2019-12-07 14:02:43,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:43,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:02:43,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:43,498 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_45|]} [2019-12-07 14:02:43,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:02:43,501 INFO L377 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 9 treesize of output 11 [2019-12-07 14:02:43,502 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,510 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,514 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:43,514 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,522 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:02:43,522 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:02:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:43,526 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:43,530 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:02:43,534 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:43,534 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,541 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,542 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:02:43,543 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:43,550 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:43,550 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:02:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:43,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:02:43,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 11 [2019-12-07 14:02:43,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277314562] [2019-12-07 14:02:43,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:02:43,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:02:43,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:02:43,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:02:43,552 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 12 states. [2019-12-07 14:02:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:45,778 INFO L93 Difference]: Finished difference Result 525 states and 555 transitions. [2019-12-07 14:02:45,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 14:02:45,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-12-07 14:02:45,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:45,781 INFO L225 Difference]: With dead ends: 525 [2019-12-07 14:02:45,781 INFO L226 Difference]: Without dead ends: 525 [2019-12-07 14:02:45,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2019-12-07 14:02:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-12-07 14:02:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 91. [2019-12-07 14:02:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 14:02:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2019-12-07 14:02:45,788 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 10 [2019-12-07 14:02:45,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:45,788 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2019-12-07 14:02:45,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:02:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2019-12-07 14:02:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:02:45,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:45,788 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:46,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:46,390 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:46,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1388869610, now seen corresponding path program 1 times [2019-12-07 14:02:46,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:02:46,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295435544] [2019-12-07 14:02:46,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:46,457 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:02:46,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:46,474 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:46,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295435544] [2019-12-07 14:02:46,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [581222422] [2019-12-07 14:02:46,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:02:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:46,555 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:02:46,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:46,557 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:46,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406004126] [2019-12-07 14:02:46,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:46,592 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:02:46,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:46,601 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:46,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:02:46,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2019-12-07 14:02:46,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890694118] [2019-12-07 14:02:46,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:02:46,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:02:46,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:02:46,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:02:46,603 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand 8 states. [2019-12-07 14:02:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:46,735 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2019-12-07 14:02:46,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:02:46,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-07 14:02:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:46,736 INFO L225 Difference]: With dead ends: 120 [2019-12-07 14:02:46,736 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 14:02:46,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:02:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 14:02:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2019-12-07 14:02:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 14:02:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2019-12-07 14:02:46,741 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 11 [2019-12-07 14:02:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:46,741 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2019-12-07 14:02:46,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:02:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2019-12-07 14:02:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:02:46,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:46,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:47,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 14:02:47,346 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:47,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:47,347 INFO L82 PathProgramCache]: Analyzing trace with hash 738364296, now seen corresponding path program 1 times [2019-12-07 14:02:47,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:02:47,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621744237] [2019-12-07 14:02:47,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:47,381 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:02:47,382 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:47,396 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:47,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621744237] [2019-12-07 14:02:47,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1271846931] [2019-12-07 14:02:47,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:02:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:47,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:02:47,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:47,474 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:47,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694370964] [2019-12-07 14:02:47,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:47,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:02:47,507 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:02:47,525 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:47,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:47,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2019-12-07 14:02:47,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:02:47,534 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:47,535 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:47,535 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:47,536 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-12-07 14:02:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:02:47,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:02:47,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5, 5, 5, 5] total 10 [2019-12-07 14:02:47,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023990927] [2019-12-07 14:02:47,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:02:47,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:02:47,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:02:47,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:02:47,537 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand 4 states. [2019-12-07 14:02:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:47,621 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2019-12-07 14:02:47,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:02:47,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:02:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:47,622 INFO L225 Difference]: With dead ends: 87 [2019-12-07 14:02:47,622 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 14:02:47,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:02:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 14:02:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-12-07 14:02:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 14:02:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-12-07 14:02:47,626 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 11 [2019-12-07 14:02:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:47,626 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-12-07 14:02:47,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:02:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-12-07 14:02:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:02:47,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:47,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:48,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:48,229 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash 738364297, now seen corresponding path program 1 times [2019-12-07 14:02:48,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:02:48,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293792184] [2019-12-07 14:02:48,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:48,290 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:02:48,291 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:48,305 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:48,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293792184] [2019-12-07 14:02:48,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2090866776] [2019-12-07 14:02:48,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:02:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:48,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:02:48,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:48,393 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:48,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465844224] [2019-12-07 14:02:48,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:48,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:02:48,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:48,427 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:48,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:02:48,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 10 [2019-12-07 14:02:48,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177504148] [2019-12-07 14:02:48,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:02:48,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:02:48,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:02:48,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:02:48,464 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 10 states. [2019-12-07 14:02:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:49,012 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2019-12-07 14:02:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:02:49,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-12-07 14:02:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:49,014 INFO L225 Difference]: With dead ends: 171 [2019-12-07 14:02:49,014 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 14:02:49,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:02:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 14:02:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 92. [2019-12-07 14:02:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 14:02:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2019-12-07 14:02:49,018 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 11 [2019-12-07 14:02:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:49,018 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2019-12-07 14:02:49,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:02:49,018 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2019-12-07 14:02:49,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:02:49,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:49,018 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-12-07 14:02:49,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:02:49,620 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash 522992425, now seen corresponding path program 2 times [2019-12-07 14:02:49,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:02:49,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566980820] [2019-12-07 14:02:49,621 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:49,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:02:49,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:02:49,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:02:49,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:49,708 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:02:49,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:02:49,708 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:49,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:49,714 INFO L534 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. [2019-12-07 14:02:49,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-12-07 14:02:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:49,734 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:50,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566980820] [2019-12-07 14:02:50,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1964873570] [2019-12-07 14:02:50,004 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:02:50,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:02:50,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:02:50,066 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:02:50,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:50,086 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:02:50,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:02:50,086 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:50,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:50,092 INFO L534 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. [2019-12-07 14:02:50,092 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-12-07 14:02:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:50,092 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:50,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742506306] [2019-12-07 14:02:50,095 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:50,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:02:50,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:02:50,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:02:50,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:50,144 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:02:50,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:02:50,144 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:50,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:50,149 INFO L534 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. [2019-12-07 14:02:50,150 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-12-07 14:02:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:50,150 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:50,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:02:50,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 17 [2019-12-07 14:02:50,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368264836] [2019-12-07 14:02:50,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 14:02:50,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:02:50,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 14:02:50,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:02:50,154 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand 18 states. [2019-12-07 14:02:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:53,113 INFO L93 Difference]: Finished difference Result 712 states and 764 transitions. [2019-12-07 14:02:53,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 14:02:53,114 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 11 [2019-12-07 14:02:53,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:53,117 INFO L225 Difference]: With dead ends: 712 [2019-12-07 14:02:53,117 INFO L226 Difference]: Without dead ends: 712 [2019-12-07 14:02:53,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=463, Invalid=1019, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 14:02:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-12-07 14:02:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 102. [2019-12-07 14:02:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 14:02:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2019-12-07 14:02:53,124 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 11 [2019-12-07 14:02:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:53,125 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2019-12-07 14:02:53,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 14:02:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2019-12-07 14:02:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 14:02:53,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:53,125 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:53,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:53,727 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:02:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1416054993, now seen corresponding path program 1 times [2019-12-07 14:02:53,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:02:53,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322652463] [2019-12-07 14:02:53,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:53,774 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:02:53,775 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:53,782 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_47|], 1=[|v_#valid_59|]} [2019-12-07 14:02:53,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:02:53,786 INFO L377 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 9 treesize of output 11 [2019-12-07 14:02:53,786 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:53,793 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:53,796 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:53,797 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:53,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:53,804 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:02:53,804 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:02:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:53,854 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:54,103 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:02:54,107 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:54,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,115 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:02:54,115 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,122 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:02:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:54,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322652463] [2019-12-07 14:02:54,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1503243886] [2019-12-07 14:02:54,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:02:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:54,260 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:02:54,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:54,266 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_49|], 1=[|v_#valid_61|]} [2019-12-07 14:02:54,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:02:54,269 INFO L377 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 9 treesize of output 11 [2019-12-07 14:02:54,269 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,279 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:54,279 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,286 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,286 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:02:54,286 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:02:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:54,300 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:54,303 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:02:54,307 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:54,307 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:02:54,315 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,321 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,321 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,321 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:02:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:54,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089192795] [2019-12-07 14:02:54,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:02:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:54,354 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:02:54,355 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:54,359 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_51|], 1=[|v_#valid_63|]} [2019-12-07 14:02:54,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:02:54,363 INFO L377 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 9 treesize of output 11 [2019-12-07 14:02:54,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,375 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:54,376 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,383 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:02:54,383 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:02:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:54,406 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:54,617 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:02:54,622 INFO L377 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 10 treesize of output 8 [2019-12-07 14:02:54,622 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,634 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:02:54,634 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,643 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,643 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,643 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-12-07 14:02:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:02:54,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:02:54,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 7] total 15 [2019-12-07 14:02:54,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406330799] [2019-12-07 14:02:54,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:02:54,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:02:54,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:02:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:02:54,760 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand 16 states. [2019-12-07 14:02:56,158 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:02:56,364 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 14:02:56,709 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-07 14:02:57,215 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 14:02:58,174 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-12-07 14:03:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:01,201 INFO L93 Difference]: Finished difference Result 380 states and 410 transitions. [2019-12-07 14:03:01,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 14:03:01,202 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2019-12-07 14:03:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:01,204 INFO L225 Difference]: With dead ends: 380 [2019-12-07 14:03:01,204 INFO L226 Difference]: Without dead ends: 380 [2019-12-07 14:03:01,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=373, Invalid=1033, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 14:03:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-07 14:03:01,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 131. [2019-12-07 14:03:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-12-07 14:03:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2019-12-07 14:03:01,208 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 12 [2019-12-07 14:03:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:01,208 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2019-12-07 14:03:01,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 14:03:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2019-12-07 14:03:01,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:03:01,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:01,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:03:01,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 cvc4 --incremental --print-success --lang smt --rewrite-divk,24 mathsat -unsat_core_generation=3 [2019-12-07 14:03:01,811 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:03:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1031081387, now seen corresponding path program 1 times [2019-12-07 14:03:01,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:03:01,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097142723] [2019-12-07 14:03:01,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:03:01,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:03:01,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:01,876 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:03:01,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:03:01,876 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:01,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:01,881 INFO L534 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. [2019-12-07 14:03:01,881 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:16 [2019-12-07 14:03:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:03:01,894 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:03:01,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097142723] [2019-12-07 14:03:01,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:03:01,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 14:03:01,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454439586] [2019-12-07 14:03:01,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:03:01,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:03:01,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:03:01,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:03:01,933 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 6 states. [2019-12-07 14:03:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:02,177 INFO L93 Difference]: Finished difference Result 174 states and 200 transitions. [2019-12-07 14:03:02,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:03:02,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 14:03:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:02,179 INFO L225 Difference]: With dead ends: 174 [2019-12-07 14:03:02,179 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 14:03:02,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:03:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 14:03:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 136. [2019-12-07 14:03:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-07 14:03:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions. [2019-12-07 14:03:02,182 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 13 [2019-12-07 14:03:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:02,182 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 168 transitions. [2019-12-07 14:03:02,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:03:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions. [2019-12-07 14:03:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:03:02,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:02,183 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:03:02,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 14:03:02,384 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:03:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1674057169, now seen corresponding path program 2 times [2019-12-07 14:03:02,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:03:02,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097103347] [2019-12-07 14:03:02,385 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:02,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 14:03:02,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:02,441 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:03:02,442 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:02,444 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_66|]} [2019-12-07 14:03:02,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:03:02,448 INFO L377 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 13 treesize of output 15 [2019-12-07 14:03:02,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:02,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:02,463 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:02,464 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:02,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:02,474 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:03:02,475 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:25 [2019-12-07 14:03:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:03:02,521 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:03:02,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097103347] [2019-12-07 14:03:02,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:03:02,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 14:03:02,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463130849] [2019-12-07 14:03:02,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:03:02,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:03:02,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:03:02,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:03:02,705 INFO L87 Difference]: Start difference. First operand 136 states and 168 transitions. Second operand 8 states. [2019-12-07 14:03:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:03,098 INFO L93 Difference]: Finished difference Result 153 states and 182 transitions. [2019-12-07 14:03:03,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:03:03,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 14:03:03,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:03,099 INFO L225 Difference]: With dead ends: 153 [2019-12-07 14:03:03,099 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 14:03:03,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:03:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 14:03:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 108. [2019-12-07 14:03:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 14:03:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2019-12-07 14:03:03,102 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 14 [2019-12-07 14:03:03,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:03,103 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2019-12-07 14:03:03,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:03:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2019-12-07 14:03:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 14:03:03,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:03,103 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:03:03,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 14:03:03,305 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:03:03,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:03,305 INFO L82 PathProgramCache]: Analyzing trace with hash 525487188, now seen corresponding path program 2 times [2019-12-07 14:03:03,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:03:03,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050780564] [2019-12-07 14:03:03,306 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:03,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:03:03,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:03,388 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:03:03,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:03,414 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:03,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050780564] [2019-12-07 14:03:03,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1893328110] [2019-12-07 14:03:03,468 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:03:03,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:03:03,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:03,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:03:03,546 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:03,555 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:03,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100007780] [2019-12-07 14:03:03,556 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:03:03,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:03:03,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:03,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:03:03,596 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:03,605 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:03,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:03:03,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 12 [2019-12-07 14:03:03,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758391157] [2019-12-07 14:03:03,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:03:03,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:03:03,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:03:03,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:03:03,608 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 12 states. [2019-12-07 14:03:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:03,928 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2019-12-07 14:03:03,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:03:03,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-07 14:03:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:03,930 INFO L225 Difference]: With dead ends: 138 [2019-12-07 14:03:03,930 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 14:03:03,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:03:03,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 14:03:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-12-07 14:03:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 14:03:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2019-12-07 14:03:03,932 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 15 [2019-12-07 14:03:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:03,932 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2019-12-07 14:03:03,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:03:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2019-12-07 14:03:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:03:03,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:03,933 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:03:04,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk,29 mathsat -unsat_core_generation=3,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:03:04,535 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:03:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:04,536 INFO L82 PathProgramCache]: Analyzing trace with hash 854407055, now seen corresponding path program 3 times [2019-12-07 14:03:04,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:03:04,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374578486] [2019-12-07 14:03:04,537 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:04,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 14:03:04,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:04,632 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 14:03:04,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:04,643 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_60|], 1=[|v_#valid_71|]} [2019-12-07 14:03:04,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:03:04,646 INFO L377 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 9 treesize of output 11 [2019-12-07 14:03:04,646 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:04,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:04,656 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:04,657 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:04,663 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:04,663 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:03:04,663 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:03:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:04,776 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:05,381 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:03:05,386 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:05,387 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,399 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:05,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:03:05,401 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,411 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:05,411 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,411 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-12-07 14:03:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:05,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374578486] [2019-12-07 14:03:05,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1265140765] [2019-12-07 14:03:05,616 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:03:05,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 14:03:05,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:05,700 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:03:05,701 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:05,703 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_62|], 1=[|v_#valid_73|]} [2019-12-07 14:03:05,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:03:05,707 INFO L377 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 9 treesize of output 11 [2019-12-07 14:03:05,707 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,715 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:05,717 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:05,718 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:05,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:03:05,724 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:03:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:05,769 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:05,774 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:03:05,778 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:05,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:05,789 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:03:05,790 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:05,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,799 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-12-07 14:03:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:05,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020690291] [2019-12-07 14:03:05,802 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:03:05,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 14:03:05,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:05,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 14:03:05,846 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:05,851 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_64|], 1=[|v_#valid_75|]} [2019-12-07 14:03:05,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:03:05,855 INFO L377 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 9 treesize of output 11 [2019-12-07 14:03:05,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,862 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:05,865 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:05,865 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:05,872 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:03:05,872 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:03:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:05,897 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:06,310 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:03:06,315 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:06,315 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:06,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:06,327 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:03:06,327 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:06,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:06,340 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:06,340 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-12-07 14:03:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:06,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:03:06,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9, 8, 9] total 19 [2019-12-07 14:03:06,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442439026] [2019-12-07 14:03:06,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 14:03:06,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:03:06,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 14:03:06,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:03:06,343 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand 20 states. [2019-12-07 14:03:07,164 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 14:03:07,539 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2019-12-07 14:03:07,723 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 14:03:08,614 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-12-07 14:03:09,011 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:03:09,580 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2019-12-07 14:03:09,770 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 14:03:10,276 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-12-07 14:03:10,533 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 14:03:10,777 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:03:11,000 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 14:03:11,549 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2019-12-07 14:03:11,737 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 14:03:12,114 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2019-12-07 14:03:12,448 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-12-07 14:03:13,049 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 14:03:14,042 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-12-07 14:03:15,721 WARN L192 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2019-12-07 14:03:16,916 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 14:03:18,118 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 14:03:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:19,467 INFO L93 Difference]: Finished difference Result 423 states and 447 transitions. [2019-12-07 14:03:19,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 14:03:19,467 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 16 [2019-12-07 14:03:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:19,469 INFO L225 Difference]: With dead ends: 423 [2019-12-07 14:03:19,469 INFO L226 Difference]: Without dead ends: 423 [2019-12-07 14:03:19,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=661, Invalid=2419, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 14:03:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-07 14:03:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 143. [2019-12-07 14:03:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 14:03:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 172 transitions. [2019-12-07 14:03:19,474 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 172 transitions. Word has length 16 [2019-12-07 14:03:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:19,474 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 172 transitions. [2019-12-07 14:03:19,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 14:03:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 172 transitions. [2019-12-07 14:03:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:03:19,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:19,475 INFO L410 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:03:20,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:03:20,077 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:03:20,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:20,078 INFO L82 PathProgramCache]: Analyzing trace with hash -283489775, now seen corresponding path program 4 times [2019-12-07 14:03:20,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:03:20,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548729586] [2019-12-07 14:03:20,079 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:20,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:03:20,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:20,121 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 14:03:20,122 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:20,146 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_66|], 1=[|v_#valid_77|]} [2019-12-07 14:03:20,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:03:20,149 INFO L377 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 9 treesize of output 11 [2019-12-07 14:03:20,149 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:20,157 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:20,160 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:20,160 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:20,166 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:20,167 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:03:20,167 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:03:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:20,235 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:20,567 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:03:20,572 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:20,572 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:20,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:20,580 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:03:20,581 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:20,587 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:20,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:20,587 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:03:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:20,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548729586] [2019-12-07 14:03:20,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2023117641] [2019-12-07 14:03:20,849 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:03:20,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:03:20,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:20,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:03:20,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:20,937 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_68|], 1=[|v_#valid_79|]} [2019-12-07 14:03:20,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:03:20,941 INFO L377 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 9 treesize of output 11 [2019-12-07 14:03:20,941 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:20,949 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:20,953 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:20,953 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:20,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:20,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:03:20,961 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:03:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:20,966 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:20,969 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:03:20,974 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:20,974 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:20,981 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:20,982 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:03:20,983 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:20,992 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:20,992 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:20,992 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:03:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:20,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369917985] [2019-12-07 14:03:20,995 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:03:21,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:03:21,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:21,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 14:03:21,032 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:21,042 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_70|], 1=[|v_#valid_81|]} [2019-12-07 14:03:21,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:03:21,045 INFO L377 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 9 treesize of output 11 [2019-12-07 14:03:21,046 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:21,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:21,059 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:21,059 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:21,066 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:21,066 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:03:21,066 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:03:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:21,128 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:21,405 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:03:21,410 INFO L377 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 10 treesize of output 8 [2019-12-07 14:03:21,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:21,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:21,422 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:03:21,422 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:21,431 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:21,432 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:21,432 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-12-07 14:03:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:21,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:03:21,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 11] total 27 [2019-12-07 14:03:21,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648421785] [2019-12-07 14:03:21,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 14:03:21,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:03:21,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 14:03:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2019-12-07 14:03:21,946 INFO L87 Difference]: Start difference. First operand 143 states and 172 transitions. Second operand 28 states. [2019-12-07 14:03:23,588 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-07 14:03:24,363 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:03:25,315 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-12-07 14:03:26,060 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:03:26,375 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-07 14:03:27,229 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-12-07 14:03:27,958 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-12-07 14:03:28,263 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-07 14:03:28,830 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-07 14:03:29,220 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-12-07 14:03:29,540 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-12-07 14:03:30,150 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-12-07 14:03:30,601 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-12-07 14:03:31,803 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-07 14:03:32,223 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-12-07 14:03:33,702 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-12-07 14:03:34,145 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:03:34,422 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 14:03:35,706 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-07 14:03:37,270 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-12-07 14:03:38,179 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 14:03:39,572 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-12-07 14:03:41,273 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-12-07 14:03:42,906 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-12-07 14:03:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:49,506 INFO L93 Difference]: Finished difference Result 936 states and 968 transitions. [2019-12-07 14:03:49,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-07 14:03:49,507 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 16 [2019-12-07 14:03:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:49,511 INFO L225 Difference]: With dead ends: 936 [2019-12-07 14:03:49,511 INFO L226 Difference]: Without dead ends: 936 [2019-12-07 14:03:49,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2546 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=2224, Invalid=6518, Unknown=0, NotChecked=0, Total=8742 [2019-12-07 14:03:49,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-12-07 14:03:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 163. [2019-12-07 14:03:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 14:03:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 196 transitions. [2019-12-07 14:03:49,520 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 196 transitions. Word has length 16 [2019-12-07 14:03:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:49,520 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 196 transitions. [2019-12-07 14:03:49,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 14:03:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 196 transitions. [2019-12-07 14:03:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:03:49,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:49,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:03:50,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:03:50,123 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:03:50,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:50,124 INFO L82 PathProgramCache]: Analyzing trace with hash 999205149, now seen corresponding path program 1 times [2019-12-07 14:03:50,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:03:50,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155780063] [2019-12-07 14:03:50,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:03:50,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:03:50,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:03:50,208 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:03:50,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155780063] [2019-12-07 14:03:50,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:03:50,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2019-12-07 14:03:50,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923473971] [2019-12-07 14:03:50,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:03:50,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:03:50,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:03:50,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:03:50,215 INFO L87 Difference]: Start difference. First operand 163 states and 196 transitions. Second operand 5 states. [2019-12-07 14:03:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:50,238 INFO L93 Difference]: Finished difference Result 161 states and 193 transitions. [2019-12-07 14:03:50,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:03:50,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 14:03:50,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:50,239 INFO L225 Difference]: With dead ends: 161 [2019-12-07 14:03:50,239 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 14:03:50,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:03:50,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 14:03:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-12-07 14:03:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-12-07 14:03:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 193 transitions. [2019-12-07 14:03:50,242 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 193 transitions. Word has length 17 [2019-12-07 14:03:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:50,242 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 193 transitions. [2019-12-07 14:03:50,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:03:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 193 transitions. [2019-12-07 14:03:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:03:50,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:50,243 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:03:50,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2019-12-07 14:03:50,444 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:03:50,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:50,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1813005665, now seen corresponding path program 1 times [2019-12-07 14:03:50,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:03:50,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634833204] [2019-12-07 14:03:50,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:03:50,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:03:50,515 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:50,534 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:03:50,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:03:50,534 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:50,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:50,541 INFO L534 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. [2019-12-07 14:03:50,541 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:16 [2019-12-07 14:03:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:03:50,569 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:03:50,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634833204] [2019-12-07 14:03:50,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [636903952] [2019-12-07 14:03:50,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:03:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:03:50,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:03:50,811 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:50,821 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:03:50,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:03:50,822 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:50,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:50,828 INFO L534 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. [2019-12-07 14:03:50,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:16 [2019-12-07 14:03:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:03:50,829 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:03:50,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050398997] [2019-12-07 14:03:50,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:03:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:03:50,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:03:50,867 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:50,879 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:03:50,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:03:50,879 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:50,884 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:50,885 INFO L534 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. [2019-12-07 14:03:50,885 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:16 [2019-12-07 14:03:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:03:50,886 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:03:50,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:03:50,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 9 [2019-12-07 14:03:50,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709449793] [2019-12-07 14:03:50,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:03:50,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:03:50,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:03:50,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:03:50,889 INFO L87 Difference]: Start difference. First operand 161 states and 193 transitions. Second operand 10 states. [2019-12-07 14:03:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:51,891 INFO L93 Difference]: Finished difference Result 259 states and 285 transitions. [2019-12-07 14:03:51,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:03:51,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-12-07 14:03:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:51,893 INFO L225 Difference]: With dead ends: 259 [2019-12-07 14:03:51,893 INFO L226 Difference]: Without dead ends: 259 [2019-12-07 14:03:51,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:03:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-12-07 14:03:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 176. [2019-12-07 14:03:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 14:03:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 209 transitions. [2019-12-07 14:03:51,896 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 209 transitions. Word has length 17 [2019-12-07 14:03:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:51,896 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 209 transitions. [2019-12-07 14:03:51,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:03:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 209 transitions. [2019-12-07 14:03:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:03:51,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:51,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:03:52,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3,40 cvc4 --incremental --print-success --lang smt --rewrite-divk,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:03:52,498 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:03:52,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:52,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1849882831, now seen corresponding path program 1 times [2019-12-07 14:03:52,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:03:52,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899636883] [2019-12-07 14:03:52,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 42 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:03:52,572 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:03:52,572 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:52,592 INFO L377 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 7 [2019-12-07 14:03:52,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:52,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:52,593 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:52,594 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 14:03:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:03:52,600 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:52,625 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:52,625 INFO L377 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 19 [2019-12-07 14:03:52,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:03:52,626 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:52,627 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:52,628 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:52,628 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-12-07 14:03:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:03:52,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899636883] [2019-12-07 14:03:52,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:03:52,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 8 [2019-12-07 14:03:52,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158645185] [2019-12-07 14:03:52,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:03:52,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:03:52,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:03:52,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:03:52,637 INFO L87 Difference]: Start difference. First operand 176 states and 209 transitions. Second operand 8 states. [2019-12-07 14:03:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:52,767 INFO L93 Difference]: Finished difference Result 191 states and 223 transitions. [2019-12-07 14:03:52,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:03:52,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 14:03:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:52,769 INFO L225 Difference]: With dead ends: 191 [2019-12-07 14:03:52,769 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 14:03:52,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:03:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 14:03:52,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 180. [2019-12-07 14:03:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:03:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 213 transitions. [2019-12-07 14:03:52,771 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 213 transitions. Word has length 19 [2019-12-07 14:03:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:52,771 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 213 transitions. [2019-12-07 14:03:52,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:03:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 213 transitions. [2019-12-07 14:03:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:03:52,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:52,772 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:03:52,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 mathsat -unsat_core_generation=3 [2019-12-07 14:03:52,973 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:03:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:52,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1664351446, now seen corresponding path program 5 times [2019-12-07 14:03:52,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:03:52,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509983598] [2019-12-07 14:03:52,975 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 43 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:53,066 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-07 14:03:53,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:53,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:03:53,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:53,109 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:53,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509983598] [2019-12-07 14:03:53,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [570964430] [2019-12-07 14:03:53,235 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:03:53,330 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-07 14:03:53,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:53,331 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:03:53,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:53,339 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:53,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134314597] [2019-12-07 14:03:53,341 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:03:53,384 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-07 14:03:53,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:53,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:03:53,387 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:53,391 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:53,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:03:53,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 16 [2019-12-07 14:03:53,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631964175] [2019-12-07 14:03:53,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:03:53,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:03:53,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:03:53,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:03:53,394 INFO L87 Difference]: Start difference. First operand 180 states and 213 transitions. Second operand 16 states. [2019-12-07 14:03:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:54,267 INFO L93 Difference]: Finished difference Result 216 states and 238 transitions. [2019-12-07 14:03:54,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:03:54,267 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-07 14:03:54,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:54,268 INFO L225 Difference]: With dead ends: 216 [2019-12-07 14:03:54,268 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 14:03:54,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:03:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 14:03:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 170. [2019-12-07 14:03:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 14:03:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 197 transitions. [2019-12-07 14:03:54,271 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 197 transitions. Word has length 19 [2019-12-07 14:03:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:54,271 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 197 transitions. [2019-12-07 14:03:54,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 14:03:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 197 transitions. [2019-12-07 14:03:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:03:54,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:54,272 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-12-07 14:03:54,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 cvc4 --incremental --print-success --lang smt --rewrite-divk,43 mathsat -unsat_core_generation=3 [2019-12-07 14:03:54,874 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:03:54,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash -764245847, now seen corresponding path program 3 times [2019-12-07 14:03:54,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:03:54,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422269294] [2019-12-07 14:03:54,876 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 46 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:54,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-07 14:03:54,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:54,951 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 14:03:54,951 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:55,066 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:03:55,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:03:55,066 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:55,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:55,072 INFO L534 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. [2019-12-07 14:03:55,072 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-12-07 14:03:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:55,107 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:56,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422269294] [2019-12-07 14:03:56,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1716426116] [2019-12-07 14:03:56,197 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/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 [2019-12-07 14:03:56,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-07 14:03:56,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:56,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 14:03:56,287 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:56,320 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:03:56,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:03:56,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:56,325 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:56,326 INFO L534 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. [2019-12-07 14:03:56,326 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-12-07 14:03:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:56,327 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:56,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851435932] [2019-12-07 14:03:56,330 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:03:56,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-07 14:03:56,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:03:56,382 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 14:03:56,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:56,413 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:03:56,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:03:56,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:56,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:56,418 INFO L534 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. [2019-12-07 14:03:56,419 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-12-07 14:03:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:56,419 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:03:56,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:03:56,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17, 17, 17, 17] total 33 [2019-12-07 14:03:56,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980540852] [2019-12-07 14:03:56,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 14:03:56,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:03:56,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 14:03:56,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 14:03:56,424 INFO L87 Difference]: Start difference. First operand 170 states and 197 transitions. Second operand 34 states. [2019-12-07 14:03:56,775 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 14:03:58,955 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 14:03:59,380 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 14:03:59,892 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 14:04:00,243 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 14:04:00,740 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 14:04:01,057 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:04:01,570 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 14:04:02,314 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 14:04:03,032 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 14:04:03,760 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 14:04:04,420 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 14:04:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:08,750 INFO L93 Difference]: Finished difference Result 1253 states and 1314 transitions. [2019-12-07 14:04:08,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-07 14:04:08,750 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 19 [2019-12-07 14:04:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:08,754 INFO L225 Difference]: With dead ends: 1253 [2019-12-07 14:04:08,754 INFO L226 Difference]: Without dead ends: 1253 [2019-12-07 14:04:08,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1470 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1883, Invalid=4279, Unknown=0, NotChecked=0, Total=6162 [2019-12-07 14:04:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2019-12-07 14:04:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 186. [2019-12-07 14:04:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 14:04:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 229 transitions. [2019-12-07 14:04:08,762 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 229 transitions. Word has length 19 [2019-12-07 14:04:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:08,762 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 229 transitions. [2019-12-07 14:04:08,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 14:04:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 229 transitions. [2019-12-07 14:04:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:04:08,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:08,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:09,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 cvc4 --incremental --print-success --lang smt --rewrite-divk,46 mathsat -unsat_core_generation=3,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:04:09,364 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:04:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:09,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1097624428, now seen corresponding path program 1 times [2019-12-07 14:04:09,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:04:09,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275956605] [2019-12-07 14:04:09,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 49 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with mathsat -unsat_core_generation=3 [2019-12-07 14:04:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:09,426 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:04:09,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:04:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:04:09,459 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:04:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:04:09,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275956605] [2019-12-07 14:04:09,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:09,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2019-12-07 14:04:09,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24418360] [2019-12-07 14:04:09,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:04:09,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:04:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:04:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:09,469 INFO L87 Difference]: Start difference. First operand 186 states and 229 transitions. Second operand 5 states. [2019-12-07 14:04:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:09,510 INFO L93 Difference]: Finished difference Result 185 states and 228 transitions. [2019-12-07 14:04:09,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:04:09,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 14:04:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:09,512 INFO L225 Difference]: With dead ends: 185 [2019-12-07 14:04:09,512 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 14:04:09,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 14:04:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-12-07 14:04:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-12-07 14:04:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 228 transitions. [2019-12-07 14:04:09,516 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 228 transitions. Word has length 20 [2019-12-07 14:04:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:09,516 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 228 transitions. [2019-12-07 14:04:09,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:04:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 228 transitions. [2019-12-07 14:04:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:04:09,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:09,517 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:09,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 mathsat -unsat_core_generation=3 [2019-12-07 14:04:09,717 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:04:09,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:09,717 INFO L82 PathProgramCache]: Analyzing trace with hash 211866257, now seen corresponding path program 6 times [2019-12-07 14:04:09,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:04:09,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110194512] [2019-12-07 14:04:09,718 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 50 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with mathsat -unsat_core_generation=3 [2019-12-07 14:04:09,770 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-07 14:04:09,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:04:09,774 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 14:04:09,774 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:04:09,789 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_90|], 1=[|v_#valid_97|]} [2019-12-07 14:04:09,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:04:09,793 INFO L377 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 9 treesize of output 11 [2019-12-07 14:04:09,793 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:09,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:09,802 INFO L377 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 10 treesize of output 8 [2019-12-07 14:04:09,802 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:09,809 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:09,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:04:09,809 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:04:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:09,918 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:04:10,486 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:04:10,491 INFO L377 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 10 treesize of output 8 [2019-12-07 14:04:10,491 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:10,498 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:10,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:04:10,499 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:10,506 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:10,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:04:10,506 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:04:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:10,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110194512] [2019-12-07 14:04:10,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [202585243] [2019-12-07 14:04:10,713 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/cvc4 Starting monitored process 51 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:04:10,814 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-07 14:04:10,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:04:10,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 14:04:10,816 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:04:10,822 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_92|], 1=[|v_#valid_99|]} [2019-12-07 14:04:10,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:04:10,826 INFO L377 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 9 treesize of output 11 [2019-12-07 14:04:10,826 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:10,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:10,837 INFO L377 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 10 treesize of output 8 [2019-12-07 14:04:10,838 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:10,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:10,844 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:04:10,844 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:04:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:10,922 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:04:11,975 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:04:11,981 INFO L377 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 10 treesize of output 8 [2019-12-07 14:04:11,981 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:11,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:11,995 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:04:11,995 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:12,007 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:12,007 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:04:12,007 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-12-07 14:04:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:12,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113323331] [2019-12-07 14:04:12,437 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:04:12,492 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-07 14:04:12,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:04:12,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 14:04:12,495 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:04:12,500 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_94|], 1=[|v_#valid_101|]} [2019-12-07 14:04:12,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:04:12,503 INFO L377 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 9 treesize of output 11 [2019-12-07 14:04:12,503 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:12,510 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:12,513 INFO L377 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 10 treesize of output 8 [2019-12-07 14:04:12,513 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:12,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:12,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:04:12,520 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:04:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:12,596 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:04:13,494 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:04:13,499 INFO L377 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 10 treesize of output 8 [2019-12-07 14:04:13,499 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:13,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:13,512 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:04:13,512 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:04:13,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:04:13,522 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:04:13,522 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-12-07 14:04:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:04:13,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:04:13,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 11, 10, 11] total 31 [2019-12-07 14:04:13,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679727338] [2019-12-07 14:04:13,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 14:04:13,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:04:13,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 14:04:13,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2019-12-07 14:04:13,526 INFO L87 Difference]: Start difference. First operand 185 states and 228 transitions. Second operand 32 states. [2019-12-07 14:04:15,193 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 14:04:15,789 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 14:04:16,698 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 14:04:17,821 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-12-07 14:04:18,592 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-12-07 14:04:19,159 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 14:04:19,884 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-12-07 14:04:21,968 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-12-07 14:04:22,548 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-12-07 14:04:23,725 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-12-07 14:04:24,205 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 14:04:24,574 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 14:04:25,297 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-12-07 14:04:26,080 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 14:04:26,463 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:04:27,837 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-12-07 14:04:28,295 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-12-07 14:04:29,016 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 14:04:29,871 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-12-07 14:04:30,574 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 14:04:30,965 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 14:04:32,346 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 14:04:33,210 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 14:04:33,579 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 14:04:34,146 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-12-07 14:04:34,513 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-12-07 14:04:35,141 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 14:04:36,136 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-12-07 14:04:36,449 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-12-07 14:04:36,956 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 14:04:37,323 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 14:04:37,673 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-12-07 14:04:40,699 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:04:41,099 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 14:04:41,411 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:04:44,071 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-07 14:04:44,397 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 14:04:47,385 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 14:04:47,912 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-12-07 14:04:51,019 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-12-07 14:04:53,737 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-12-07 14:04:55,819 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-12-07 14:05:07,690 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 14:05:10,825 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 14:05:13,892 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 14:05:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:15,639 INFO L93 Difference]: Finished difference Result 1032 states and 1087 transitions. [2019-12-07 14:05:15,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-12-07 14:05:15,640 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 20 [2019-12-07 14:05:15,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:15,643 INFO L225 Difference]: With dead ends: 1032 [2019-12-07 14:05:15,643 INFO L226 Difference]: Without dead ends: 1032 [2019-12-07 14:05:15,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 76 SyntacticMatches, 9 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4743 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=2566, Invalid=11954, Unknown=0, NotChecked=0, Total=14520 [2019-12-07 14:05:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2019-12-07 14:05:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 217. [2019-12-07 14:05:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-12-07 14:05:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 268 transitions. [2019-12-07 14:05:15,651 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 268 transitions. Word has length 20 [2019-12-07 14:05:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:15,651 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 268 transitions. [2019-12-07 14:05:15,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 14:05:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 268 transitions. [2019-12-07 14:05:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:05:15,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:15,652 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:16,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 cvc4 --incremental --print-success --lang smt --rewrite-divk,52 z3 -smt2 -in SMTLIB2_COMPLIANT=true,50 mathsat -unsat_core_generation=3 [2019-12-07 14:05:16,254 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:05:16,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:16,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1325244346, now seen corresponding path program 2 times [2019-12-07 14:05:16,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:05:16,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073902283] [2019-12-07 14:05:16,256 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 53 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with mathsat -unsat_core_generation=3 [2019-12-07 14:05:16,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:05:16,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:05:16,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:05:16,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:05:16,373 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:05:16,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:05:16,374 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:16,383 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:16,384 INFO L534 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. [2019-12-07 14:05:16,384 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:22 [2019-12-07 14:05:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:05:16,459 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:05:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:05:17,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073902283] [2019-12-07 14:05:17,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [719649502] [2019-12-07 14:05:17,020 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/cvc4 Starting monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:05:17,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:05:17,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:05:17,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:05:17,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:05:17,123 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:05:17,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:05:17,123 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:17,132 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:17,132 INFO L534 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. [2019-12-07 14:05:17,133 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:22 [2019-12-07 14:05:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:05:17,135 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:05:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:05:17,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204511619] [2019-12-07 14:05:17,138 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:05:17,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:05:17,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:05:17,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:05:17,176 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:05:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:05:17,287 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:05:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:05:17,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:05:17,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 10, 12] total 31 [2019-12-07 14:05:17,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442359025] [2019-12-07 14:05:17,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 14:05:17,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:05:17,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 14:05:17,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2019-12-07 14:05:17,986 INFO L87 Difference]: Start difference. First operand 217 states and 268 transitions. Second operand 31 states. [2019-12-07 14:05:18,240 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2019-12-07 14:05:19,298 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2019-12-07 14:05:19,543 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-12-07 14:05:20,178 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-12-07 14:05:20,489 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 24 [2019-12-07 14:05:21,204 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-12-07 14:05:22,112 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-12-07 14:05:23,116 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2019-12-07 14:05:23,653 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-12-07 14:05:24,461 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2019-12-07 14:05:24,855 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-12-07 14:05:25,746 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2019-12-07 14:05:26,199 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-07 14:05:26,543 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-12-07 14:05:27,235 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2019-12-07 14:05:27,701 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2019-12-07 14:05:27,940 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:05:28,457 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-07 14:05:28,887 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-12-07 14:05:29,373 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2019-12-07 14:05:29,750 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-12-07 14:05:30,364 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2019-12-07 14:05:31,135 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-07 14:05:32,296 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-12-07 14:05:33,116 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 31 [2019-12-07 14:05:33,647 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-12-07 14:05:34,195 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-12-07 14:05:35,460 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 14:05:36,189 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2019-12-07 14:05:37,363 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2019-12-07 14:05:38,128 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-12-07 14:05:38,667 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-12-07 14:05:39,660 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2019-12-07 14:05:40,135 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-07 14:05:40,631 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-12-07 14:05:41,425 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-12-07 14:05:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:43,498 INFO L93 Difference]: Finished difference Result 628 states and 681 transitions. [2019-12-07 14:05:43,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-12-07 14:05:43,499 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 20 [2019-12-07 14:05:43,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:43,501 INFO L225 Difference]: With dead ends: 628 [2019-12-07 14:05:43,501 INFO L226 Difference]: Without dead ends: 628 [2019-12-07 14:05:43,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4864 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=3151, Invalid=12101, Unknown=0, NotChecked=0, Total=15252 [2019-12-07 14:05:43,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-12-07 14:05:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 271. [2019-12-07 14:05:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-07 14:05:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 327 transitions. [2019-12-07 14:05:43,508 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 327 transitions. Word has length 20 [2019-12-07 14:05:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:43,508 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 327 transitions. [2019-12-07 14:05:43,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 14:05:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 327 transitions. [2019-12-07 14:05:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:05:43,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:43,509 INFO L410 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:44,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 cvc4 --incremental --print-success --lang smt --rewrite-divk,55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,53 mathsat -unsat_core_generation=3 [2019-12-07 14:05:44,111 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:05:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1304271055, now seen corresponding path program 7 times [2019-12-07 14:05:44,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:05:44,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969805450] [2019-12-07 14:05:44,113 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 56 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with mathsat -unsat_core_generation=3 [2019-12-07 14:05:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:44,164 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 14:05:44,165 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:05:44,195 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_101|], 1=[|v_#valid_106|]} [2019-12-07 14:05:44,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:05:44,198 INFO L377 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 9 treesize of output 11 [2019-12-07 14:05:44,198 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:44,205 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:44,208 INFO L377 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 10 treesize of output 8 [2019-12-07 14:05:44,208 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:44,214 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:44,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:05:44,214 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:05:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:05:44,322 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:05:44,891 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:05:44,895 INFO L377 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 10 treesize of output 8 [2019-12-07 14:05:44,896 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:44,903 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:44,904 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:05:44,904 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:44,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:44,910 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:05:44,911 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:05:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:05:45,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969805450] [2019-12-07 14:05:45,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [165252783] [2019-12-07 14:05:45,304 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/cvc4 Starting monitored process 57 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:05:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:45,398 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 14:05:45,399 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:05:45,406 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_103|], 1=[|v_#valid_108|]} [2019-12-07 14:05:45,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:05:45,410 INFO L377 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 9 treesize of output 11 [2019-12-07 14:05:45,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:45,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:45,421 INFO L377 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 10 treesize of output 8 [2019-12-07 14:05:45,421 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:45,428 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:45,428 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:05:45,428 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:05:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:05:45,433 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:05:45,435 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:05:45,439 INFO L377 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 10 treesize of output 8 [2019-12-07 14:05:45,439 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:45,446 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:45,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:05:45,448 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:45,454 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:45,455 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:05:45,455 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:05:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:05:45,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479840942] [2019-12-07 14:05:45,457 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:05:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:45,494 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 14:05:45,495 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:05:45,501 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_105|], 1=[|v_#valid_110|]} [2019-12-07 14:05:45,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:05:45,504 INFO L377 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 9 treesize of output 11 [2019-12-07 14:05:45,504 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:45,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:45,514 INFO L377 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 10 treesize of output 8 [2019-12-07 14:05:45,514 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:45,521 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:45,522 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:05:45,522 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:05:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:05:45,583 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:05:46,200 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:05:46,205 INFO L377 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 10 treesize of output 8 [2019-12-07 14:05:46,206 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:46,215 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:46,216 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:05:46,217 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:05:46,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:05:46,227 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:05:46,227 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-12-07 14:05:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:05:46,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:05:47,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12, 13] total 33 [2019-12-07 14:05:47,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805250810] [2019-12-07 14:05:47,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 14:05:47,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:05:47,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 14:05:47,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=917, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 14:05:47,001 INFO L87 Difference]: Start difference. First operand 271 states and 327 transitions. Second operand 34 states. [2019-12-07 14:05:48,489 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 14:05:53,621 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-12-07 14:05:54,989 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-12-07 14:05:55,784 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-07 14:05:57,001 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-07 14:05:57,801 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-12-07 14:05:58,364 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2019-12-07 14:05:58,765 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 14:05:59,395 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-12-07 14:05:59,763 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-12-07 14:06:00,197 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-07 14:06:00,627 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-12-07 14:06:01,544 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-07 14:06:02,027 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-07 14:06:02,445 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-12-07 14:06:03,210 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-12-07 14:06:03,631 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 14:06:04,063 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-12-07 14:06:05,181 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-12-07 14:06:05,631 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-07 14:06:06,024 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-12-07 14:06:06,465 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 14:06:07,596 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-07 14:06:08,035 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-07 14:06:08,397 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-12-07 14:06:09,105 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:06:09,921 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 14:06:10,380 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-12-07 14:06:13,356 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-12-07 14:06:13,836 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-12-07 14:06:14,493 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 14:06:15,492 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-12-07 14:06:15,968 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-12-07 14:06:16,399 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:06:16,725 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 14:06:18,468 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-12-07 14:06:18,906 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 14:06:22,305 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-12-07 14:06:25,214 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 14:06:27,088 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2019-12-07 14:06:29,909 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-07 14:06:31,214 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 14:06:32,728 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-07 14:06:36,070 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-12-07 14:06:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:46,989 INFO L93 Difference]: Finished difference Result 1285 states and 1344 transitions. [2019-12-07 14:06:46,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-12-07 14:06:46,990 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 20 [2019-12-07 14:06:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:46,994 INFO L225 Difference]: With dead ends: 1285 [2019-12-07 14:06:46,994 INFO L226 Difference]: Without dead ends: 1285 [2019-12-07 14:06:46,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6675 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=4316, Invalid=15990, Unknown=0, NotChecked=0, Total=20306 [2019-12-07 14:06:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2019-12-07 14:06:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 293. [2019-12-07 14:06:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-12-07 14:06:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 353 transitions. [2019-12-07 14:06:47,003 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 353 transitions. Word has length 20 [2019-12-07 14:06:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:47,003 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 353 transitions. [2019-12-07 14:06:47,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 14:06:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 353 transitions. [2019-12-07 14:06:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:06:47,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:47,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:06:47,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 cvc4 --incremental --print-success --lang smt --rewrite-divk,56 mathsat -unsat_core_generation=3,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:06:47,606 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:06:47,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:47,606 INFO L82 PathProgramCache]: Analyzing trace with hash 333381217, now seen corresponding path program 1 times [2019-12-07 14:06:47,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:06:47,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346667758] [2019-12-07 14:06:47,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 59 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with mathsat -unsat_core_generation=3 [2019-12-07 14:06:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:47,689 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:06:47,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:06:47,698 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:06:47,699 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 14:06:47,699 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:06:47,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:06:47,704 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:06:47,704 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2019-12-07 14:06:47,713 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 14:06:47,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:06:47,720 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 14:06:47,720 INFO L534 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. [2019-12-07 14:06:47,720 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2019-12-07 14:06:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:06:47,729 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:06:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:06:47,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346667758] [2019-12-07 14:06:47,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:06:47,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 14:06:47,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459825383] [2019-12-07 14:06:47,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:06:47,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:06:47,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:06:47,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:06:47,741 INFO L87 Difference]: Start difference. First operand 293 states and 353 transitions. Second operand 6 states. [2019-12-07 14:06:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:06:55,836 INFO L93 Difference]: Finished difference Result 292 states and 352 transitions. [2019-12-07 14:06:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:06:55,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 14:06:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:06:55,838 INFO L225 Difference]: With dead ends: 292 [2019-12-07 14:06:55,838 INFO L226 Difference]: Without dead ends: 292 [2019-12-07 14:06:55,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:06:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-07 14:06:55,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-12-07 14:06:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-12-07 14:06:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 352 transitions. [2019-12-07 14:06:55,841 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 352 transitions. Word has length 21 [2019-12-07 14:06:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:06:55,841 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 352 transitions. [2019-12-07 14:06:55,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:06:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 352 transitions. [2019-12-07 14:06:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 14:06:55,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:06:55,841 INFO L410 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] [2019-12-07 14:06:56,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 mathsat -unsat_core_generation=3 [2019-12-07 14:06:56,042 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:06:56,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:06:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1743193852, now seen corresponding path program 1 times [2019-12-07 14:06:56,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:06:56,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156830417] [2019-12-07 14:06:56,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 60 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with mathsat -unsat_core_generation=3 [2019-12-07 14:06:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:06:56,108 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:06:56,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:06:56,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2019-12-07 14:06:56,113 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:06:56,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:06:56,115 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:06:56,115 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:06:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:06:58,181 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:07:02,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156830417] [2019-12-07 14:07:02,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:07:02,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2019-12-07 14:07:02,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989058907] [2019-12-07 14:07:02,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:07:02,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:07:02,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:07:02,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=78, Unknown=3, NotChecked=0, Total=110 [2019-12-07 14:07:02,246 INFO L87 Difference]: Start difference. First operand 292 states and 352 transitions. Second operand 11 states. [2019-12-07 14:07:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:08,567 INFO L93 Difference]: Finished difference Result 291 states and 351 transitions. [2019-12-07 14:07:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:07:08,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-07 14:07:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:08,569 INFO L225 Difference]: With dead ends: 291 [2019-12-07 14:07:08,569 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 14:07:08,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=49, Invalid=130, Unknown=3, NotChecked=0, Total=182 [2019-12-07 14:07:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 14:07:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-12-07 14:07:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-07 14:07:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 329 transitions. [2019-12-07 14:07:08,572 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 329 transitions. Word has length 23 [2019-12-07 14:07:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:08,572 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 329 transitions. [2019-12-07 14:07:08,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:07:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 329 transitions. [2019-12-07 14:07:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 14:07:08,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:08,572 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:08,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 mathsat -unsat_core_generation=3 [2019-12-07 14:07:08,773 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:07:08,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1894290796, now seen corresponding path program 8 times [2019-12-07 14:07:08,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:07:08,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897412232] [2019-12-07 14:07:08,774 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 61 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with mathsat -unsat_core_generation=3 [2019-12-07 14:07:08,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:07:08,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:07:08,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:07:08,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:08,892 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:09,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897412232] [2019-12-07 14:07:09,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1564315837] [2019-12-07 14:07:09,096 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/cvc4 Starting monitored process 62 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:07:09,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:07:09,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:07:09,193 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:07:09,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:09,224 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:09,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881587043] [2019-12-07 14:07:09,226 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:07:09,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:07:09,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:07:09,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:07:09,268 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:09,282 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:09,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:07:09,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11, 11] total 20 [2019-12-07 14:07:09,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296132982] [2019-12-07 14:07:09,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 14:07:09,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:07:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 14:07:09,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:07:09,284 INFO L87 Difference]: Start difference. First operand 271 states and 329 transitions. Second operand 20 states. [2019-12-07 14:07:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:10,743 INFO L93 Difference]: Finished difference Result 304 states and 350 transitions. [2019-12-07 14:07:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 14:07:10,744 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-12-07 14:07:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:10,745 INFO L225 Difference]: With dead ends: 304 [2019-12-07 14:07:10,745 INFO L226 Difference]: Without dead ends: 304 [2019-12-07 14:07:10,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 108 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2019-12-07 14:07:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-07 14:07:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 258. [2019-12-07 14:07:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-12-07 14:07:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 309 transitions. [2019-12-07 14:07:10,748 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 309 transitions. Word has length 23 [2019-12-07 14:07:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:10,748 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 309 transitions. [2019-12-07 14:07:10,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 14:07:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 309 transitions. [2019-12-07 14:07:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:07:10,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:10,749 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:11,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 mathsat -unsat_core_generation=3,62 cvc4 --incremental --print-success --lang smt --rewrite-divk,63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:07:11,351 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:07:11,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:11,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1173851531, now seen corresponding path program 1 times [2019-12-07 14:07:11,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:07:11,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982094447] [2019-12-07 14:07:11,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 64 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with mathsat -unsat_core_generation=3 [2019-12-07 14:07:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:11,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:07:11,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:11,417 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:07:11,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:07:11,418 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:11,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:11,423 INFO L534 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. [2019-12-07 14:07:11,423 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:16 [2019-12-07 14:07:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 14:07:11,463 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 14:07:11,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982094447] [2019-12-07 14:07:11,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1328827183] [2019-12-07 14:07:11,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/cvc4 Starting monitored process 65 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:07:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:11,954 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:07:11,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:11,969 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:07:11,970 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:07:11,970 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:11,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:11,975 INFO L534 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. [2019-12-07 14:07:11,975 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:16 [2019-12-07 14:07:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 14:07:11,978 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 14:07:11,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498632676] [2019-12-07 14:07:11,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:07:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:07:12,020 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 14:07:12,021 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:12,033 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:07:12,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 14:07:12,034 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:12,039 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:12,039 INFO L534 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. [2019-12-07 14:07:12,039 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:16 [2019-12-07 14:07:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 14:07:12,058 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 14:07:12,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:07:12,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 8] total 18 [2019-12-07 14:07:12,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077845923] [2019-12-07 14:07:12,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 14:07:12,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:07:12,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 14:07:12,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:07:12,507 INFO L87 Difference]: Start difference. First operand 258 states and 309 transitions. Second operand 19 states. [2019-12-07 14:07:13,429 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-12-07 14:07:15,789 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-12-07 14:07:16,064 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:07:19,225 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-12-07 14:07:19,538 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-12-07 14:07:19,959 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-12-07 14:07:20,294 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 14:07:20,658 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 14:07:21,292 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-12-07 14:07:21,944 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 14:07:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:07:22,658 INFO L93 Difference]: Finished difference Result 414 states and 459 transitions. [2019-12-07 14:07:22,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 14:07:22,659 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-12-07 14:07:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:07:22,661 INFO L225 Difference]: With dead ends: 414 [2019-12-07 14:07:22,661 INFO L226 Difference]: Without dead ends: 410 [2019-12-07 14:07:22,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=605, Invalid=1845, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 14:07:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-12-07 14:07:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 278. [2019-12-07 14:07:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-12-07 14:07:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 330 transitions. [2019-12-07 14:07:22,664 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 330 transitions. Word has length 24 [2019-12-07 14:07:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:07:22,664 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 330 transitions. [2019-12-07 14:07:22,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 14:07:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 330 transitions. [2019-12-07 14:07:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:07:22,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:07:22,665 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:07:23,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,65 cvc4 --incremental --print-success --lang smt --rewrite-divk,64 mathsat -unsat_core_generation=3 [2019-12-07 14:07:23,267 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:07:23,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:07:23,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1717365455, now seen corresponding path program 9 times [2019-12-07 14:07:23,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:07:23,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495778061] [2019-12-07 14:07:23,269 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 67 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with mathsat -unsat_core_generation=3 [2019-12-07 14:07:23,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 14:07:23,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:07:23,363 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 14:07:23,364 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:23,382 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_118|], 1=[|v_#valid_129|]} [2019-12-07 14:07:23,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:07:23,385 INFO L377 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 9 treesize of output 11 [2019-12-07 14:07:23,385 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:23,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:23,396 INFO L377 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 10 treesize of output 8 [2019-12-07 14:07:23,396 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:23,403 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:23,403 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:07:23,403 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:07:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:23,589 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:24,913 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:07:24,917 INFO L377 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 10 treesize of output 8 [2019-12-07 14:07:24,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:24,928 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:24,929 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:07:24,929 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:24,939 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:24,939 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:07:24,939 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-12-07 14:07:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:25,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495778061] [2019-12-07 14:07:25,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2072535830] [2019-12-07 14:07:25,441 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/cvc4 Starting monitored process 68 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:07:25,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 14:07:25,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:07:25,553 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 14:07:25,554 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:25,559 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_120|], 1=[|v_#valid_131|]} [2019-12-07 14:07:25,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:07:25,562 INFO L377 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 13 treesize of output 15 [2019-12-07 14:07:25,562 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:25,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:25,577 INFO L377 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 10 treesize of output 8 [2019-12-07 14:07:25,577 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:25,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:25,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:07:25,586 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:27 [2019-12-07 14:07:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:25,814 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:26,396 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:07:26,401 INFO L377 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 10 treesize of output 8 [2019-12-07 14:07:26,401 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:26,414 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:26,416 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:07:26,416 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:26,428 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:26,428 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:07:26,428 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:16 [2019-12-07 14:07:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:27,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216355096] [2019-12-07 14:07:27,257 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:07:27,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 14:07:27,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:07:27,321 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 14:07:27,321 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:07:27,323 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_122|], 1=[|v_#valid_133|]} [2019-12-07 14:07:27,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:07:27,327 INFO L377 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 13 treesize of output 15 [2019-12-07 14:07:27,327 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:27,337 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:27,340 INFO L377 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 10 treesize of output 8 [2019-12-07 14:07:27,340 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:27,349 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:27,349 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:07:27,350 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:27 [2019-12-07 14:07:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:27,441 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:07:29,211 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:07:29,217 INFO L377 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 10 treesize of output 8 [2019-12-07 14:07:29,217 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:29,229 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:29,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:07:29,230 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:07:29,242 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:07:29,243 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:07:29,243 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:16 [2019-12-07 14:07:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:07:29,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:07:29,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13, 14, 13, 14] total 39 [2019-12-07 14:07:29,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576026507] [2019-12-07 14:07:29,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 14:07:29,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:07:29,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 14:07:29,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 14:07:29,249 INFO L87 Difference]: Start difference. First operand 278 states and 330 transitions. Second operand 40 states. [2019-12-07 14:07:29,614 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 14:07:31,189 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-07 14:07:32,200 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-12-07 14:07:33,152 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-12-07 14:07:33,757 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-12-07 14:07:34,388 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-12-07 14:07:34,890 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-12-07 14:07:35,301 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 14:07:36,027 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-07 14:07:37,353 WARN L192 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-12-07 14:07:37,675 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 14:07:38,298 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-12-07 14:07:39,331 WARN L192 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-12-07 14:07:39,981 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 14:07:40,776 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-12-07 14:07:41,305 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-12-07 14:07:42,297 WARN L192 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-12-07 14:07:42,770 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 14:07:43,357 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 14:07:44,386 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-12-07 14:07:44,955 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-07 14:07:45,875 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-12-07 14:07:46,743 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-12-07 14:07:47,216 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 14:07:47,747 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 14:07:48,489 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 14:07:49,293 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-12-07 14:07:49,695 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 14:07:50,247 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 14:07:51,083 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-12-07 14:07:52,041 WARN L192 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2019-12-07 14:07:52,556 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 14:07:53,281 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 14:07:53,682 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 14:07:54,297 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-12-07 14:07:55,186 WARN L192 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-12-07 14:07:56,048 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-12-07 14:07:56,489 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 14:07:57,182 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-12-07 14:07:58,995 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-12-07 14:07:59,645 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 14:08:00,368 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-12-07 14:08:00,775 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 14:08:01,978 WARN L192 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-12-07 14:08:02,494 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 14:08:03,178 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-07 14:08:04,161 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-12-07 14:08:05,139 WARN L192 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-12-07 14:08:05,608 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 14:08:06,235 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-12-07 14:08:07,815 WARN L192 SmtUtils]: Spent 965.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-12-07 14:08:08,405 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 14:08:09,211 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-12-07 14:08:09,714 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 14:08:11,942 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 28 [2019-12-07 14:08:12,581 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 14:08:13,115 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 14:08:13,895 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-12-07 14:08:14,845 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2019-12-07 14:08:15,497 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-12-07 14:08:16,230 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-12-07 14:08:16,693 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 14:08:17,424 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-12-07 14:08:18,830 WARN L192 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2019-12-07 14:08:19,600 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-12-07 14:08:20,298 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-12-07 14:08:21,002 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 14:08:21,466 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 14:08:23,016 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-12-07 14:08:24,876 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-12-07 14:08:25,579 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-12-07 14:08:26,228 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-12-07 14:08:26,828 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 14:08:29,888 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 14:08:30,764 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-12-07 14:08:31,419 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-12-07 14:08:32,101 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-12-07 14:08:32,569 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-12-07 14:08:33,622 WARN L192 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-12-07 14:08:35,229 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 14:08:36,096 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-12-07 14:08:36,800 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-07 14:08:37,262 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-07 14:08:39,727 WARN L192 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2019-12-07 14:08:40,348 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 14:08:41,735 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 14:08:42,528 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-12-07 14:08:42,900 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-12-07 14:08:45,800 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 14:08:47,168 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 14:08:48,727 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 14:08:50,859 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 14:08:52,327 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 14:08:53,040 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 14:08:53,524 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-12-07 14:08:56,306 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 14:08:57,781 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 14:08:58,421 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 14:08:58,921 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-12-07 14:09:00,932 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 14:09:03,965 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 14:09:05,261 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 14:09:11,970 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-12-07 14:09:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:09:22,209 INFO L93 Difference]: Finished difference Result 870 states and 922 transitions. [2019-12-07 14:09:22,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-12-07 14:09:22,209 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 24 [2019-12-07 14:09:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:09:22,212 INFO L225 Difference]: With dead ends: 870 [2019-12-07 14:09:22,212 INFO L226 Difference]: Without dead ends: 870 [2019-12-07 14:09:22,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 90 SyntacticMatches, 10 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9086 ImplicationChecksByTransitivity, 70.0s TimeCoverageRelationStatistics Valid=4123, Invalid=21637, Unknown=0, NotChecked=0, Total=25760 [2019-12-07 14:09:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-12-07 14:09:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 295. [2019-12-07 14:09:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-12-07 14:09:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 354 transitions. [2019-12-07 14:09:22,218 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 354 transitions. Word has length 24 [2019-12-07 14:09:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:09:22,218 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 354 transitions. [2019-12-07 14:09:22,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 14:09:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 354 transitions. [2019-12-07 14:09:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:09:22,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:09:22,219 INFO L410 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:09:22,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 mathsat -unsat_core_generation=3,69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,68 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:09:22,821 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:09:22,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:09:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1758958447, now seen corresponding path program 10 times [2019-12-07 14:09:22,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:09:22,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868852201] [2019-12-07 14:09:22,823 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 70 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with mathsat -unsat_core_generation=3 [2019-12-07 14:09:22,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:09:22,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:09:22,889 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 14:09:22,890 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:09:22,981 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_124|], 1=[|v_#valid_135|]} [2019-12-07 14:09:22,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:22,984 INFO L377 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 9 treesize of output 11 [2019-12-07 14:09:22,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:22,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:22,994 INFO L377 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 10 treesize of output 8 [2019-12-07 14:09:22,994 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:23,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:23,001 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:09:23,001 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:09:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:23,123 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:09:23,658 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:09:23,662 INFO L377 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 10 treesize of output 8 [2019-12-07 14:09:23,662 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:23,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:23,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:09:23,670 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:23,676 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:23,677 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:09:23,677 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:09:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:24,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868852201] [2019-12-07 14:09:24,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1966393105] [2019-12-07 14:09:24,770 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/cvc4 Starting monitored process 71 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:09:24,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:09:24,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:09:24,883 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 14:09:24,884 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:09:24,901 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_126|], 1=[|v_#valid_137|]} [2019-12-07 14:09:24,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:24,904 INFO L377 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 9 treesize of output 11 [2019-12-07 14:09:24,904 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:24,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:24,914 INFO L377 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 10 treesize of output 8 [2019-12-07 14:09:24,914 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:24,920 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:24,920 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:09:24,921 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:09:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:24,924 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:09:24,926 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:09:24,930 INFO L377 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 10 treesize of output 8 [2019-12-07 14:09:24,930 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:24,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:24,938 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:09:24,938 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:24,944 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:24,944 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:09:24,945 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 14:09:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:24,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011653125] [2019-12-07 14:09:24,948 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:09:24,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:09:24,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:09:24,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 14:09:24,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:09:25,013 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_128|], 1=[|v_#valid_139|]} [2019-12-07 14:09:25,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:09:25,016 INFO L377 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 9 treesize of output 11 [2019-12-07 14:09:25,016 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:25,024 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:25,027 INFO L377 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 10 treesize of output 8 [2019-12-07 14:09:25,027 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:25,034 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:25,034 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:09:25,034 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-12-07 14:09:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:25,102 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:09:25,573 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:09:25,578 INFO L377 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 10 treesize of output 8 [2019-12-07 14:09:25,579 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:25,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:25,591 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:09:25,591 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:09:25,604 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:09:25,604 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:09:25,604 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-12-07 14:09:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:27,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:09:27,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18, 18, 18, 19] total 51 [2019-12-07 14:09:27,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728672991] [2019-12-07 14:09:27,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 14:09:27,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:09:27,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 14:09:27,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=2118, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 14:09:27,784 INFO L87 Difference]: Start difference. First operand 295 states and 354 transitions. Second operand 52 states. [2019-12-07 14:09:28,226 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-12-07 14:09:29,693 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-07 14:09:30,621 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:09:31,526 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:09:32,481 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:09:33,467 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:09:34,474 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:09:35,509 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:09:36,569 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:09:37,385 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-12-07 14:09:38,034 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:09:38,768 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2019-12-07 14:09:40,372 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-07 14:09:41,142 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-12-07 14:09:41,553 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2019-12-07 14:09:42,180 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:09:42,722 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2019-12-07 14:09:43,124 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-12-07 14:09:43,696 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:09:44,354 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-12-07 14:09:44,871 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-12-07 14:09:46,261 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-12-07 14:09:46,735 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-12-07 14:09:49,109 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-12-07 14:09:49,767 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-12-07 14:09:50,229 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-12-07 14:09:51,736 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-12-07 14:09:52,737 WARN L192 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-12-07 14:09:53,353 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-12-07 14:09:53,812 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-07 14:09:55,404 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-12-07 14:09:56,433 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-12-07 14:09:57,046 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-12-07 14:09:57,487 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-07 14:10:00,048 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-12-07 14:10:01,077 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-12-07 14:10:01,714 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-12-07 14:10:05,232 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-12-07 14:10:06,308 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-12-07 14:10:06,941 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-12-07 14:10:07,366 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-12-07 14:10:10,400 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-12-07 14:10:11,476 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-12-07 14:10:12,050 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-07 14:10:16,662 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-12-07 14:10:17,638 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-12-07 14:10:18,228 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-07 14:10:21,930 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-12-07 14:10:22,941 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2019-12-07 14:10:23,530 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-12-07 14:10:27,171 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-12-07 14:10:28,197 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-07 14:10:29,175 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-12-07 14:10:29,785 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-07 14:10:33,061 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-12-07 14:10:33,904 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-12-07 14:10:34,964 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-07 14:10:35,890 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-12-07 14:10:36,415 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-12-07 14:10:39,088 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-12-07 14:10:39,930 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-12-07 14:10:40,968 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-12-07 14:10:41,917 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-12-07 14:10:44,814 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-12-07 14:10:45,863 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-12-07 14:10:46,811 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-12-07 14:10:49,446 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-12-07 14:10:50,468 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-12-07 14:10:51,487 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 14:10:51,914 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 14:10:54,463 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-12-07 14:10:56,382 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-07 14:10:58,426 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-12-07 14:11:00,313 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 14:11:02,311 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-12-07 14:11:05,113 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-12-07 14:11:06,942 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-12-07 14:11:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:11:14,284 INFO L93 Difference]: Finished difference Result 1552 states and 1628 transitions. [2019-12-07 14:11:14,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-12-07 14:11:14,285 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 24 [2019-12-07 14:11:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:11:14,290 INFO L225 Difference]: With dead ends: 1552 [2019-12-07 14:11:14,290 INFO L226 Difference]: Without dead ends: 1552 [2019-12-07 14:11:14,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 81 SyntacticMatches, 7 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13962 ImplicationChecksByTransitivity, 71.2s TimeCoverageRelationStatistics Valid=10180, Invalid=30826, Unknown=0, NotChecked=0, Total=41006 [2019-12-07 14:11:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-12-07 14:11:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 314. [2019-12-07 14:11:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-07 14:11:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 377 transitions. [2019-12-07 14:11:14,299 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 377 transitions. Word has length 24 [2019-12-07 14:11:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:11:14,299 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 377 transitions. [2019-12-07 14:11:14,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 14:11:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 377 transitions. [2019-12-07 14:11:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:11:14,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:11:14,299 INFO L410 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] [2019-12-07 14:11:14,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 cvc4 --incremental --print-success --lang smt --rewrite-divk,70 mathsat -unsat_core_generation=3,72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:11:14,902 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 14:11:14,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:11:14,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1491690119, now seen corresponding path program 1 times [2019-12-07 14:11:14,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:11:14,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081188068] [2019-12-07 14:11:14,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/mathsat Starting monitored process 73 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with mathsat -unsat_core_generation=3 [2019-12-07 14:11:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:11:15,003 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 14:11:15,003 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:11:15,011 INFO L377 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 10 treesize of output 8 [2019-12-07 14:11:15,011 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:11:15,023 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:15,023 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:11:15,023 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 14:11:15,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:11:15,042 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:11:15,051 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:15,051 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:11:15,051 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 14:11:15,085 INFO L377 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 23 treesize of output 22 [2019-12-07 14:11:15,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:11:15,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:15,098 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:11:15,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-12-07 14:11:15,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-12-07 14:11:15,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:11:15,171 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:15,171 INFO L534 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. [2019-12-07 14:11:15,171 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-12-07 14:11:15,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2019-12-07 14:11:15,234 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:11:15,251 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:15,251 INFO L534 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. [2019-12-07 14:11:15,252 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-12-07 14:11:15,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:15,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 44 [2019-12-07 14:11:15,340 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:11:15,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:15,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:11:15,345 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:9 [2019-12-07 14:11:15,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:11:15,364 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:11:20,153 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2019-12-07 14:11:20,153 INFO L343 Elim1Store]: treesize reduction 85, result has 24.1 percent of original size [2019-12-07 14:11:20,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 85 treesize of output 54 [2019-12-07 14:11:20,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:11:20,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 68 [2019-12-07 14:11:20,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:20,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:20,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:20,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:20,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:20,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:11:20,177 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_73], 1=[v_arrayElimCell_75], 3=[v_arrayElimCell_74]} [2019-12-07 14:11:20,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081188068] [2019-12-07 14:11:20,182 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4f67702a [2019-12-07 14:11:20,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [424276698] [2019-12-07 14:11:20,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/cvc4 Starting monitored process 74 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:11:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:11:20,294 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 14:11:20,294 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:11:20,295 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4f67702a [2019-12-07 14:11:20,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257388033] [2019-12-07 14:11:20,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62f01137-1a2f-4b9a-8a57-dc18905c7005/bin/utaipan/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:11:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:11:20,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 14:11:20,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:11:20,338 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4f67702a [2019-12-07 14:11:20,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:11:20,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 14:11:20,339 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 14:11:20,339 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:11:20,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 cvc4 --incremental --print-success --lang smt --rewrite-divk,75 z3 -smt2 -in SMTLIB2_COMPLIANT=true,73 mathsat -unsat_core_generation=3 [2019-12-07 14:11:20,971 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 14:11:20,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:11:20 BoogieIcfgContainer [2019-12-07 14:11:20,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:11:20,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:11:20,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:11:20,972 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:11:20,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:02:37" (3/4) ... [2019-12-07 14:11:20,975 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:11:20,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:11:20,976 INFO L168 Benchmark]: Toolchain (without parser) took 523683.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:11:20,976 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:11:20,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:11:20,976 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:11:20,976 INFO L168 Benchmark]: Boogie Preprocessor took 21.50 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. [2019-12-07 14:11:20,976 INFO L168 Benchmark]: RCFGBuilder took 298.50 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:11:20,976 INFO L168 Benchmark]: TraceAbstraction took 523003.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:11:20,976 INFO L168 Benchmark]: Witness Printer took 2.91 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. [2019-12-07 14:11:20,977 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.50 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 298.50 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 523003.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.91 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 534]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L512] int *a, *b; [L513] int n; [L525] n = 1 [L526] COND TRUE __VERIFIER_nondet_int() && n < 30 [L527] n++ [L526] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L529] a = malloc (n * sizeof(*a)) [L530] b = malloc (n * sizeof(*b)) [L531] EXPR b++ [L531] *b++ = n [L517] int i; [L518] i = 0 [L518] COND TRUE i < n [L519] a[i] = n [L518] i++ [L518] COND TRUE i < n [L519] a[i] = n [L518] i++ [L518] COND FALSE !(i < n) [L520] i = 0 [L520] COND TRUE i < n - 1 [L521] b[i] = n [L520] i++ [L520] COND FALSE !(i < n - 1) [L533] EXPR b[-1] [L533] EXPR b[n - 2] [L533] COND TRUE b[-1] - b[n - 2] [L534] free(a) [L534] free(a) [L534] free(a) [L534] free(b) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 23 error locations. Result: UNKNOWN, OverallTime: 522.9s, OverallIterations: 32, TraceHistogramMax: 14, AutomataDifference: 463.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2119 SDtfs, 54889 SDslu, 18295 SDs, 0 SdLazy, 29425 SolverSat, 4463 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 204.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3008 GetRequests, 1620 SyntacticMatches, 88 SemanticMatches, 1300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46070 ImplicationChecksByTransitivity, 277.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 8424 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 1143 NumberOfCodeBlocks, 1137 NumberOfCodeBlocksAsserted, 140 NumberOfCheckSat, 2144 ConstructedInterpolants, 260 QuantifiedInterpolants, 450969 SizeOfPredicates, 349 NumberOfNonLiveVariables, 4186 ConjunctsInSsa, 783 ConjunctsInUnsatCore, 142 InterpolantComputations, 24 PerfectInterpolantSequences, 238/2694 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...