./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cd87c15c4637a3ecd407847e5a675763d5fece5 ............................................................................................................................................................................................................................... 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_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cd87c15c4637a3ecd407847e5a675763d5fece5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 23:30:45,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:30:45,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:30:45,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:30:45,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:30:45,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:30:45,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:30:45,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:30:45,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:30:45,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:30:45,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:30:45,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:30:45,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:30:45,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:30:45,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:30:45,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:30:45,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:30:45,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:30:45,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:30:45,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:30:45,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:30:45,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:30:45,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:30:45,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:30:45,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:30:45,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:30:45,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:30:45,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:30:45,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:30:45,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:30:45,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:30:45,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:30:45,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:30:45,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:30:45,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:30:45,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:30:45,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:30:45,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:30:45,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:30:45,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:30:45,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:30:45,415 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:30:45,430 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:30:45,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:30:45,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:30:45,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:30:45,432 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:30:45,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:30:45,432 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:30:45,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:30:45,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:30:45,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:30:45,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:30:45,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:30:45,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:30:45,433 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:30:45,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:30:45,434 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:30:45,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:30:45,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:30:45,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:30:45,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:30:45,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:30:45,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:30:45,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:30:45,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:30:45,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:30:45,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:30:45,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:30:45,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:30:45,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 9cd87c15c4637a3ecd407847e5a675763d5fece5 [2019-11-19 23:30:45,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:30:45,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:30:45,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:30:45,611 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:30:45,611 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:30:45,612 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/../../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2019-11-19 23:30:45,664 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/data/25da34aed/5b36c1e998d2489ab08b961f8a299625/FLAG5b4a6e1da [2019-11-19 23:30:46,096 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:30:46,097 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2019-11-19 23:30:46,103 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/data/25da34aed/5b36c1e998d2489ab08b961f8a299625/FLAG5b4a6e1da [2019-11-19 23:30:46,119 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/data/25da34aed/5b36c1e998d2489ab08b961f8a299625 [2019-11-19 23:30:46,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:30:46,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:30:46,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:30:46,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:30:46,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:30:46,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:30:46" (1/1) ... [2019-11-19 23:30:46,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3430b136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46, skipping insertion in model container [2019-11-19 23:30:46,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:30:46" (1/1) ... [2019-11-19 23:30:46,144 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:30:46,161 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:30:46,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:30:46,365 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:30:46,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:30:46,405 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:30:46,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46 WrapperNode [2019-11-19 23:30:46,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:30:46,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:30:46,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:30:46,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:30:46,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46" (1/1) ... [2019-11-19 23:30:46,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46" (1/1) ... [2019-11-19 23:30:46,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:30:46,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:30:46,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:30:46,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:30:46,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46" (1/1) ... [2019-11-19 23:30:46,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46" (1/1) ... [2019-11-19 23:30:46,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46" (1/1) ... [2019-11-19 23:30:46,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46" (1/1) ... [2019-11-19 23:30:46,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46" (1/1) ... [2019-11-19 23:30:46,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46" (1/1) ... [2019-11-19 23:30:46,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46" (1/1) ... [2019-11-19 23:30:46,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:30:46,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:30:46,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:30:46,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:30:46,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/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-11-19 23:30:46,500 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2019-11-19 23:30:46,500 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2019-11-19 23:30:46,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:30:46,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:30:46,651 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:30:46,651 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 23:30:46,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:30:46 BoogieIcfgContainer [2019-11-19 23:30:46,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:30:46,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:30:46,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:30:46,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:30:46,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:30:46" (1/3) ... [2019-11-19 23:30:46,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fac11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:30:46, skipping insertion in model container [2019-11-19 23:30:46,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:46" (2/3) ... [2019-11-19 23:30:46,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fac11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:30:46, skipping insertion in model container [2019-11-19 23:30:46,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:30:46" (3/3) ... [2019-11-19 23:30:46,659 INFO L109 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2019-11-19 23:30:46,666 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:30:46,670 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:30:46,678 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:30:46,703 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:30:46,704 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:30:46,704 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:30:46,704 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:30:46,705 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:30:46,706 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:30:46,707 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:30:46,707 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:30:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-11-19 23:30:46,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 23:30:46,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:46,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:46,728 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2032829855, now seen corresponding path program 1 times [2019-11-19 23:30:46,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:30:46,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913638455] [2019-11-19 23:30:46,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:30:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:30:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:30:46,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:30:46,850 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 23:30:46,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:30:46 BoogieIcfgContainer [2019-11-19 23:30:46,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:30:46,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:30:46,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:30:46,869 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:30:46,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:30:46" (3/4) ... [2019-11-19 23:30:46,872 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 23:30:46,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:30:46,875 INFO L168 Benchmark]: Toolchain (without parser) took 750.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:30:46,875 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:30:46,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -209.9 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:30:46,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.80 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-11-19 23:30:46,878 INFO L168 Benchmark]: Boogie Preprocessor took 13.43 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.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:30:46,878 INFO L168 Benchmark]: RCFGBuilder took 203.52 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.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:30:46,879 INFO L168 Benchmark]: TraceAbstraction took 214.59 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: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:30:46,879 INFO L168 Benchmark]: Witness Printer took 4.20 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-11-19 23:30:46,883 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -209.9 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.43 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.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 203.52 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.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 214.59 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: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.20 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: 34]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 31. Possible FailurePath: [L25] int n = __VERIFIER_nondet_int(); [L26] COND FALSE !(n < 1) [L29] CALL, EXPR hanoi(n) VAL [\old(n)=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L29] RET, EXPR hanoi(n) [L29] unsigned result = hanoi(n); [L31] COND FALSE !(result+1>0 && result+1 == 1< main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 9cd87c15c4637a3ecd407847e5a675763d5fece5 [2019-11-19 23:30:49,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:30:49,303 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:30:49,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:30:49,307 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:30:49,308 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:30:49,309 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/../../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2019-11-19 23:30:49,363 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/data/d3ed4f729/dc18b660f3de47ee9caba0521379dbcb/FLAGdc67e4ace [2019-11-19 23:30:49,727 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:30:49,727 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2019-11-19 23:30:49,734 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/data/d3ed4f729/dc18b660f3de47ee9caba0521379dbcb/FLAGdc67e4ace [2019-11-19 23:30:50,110 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/data/d3ed4f729/dc18b660f3de47ee9caba0521379dbcb [2019-11-19 23:30:50,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:30:50,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:30:50,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:30:50,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:30:50,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:30:50,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:30:50" (1/1) ... [2019-11-19 23:30:50,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fc1056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50, skipping insertion in model container [2019-11-19 23:30:50,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:30:50" (1/1) ... [2019-11-19 23:30:50,129 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:30:50,142 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:30:50,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:30:50,323 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:30:50,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:30:50,362 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:30:50,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50 WrapperNode [2019-11-19 23:30:50,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:30:50,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:30:50,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:30:50,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:30:50,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50" (1/1) ... [2019-11-19 23:30:50,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50" (1/1) ... [2019-11-19 23:30:50,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:30:50,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:30:50,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:30:50,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:30:50,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50" (1/1) ... [2019-11-19 23:30:50,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50" (1/1) ... [2019-11-19 23:30:50,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50" (1/1) ... [2019-11-19 23:30:50,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50" (1/1) ... [2019-11-19 23:30:50,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50" (1/1) ... [2019-11-19 23:30:50,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50" (1/1) ... [2019-11-19 23:30:50,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50" (1/1) ... [2019-11-19 23:30:50,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:30:50,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:30:50,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:30:50,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:30:50,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/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-11-19 23:30:50,549 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2019-11-19 23:30:50,549 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2019-11-19 23:30:50,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:30:50,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:30:50,739 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:30:50,739 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 23:30:50,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:30:50 BoogieIcfgContainer [2019-11-19 23:30:50,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:30:50,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:30:50,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:30:50,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:30:50,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:30:50" (1/3) ... [2019-11-19 23:30:50,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c85506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:30:50, skipping insertion in model container [2019-11-19 23:30:50,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:50" (2/3) ... [2019-11-19 23:30:50,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c85506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:30:50, skipping insertion in model container [2019-11-19 23:30:50,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:30:50" (3/3) ... [2019-11-19 23:30:50,748 INFO L109 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2019-11-19 23:30:50,759 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:30:50,766 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:30:50,779 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:30:50,803 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:30:50,803 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:30:50,811 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:30:50,811 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:30:50,811 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:30:50,811 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:30:50,811 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:30:50,812 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:30:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-11-19 23:30:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 23:30:50,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:50,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:50,836 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:50,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2032829855, now seen corresponding path program 1 times [2019-11-19 23:30:50,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:30:50,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1623758712] [2019-11-19 23:30:50,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:30:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:50,918 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:30:50,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:30:51,088 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:30:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:30:51,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1623758712] [2019-11-19 23:30:51,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:30:51,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-19 23:30:51,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843360622] [2019-11-19 23:30:51,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 23:30:51,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:30:51,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 23:30:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:30:51,358 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 11 states. [2019-11-19 23:30:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:51,609 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-11-19 23:30:51,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:30:51,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-11-19 23:30:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:51,626 INFO L225 Difference]: With dead ends: 31 [2019-11-19 23:30:51,626 INFO L226 Difference]: Without dead ends: 15 [2019-11-19 23:30:51,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:30:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-19 23:30:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-19 23:30:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 23:30:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-19 23:30:51,665 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2019-11-19 23:30:51,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:51,666 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 23:30:51,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 23:30:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-11-19 23:30:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 23:30:51,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:51,668 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:51,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:30:51,870 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:51,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:51,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1521841779, now seen corresponding path program 1 times [2019-11-19 23:30:51,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:30:51,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [631790449] [2019-11-19 23:30:51,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:30:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:51,924 WARN L253 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:30:51,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 23:30:52,070 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:30:52,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:52,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:30:52,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [631790449] [2019-11-19 23:30:52,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:30:52,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-19 23:30:52,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562318519] [2019-11-19 23:30:52,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 23:30:52,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:30:52,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 23:30:52,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-19 23:30:52,747 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 16 states. [2019-11-19 23:30:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:53,253 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-11-19 23:30:53,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 23:30:53,254 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-11-19 23:30:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:53,255 INFO L225 Difference]: With dead ends: 27 [2019-11-19 23:30:53,255 INFO L226 Difference]: Without dead ends: 21 [2019-11-19 23:30:53,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-11-19 23:30:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-19 23:30:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-19 23:30:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-19 23:30:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-19 23:30:53,262 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2019-11-19 23:30:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:53,263 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-19 23:30:53,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 23:30:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-11-19 23:30:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 23:30:53,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:53,264 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:53,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:30:53,469 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:53,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:53,470 INFO L82 PathProgramCache]: Analyzing trace with hash -88960435, now seen corresponding path program 2 times [2019-11-19 23:30:53,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:30:53,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1752522219] [2019-11-19 23:30:53,484 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:30:53,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:30:53,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:30:53,543 WARN L253 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-19 23:30:53,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 23:30:53,816 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:30:54,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:54,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:54,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:54,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 23:30:55,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1752522219] [2019-11-19 23:30:55,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:30:55,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-11-19 23:30:55,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325328626] [2019-11-19 23:30:55,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-19 23:30:55,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:30:55,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-19 23:30:55,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2019-11-19 23:30:55,124 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 26 states. [2019-11-19 23:30:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:55,864 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-19 23:30:55,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 23:30:55,865 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2019-11-19 23:30:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:55,866 INFO L225 Difference]: With dead ends: 33 [2019-11-19 23:30:55,866 INFO L226 Difference]: Without dead ends: 27 [2019-11-19 23:30:55,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2019-11-19 23:30:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-19 23:30:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-19 23:30:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 23:30:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-19 23:30:55,873 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 28 [2019-11-19 23:30:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:55,874 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-19 23:30:55,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-19 23:30:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-19 23:30:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-19 23:30:55,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:55,876 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:56,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:30:56,077 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1444383501, now seen corresponding path program 3 times [2019-11-19 23:30:56,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:30:56,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2013785304] [2019-11-19 23:30:56,078 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/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-11-19 23:30:56,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-19 23:30:56,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:30:56,155 WARN L253 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-19 23:30:56,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-19 23:30:56,438 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:30:57,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:57,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:57,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:57,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:58,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:58,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 23:30:58,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2013785304] [2019-11-19 23:30:58,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:30:58,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2019-11-19 23:30:58,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184959362] [2019-11-19 23:30:58,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-19 23:30:58,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:30:58,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-19 23:30:58,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 23:30:58,626 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 36 states. [2019-11-19 23:30:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:59,724 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-19 23:30:59,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 23:30:59,725 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-11-19 23:30:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:59,726 INFO L225 Difference]: With dead ends: 39 [2019-11-19 23:30:59,726 INFO L226 Difference]: Without dead ends: 33 [2019-11-19 23:30:59,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2019-11-19 23:30:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-19 23:30:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-19 23:30:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 23:30:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-11-19 23:30:59,733 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 40 [2019-11-19 23:30:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:59,734 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-11-19 23:30:59,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-19 23:30:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-11-19 23:30:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-19 23:30:59,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:59,736 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:59,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:30:59,937 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:59,937 INFO L82 PathProgramCache]: Analyzing trace with hash 608531405, now seen corresponding path program 4 times [2019-11-19 23:30:59,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:30:59,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1700837981] [2019-11-19 23:30:59,937 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:31:00,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:31:00,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:31:00,024 WARN L253 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-19 23:31:00,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:31:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-19 23:31:00,441 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:31:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:01,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:01,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:02,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:02,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:02,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:02,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:03,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:03,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:03,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:03,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-19 23:31:03,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1700837981] [2019-11-19 23:31:03,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:31:03,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2019-11-19 23:31:03,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62433977] [2019-11-19 23:31:03,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-19 23:31:03,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:31:03,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-19 23:31:03,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2019-11-19 23:31:03,502 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 46 states. [2019-11-19 23:31:05,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:31:05,016 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-11-19 23:31:05,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-19 23:31:05,017 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2019-11-19 23:31:05,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:31:05,018 INFO L225 Difference]: With dead ends: 45 [2019-11-19 23:31:05,019 INFO L226 Difference]: Without dead ends: 39 [2019-11-19 23:31:05,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2019-11-19 23:31:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-19 23:31:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-19 23:31:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-19 23:31:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-11-19 23:31:05,032 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 52 [2019-11-19 23:31:05,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:31:05,032 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-11-19 23:31:05,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-19 23:31:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-11-19 23:31:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 23:31:05,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:31:05,035 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:31:05,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:31:05,238 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:31:05,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:31:05,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1459073907, now seen corresponding path program 5 times [2019-11-19 23:31:05,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:31:05,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [855371712] [2019-11-19 23:31:05,239 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:31:05,355 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-11-19 23:31:05,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:31:05,358 WARN L253 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-19 23:31:05,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:31:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-19 23:31:05,791 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:31:06,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:06,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:07,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:07,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:08,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:08,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:08,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:08,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:09,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:09,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:09,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:10,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:10,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-19 23:31:10,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [855371712] [2019-11-19 23:31:10,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:31:10,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2019-11-19 23:31:10,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159533693] [2019-11-19 23:31:10,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-11-19 23:31:10,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:31:10,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-11-19 23:31:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2019-11-19 23:31:10,268 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 56 states. [2019-11-19 23:31:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:31:12,258 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-11-19 23:31:12,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-19 23:31:12,258 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 64 [2019-11-19 23:31:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:31:12,260 INFO L225 Difference]: With dead ends: 51 [2019-11-19 23:31:12,260 INFO L226 Difference]: Without dead ends: 45 [2019-11-19 23:31:12,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=554, Invalid=5608, Unknown=0, NotChecked=0, Total=6162 [2019-11-19 23:31:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-19 23:31:12,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-19 23:31:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-19 23:31:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-11-19 23:31:12,267 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 64 [2019-11-19 23:31:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:31:12,268 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-11-19 23:31:12,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-11-19 23:31:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-11-19 23:31:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 23:31:12,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:31:12,271 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:31:12,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:31:12,471 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:31:12,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:31:12,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1087630003, now seen corresponding path program 6 times [2019-11-19 23:31:12,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:31:12,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2018752257] [2019-11-19 23:31:12,472 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:31:12,589 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-11-19 23:31:12,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:31:12,590 WARN L253 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-19 23:31:12,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:31:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-19 23:31:13,170 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:31:14,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:14,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:15,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:15,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:16,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:16,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:16,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:17,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:17,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:17,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:18,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:18,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:18,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:18,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:19,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:19,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-19 23:31:19,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2018752257] [2019-11-19 23:31:19,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:31:19,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2019-11-19 23:31:19,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187921405] [2019-11-19 23:31:19,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-11-19 23:31:19,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:31:19,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-11-19 23:31:19,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2019-11-19 23:31:19,617 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 66 states. [2019-11-19 23:31:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:31:22,461 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-11-19 23:31:22,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-19 23:31:22,462 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 76 [2019-11-19 23:31:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:31:22,463 INFO L225 Difference]: With dead ends: 57 [2019-11-19 23:31:22,463 INFO L226 Difference]: Without dead ends: 51 [2019-11-19 23:31:22,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=710, Invalid=7846, Unknown=0, NotChecked=0, Total=8556 [2019-11-19 23:31:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-19 23:31:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-19 23:31:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-19 23:31:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-11-19 23:31:22,482 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 76 [2019-11-19 23:31:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:31:22,483 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-11-19 23:31:22,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-11-19 23:31:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-11-19 23:31:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-19 23:31:22,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:31:22,487 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:31:22,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:31:22,689 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:31:22,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:31:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1736651251, now seen corresponding path program 7 times [2019-11-19 23:31:22,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:31:22,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1832361143] [2019-11-19 23:31:22,690 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:31:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:31:22,850 WARN L253 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-19 23:31:22,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:31:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-19 23:31:23,599 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:31:24,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:24,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:25,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:26,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:26,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:27,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:27,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:27,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:28,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:28,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:29,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:29,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:30,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:30,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:30,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:30,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:31,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:31,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:31,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-19 23:31:31,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1832361143] [2019-11-19 23:31:31,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:31:31,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2019-11-19 23:31:31,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786902649] [2019-11-19 23:31:31,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-11-19 23:31:31,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:31:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-11-19 23:31:31,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2019-11-19 23:31:31,919 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2019-11-19 23:31:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:31:35,086 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-19 23:31:35,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-19 23:31:35,087 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 88 [2019-11-19 23:31:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:31:35,088 INFO L225 Difference]: With dead ends: 63 [2019-11-19 23:31:35,088 INFO L226 Difference]: Without dead ends: 57 [2019-11-19 23:31:35,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=882, Invalid=10460, Unknown=0, NotChecked=0, Total=11342 [2019-11-19 23:31:35,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-19 23:31:35,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-19 23:31:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-19 23:31:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-11-19 23:31:35,102 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 88 [2019-11-19 23:31:35,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:31:35,102 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-11-19 23:31:35,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-11-19 23:31:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-11-19 23:31:35,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 23:31:35,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:31:35,105 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:31:35,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:31:35,315 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:31:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:31:35,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2110158541, now seen corresponding path program 8 times [2019-11-19 23:31:35,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:31:35,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1531295395] [2019-11-19 23:31:35,316 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/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-11-19 23:31:35,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:31:35,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:31:35,477 WARN L253 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-19 23:31:35,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:31:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-19 23:31:36,697 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:31:38,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:38,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:39,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:39,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:39,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:39,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:40,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:40,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:41,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:41,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:41,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:42,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:42,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:43,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:43,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:43,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:44,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:44,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:44,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:45,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:45,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:45,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:46,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:46,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:46,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-19 23:31:46,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1531295395] [2019-11-19 23:31:46,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:31:46,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2019-11-19 23:31:46,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88123338] [2019-11-19 23:31:46,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-11-19 23:31:46,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:31:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-11-19 23:31:46,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2019-11-19 23:31:46,764 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 86 states. [2019-11-19 23:31:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:31:50,495 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-11-19 23:31:50,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-19 23:31:50,495 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 100 [2019-11-19 23:31:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:31:50,497 INFO L225 Difference]: With dead ends: 69 [2019-11-19 23:31:50,497 INFO L226 Difference]: Without dead ends: 63 [2019-11-19 23:31:50,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 108 SyntacticMatches, 6 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1070, Invalid=13450, Unknown=0, NotChecked=0, Total=14520 [2019-11-19 23:31:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-19 23:31:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-19 23:31:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-19 23:31:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-11-19 23:31:50,506 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 100 [2019-11-19 23:31:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:31:50,507 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-11-19 23:31:50,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-11-19 23:31:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-11-19 23:31:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-19 23:31:50,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:31:50,509 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:31:50,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:31:50,711 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:31:50,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:31:50,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1898639475, now seen corresponding path program 9 times [2019-11-19 23:31:50,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:31:50,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1115532772] [2019-11-19 23:31:50,712 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:31:50,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-11-19 23:31:50,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:31:50,933 WARN L253 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 77 conjunts are in the unsatisfiable core [2019-11-19 23:31:50,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:31:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-11-19 23:31:52,051 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:31:54,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:54,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:55,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:55,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:55,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:56,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:56,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:57,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:57,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:58,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:31:59,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:00,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:00,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:00,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:00,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:01,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:01,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:02,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:02,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:03,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:04,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:04,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:04,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:04,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:05,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-19 23:32:05,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1115532772] [2019-11-19 23:32:05,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:32:05,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 57] total 97 [2019-11-19 23:32:05,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454385157] [2019-11-19 23:32:05,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-11-19 23:32:05,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:32:05,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-11-19 23:32:05,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=8944, Unknown=0, NotChecked=0, Total=9312 [2019-11-19 23:32:05,598 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 97 states. [2019-11-19 23:32:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:32:10,293 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-11-19 23:32:10,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-19 23:32:10,293 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 112 [2019-11-19 23:32:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:32:10,295 INFO L225 Difference]: With dead ends: 75 [2019-11-19 23:32:10,295 INFO L226 Difference]: Without dead ends: 69 [2019-11-19 23:32:10,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 120 SyntacticMatches, 7 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2547 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1330, Invalid=17030, Unknown=0, NotChecked=0, Total=18360 [2019-11-19 23:32:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-19 23:32:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-19 23:32:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-19 23:32:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-11-19 23:32:10,305 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 112 [2019-11-19 23:32:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:32:10,306 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-11-19 23:32:10,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-11-19 23:32:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-11-19 23:32:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-19 23:32:10,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:32:10,307 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:32:10,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:32:10,508 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:32:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:32:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2106288051, now seen corresponding path program 10 times [2019-11-19 23:32:10,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:32:10,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [794344494] [2019-11-19 23:32:10,509 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:32:10,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:32:10,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:32:10,750 WARN L253 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 84 conjunts are in the unsatisfiable core [2019-11-19 23:32:10,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:32:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-19 23:32:12,052 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:32:14,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:14,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:15,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:15,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:16,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:16,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:16,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:18,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:18,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:19,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:20,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:20,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:20,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:21,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:21,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:22,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:23,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:23,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:23,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:24,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:25,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:25,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:26,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:26,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:27,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-19 23:32:27,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [794344494] [2019-11-19 23:32:27,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:32:27,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2019-11-19 23:32:27,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307274823] [2019-11-19 23:32:27,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-11-19 23:32:27,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:32:27,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-11-19 23:32:27,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2019-11-19 23:32:27,608 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 106 states. [2019-11-19 23:32:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:32:33,155 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-11-19 23:32:33,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-11-19 23:32:33,155 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 124 [2019-11-19 23:32:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:32:33,156 INFO L225 Difference]: With dead ends: 81 [2019-11-19 23:32:33,157 INFO L226 Difference]: Without dead ends: 75 [2019-11-19 23:32:33,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 135 SyntacticMatches, 7 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=1494, Invalid=20558, Unknown=0, NotChecked=0, Total=22052 [2019-11-19 23:32:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-19 23:32:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-19 23:32:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-19 23:32:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-11-19 23:32:33,164 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 124 [2019-11-19 23:32:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:32:33,165 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-11-19 23:32:33,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-11-19 23:32:33,165 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-11-19 23:32:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-19 23:32:33,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:32:33,167 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:32:33,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:32:33,367 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:32:33,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:32:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1718685965, now seen corresponding path program 11 times [2019-11-19 23:32:33,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:32:33,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [694743029] [2019-11-19 23:32:33,369 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/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-11-19 23:32:33,701 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-11-19 23:32:33,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:32:33,710 WARN L253 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-19 23:32:33,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:32:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-19 23:32:35,258 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:32:37,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:37,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:38,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:39,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:39,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:40,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:41,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:42,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:42,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:43,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:44,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:44,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:44,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:45,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:47,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:48,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:48,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:49,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:49,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:50,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:50,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:50,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:50,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:51,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:52,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:52,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:52,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:53,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:53,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:32:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-19 23:32:53,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [694743029] [2019-11-19 23:32:53,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:32:53,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2019-11-19 23:32:53,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032139565] [2019-11-19 23:32:53,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-11-19 23:32:53,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:32:53,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-11-19 23:32:53,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2019-11-19 23:32:53,525 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 116 states. [2019-11-19 23:32:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:32:59,459 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-11-19 23:32:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-11-19 23:32:59,459 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 136 [2019-11-19 23:32:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:32:59,460 INFO L225 Difference]: With dead ends: 87 [2019-11-19 23:32:59,461 INFO L226 Difference]: Without dead ends: 81 [2019-11-19 23:32:59,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 150 SyntacticMatches, 6 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=1730, Invalid=24676, Unknown=0, NotChecked=0, Total=26406 [2019-11-19 23:32:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-19 23:32:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-11-19 23:32:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-19 23:32:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-11-19 23:32:59,468 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 136 [2019-11-19 23:32:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:32:59,469 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-11-19 23:32:59,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-11-19 23:32:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-11-19 23:32:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-19 23:32:59,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:32:59,471 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:32:59,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:32:59,671 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:32:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:32:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1603697101, now seen corresponding path program 12 times [2019-11-19 23:32:59,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:32:59,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [642196306] [2019-11-19 23:32:59,672 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:00,052 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2019-11-19 23:33:00,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:33:00,055 WARN L253 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 100 conjunts are in the unsatisfiable core [2019-11-19 23:33:00,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:33:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-11-19 23:33:01,775 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:33:04,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:04,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:05,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:06,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:07,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:08,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:08,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:09,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:10,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:11,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:12,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:13,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:13,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:14,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:15,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:15,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:15,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:15,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:16,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:17,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:18,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:18,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:19,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:19,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:19,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:20,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:20,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:21,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:21,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:21,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:21,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:22,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:23,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-11-19 23:33:23,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [642196306] [2019-11-19 23:33:23,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:33:23,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 75] total 126 [2019-11-19 23:33:23,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652451275] [2019-11-19 23:33:23,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-11-19 23:33:23,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:33:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-11-19 23:33:23,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=15289, Unknown=0, NotChecked=0, Total=15750 [2019-11-19 23:33:23,407 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 126 states. [2019-11-19 23:33:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:33:30,419 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-11-19 23:33:30,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-19 23:33:30,419 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 148 [2019-11-19 23:33:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:33:30,420 INFO L225 Difference]: With dead ends: 93 [2019-11-19 23:33:30,420 INFO L226 Difference]: Without dead ends: 87 [2019-11-19 23:33:30,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 167 SyntacticMatches, 3 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1982, Invalid=29170, Unknown=0, NotChecked=0, Total=31152 [2019-11-19 23:33:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-19 23:33:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-19 23:33:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-19 23:33:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-11-19 23:33:30,427 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 148 [2019-11-19 23:33:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:33:30,428 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-11-19 23:33:30,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-11-19 23:33:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-11-19 23:33:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-19 23:33:30,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:33:30,430 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:33:30,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:30,638 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:33:30,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:33:30,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1773195917, now seen corresponding path program 13 times [2019-11-19 23:33:30,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:33:30,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [581742659] [2019-11-19 23:33:30,638 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:33:31,054 WARN L253 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 108 conjunts are in the unsatisfiable core [2019-11-19 23:33:31,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:33:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-11-19 23:33:33,063 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:33:35,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:35,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:36,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:38,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:39,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:40,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:41,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:42,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:42,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:43,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:43,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:44,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:44,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:45,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:47,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:47,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:48,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:49,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:49,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:50,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:50,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:51,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:52,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:52,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:53,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:54,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:54,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:55,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:55,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:55,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:56,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:57,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:57,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:57,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-11-19 23:33:58,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [581742659] [2019-11-19 23:33:58,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:33:58,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 81] total 136 [2019-11-19 23:33:58,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139116689] [2019-11-19 23:33:58,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-11-19 23:33:58,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:33:58,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-11-19 23:33:58,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=17861, Unknown=0, NotChecked=0, Total=18360 [2019-11-19 23:33:58,217 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 136 states. [2019-11-19 23:34:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:06,356 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-11-19 23:34:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-11-19 23:34:06,357 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 160 [2019-11-19 23:34:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:06,358 INFO L225 Difference]: With dead ends: 99 [2019-11-19 23:34:06,358 INFO L226 Difference]: Without dead ends: 93 [2019-11-19 23:34:06,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 178 SyntacticMatches, 6 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4781 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=2250, Invalid=34040, Unknown=0, NotChecked=0, Total=36290 [2019-11-19 23:34:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-19 23:34:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-11-19 23:34:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-19 23:34:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-11-19 23:34:06,366 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 160 [2019-11-19 23:34:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:06,367 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-11-19 23:34:06,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-11-19 23:34:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-11-19 23:34:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-19 23:34:06,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:06,369 INFO L410 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:34:06,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:34:06,574 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:34:06,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash 395057997, now seen corresponding path program 14 times [2019-11-19 23:34:06,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:34:06,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [394350060] [2019-11-19 23:34:06,575 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/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-11-19 23:34:07,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:34:07,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:34:07,084 WARN L253 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 116 conjunts are in the unsatisfiable core [2019-11-19 23:34:07,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:34:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-11-19 23:34:09,331 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:34:12,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:12,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:15,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:16,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:18,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:19,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:19,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:20,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:22,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:23,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:24,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:25,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:25,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:27,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:27,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:28,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:29,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:30,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:30,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:31,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:32,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:33,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:33,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:34,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:34,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:35,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:36,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:36,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:37,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:38,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:39,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:39,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:40,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:40,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:40,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-11-19 23:34:41,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [394350060] [2019-11-19 23:34:41,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:34:41,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 87] total 146 [2019-11-19 23:34:41,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803762800] [2019-11-19 23:34:41,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-11-19 23:34:41,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:34:41,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-11-19 23:34:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=20633, Unknown=0, NotChecked=0, Total=21170 [2019-11-19 23:34:41,132 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 146 states. [2019-11-19 23:34:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:50,264 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2019-11-19 23:34:50,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-19 23:34:50,265 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 172 [2019-11-19 23:34:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:50,266 INFO L225 Difference]: With dead ends: 105 [2019-11-19 23:34:50,266 INFO L226 Difference]: Without dead ends: 99 [2019-11-19 23:34:50,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 191 SyntacticMatches, 7 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=2534, Invalid=39286, Unknown=0, NotChecked=0, Total=41820 [2019-11-19 23:34:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-19 23:34:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-11-19 23:34:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-19 23:34:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-11-19 23:34:50,272 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 172 [2019-11-19 23:34:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:50,273 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-11-19 23:34:50,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-11-19 23:34:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-11-19 23:34:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-19 23:34:50,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:50,274 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:34:50,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:34:50,476 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:34:50,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:50,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1391744013, now seen corresponding path program 15 times [2019-11-19 23:34:50,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:34:50,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1094240248] [2019-11-19 23:34:50,477 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:34:51,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-11-19 23:34:51,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:34:51,128 WARN L253 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 124 conjunts are in the unsatisfiable core [2019-11-19 23:34:51,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:34:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-11-19 23:34:53,612 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:34:56,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:56,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:57,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:57,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:34:59,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:00,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:00,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:02,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:02,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:03,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:03,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:04,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:04,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:06,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:07,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:07,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:08,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:08,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:09,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:10,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:11,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:13,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:13,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:14,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:15,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:16,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:16,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:17,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:18,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:19,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:20,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:20,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:21,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:21,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:21,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:21,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:22,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:24,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:24,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:25,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:25,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:25,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:26,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:26,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:35:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-11-19 23:35:27,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1094240248] [2019-11-19 23:35:27,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:35:27,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 93] total 156 [2019-11-19 23:35:27,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139884133] [2019-11-19 23:35:27,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-11-19 23:35:27,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:35:27,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-11-19 23:35:27,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=23605, Unknown=0, NotChecked=0, Total=24180 [2019-11-19 23:35:27,111 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 156 states. [2019-11-19 23:35:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:35:38,646 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2019-11-19 23:35:38,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-11-19 23:35:38,646 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 184 [2019-11-19 23:35:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:35:38,647 INFO L225 Difference]: With dead ends: 111 [2019-11-19 23:35:38,648 INFO L226 Difference]: Without dead ends: 105 [2019-11-19 23:35:38,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 206 SyntacticMatches, 6 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6295 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=2834, Invalid=44908, Unknown=0, NotChecked=0, Total=47742 [2019-11-19 23:35:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-19 23:35:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-11-19 23:35:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-19 23:35:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-11-19 23:35:38,656 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 184 [2019-11-19 23:35:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:35:38,656 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-11-19 23:35:38,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-11-19 23:35:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-11-19 23:35:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-19 23:35:38,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:35:38,658 INFO L410 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:35:38,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:35:38,868 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:35:38,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:35:38,868 INFO L82 PathProgramCache]: Analyzing trace with hash 481656013, now seen corresponding path program 16 times [2019-11-19 23:35:38,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:35:38,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1715261485] [2019-11-19 23:35:38,869 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:35:39,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:35:39,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-19 23:35:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:35:39,976 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-19 23:35:39,977 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 23:35:40,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:35:40,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:35:40 BoogieIcfgContainer [2019-11-19 23:35:40,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:35:40,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:35:40,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:35:40,234 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:35:40,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:30:50" (3/4) ... [2019-11-19 23:35:40,236 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 23:35:40,312 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_499a9a4f-600a-42e6-bdf8-bf4869911326/bin/uautomizer/witness.graphml [2019-11-19 23:35:40,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:35:40,314 INFO L168 Benchmark]: Toolchain (without parser) took 290199.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 960.4 MB in the beginning and 978.9 MB in the end (delta: -18.4 MB). Peak memory consumption was 136.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:35:40,314 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:35:40,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.24 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:35:40,315 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.71 ms. Allocated memory is still 1.0 GB. Free memory is still 949.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:35:40,315 INFO L168 Benchmark]: Boogie Preprocessor took 93.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:35:40,315 INFO L168 Benchmark]: RCFGBuilder took 246.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-19 23:35:40,316 INFO L168 Benchmark]: TraceAbstraction took 289491.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 978.9 MB in the end (delta: 86.7 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:35:40,316 INFO L168 Benchmark]: Witness Printer took 78.84 ms. Allocated memory is still 1.2 GB. Free memory is still 978.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:35:40,318 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.24 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.71 ms. Allocated memory is still 1.0 GB. Free memory is still 949.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 246.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 289491.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 978.9 MB in the end (delta: 86.7 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. * Witness Printer took 78.84 ms. Allocated memory is still 1.2 GB. Free memory is still 978.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 34]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L25] int n = __VERIFIER_nondet_int(); [L26] COND FALSE !(n < 1) [L29] CALL, EXPR hanoi(n) VAL [\old(n)=32] [L17] COND FALSE !(n == 1) VAL [\old(n)=32, n=32] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=31] [L17] COND FALSE !(n == 1) VAL [\old(n)=31, n=31] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=30] [L17] COND FALSE !(n == 1) VAL [\old(n)=30, n=30] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=29] [L17] COND FALSE !(n == 1) VAL [\old(n)=29, n=29] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=28] [L17] COND FALSE !(n == 1) VAL [\old(n)=28, n=28] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=27] [L17] COND FALSE !(n == 1) VAL [\old(n)=27, n=27] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=26] [L17] COND FALSE !(n == 1) VAL [\old(n)=26, n=26] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=25] [L17] COND FALSE !(n == 1) VAL [\old(n)=25, n=25] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=24] [L17] COND FALSE !(n == 1) VAL [\old(n)=24, n=24] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=23] [L17] COND FALSE !(n == 1) VAL [\old(n)=23, n=23] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=22] [L17] COND FALSE !(n == 1) VAL [\old(n)=22, n=22] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=21] [L17] COND FALSE !(n == 1) VAL [\old(n)=21, n=21] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=20] [L17] COND FALSE !(n == 1) VAL [\old(n)=20, n=20] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=19] [L17] COND FALSE !(n == 1) VAL [\old(n)=19, n=19] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=18] [L17] COND FALSE !(n == 1) VAL [\old(n)=18, n=18] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=17] [L17] COND FALSE !(n == 1) VAL [\old(n)=17, n=17] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=16] [L17] COND FALSE !(n == 1) VAL [\old(n)=16, n=16] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=15] [L17] COND FALSE !(n == 1) VAL [\old(n)=15, n=15] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=14] [L17] COND FALSE !(n == 1) VAL [\old(n)=14, n=14] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=13] [L17] COND FALSE !(n == 1) VAL [\old(n)=13, n=13] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=12] [L17] COND FALSE !(n == 1) VAL [\old(n)=12, n=12] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=11] [L17] COND FALSE !(n == 1) VAL [\old(n)=11, n=11] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=10] [L17] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=9] [L17] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR hanoi(n-1) VAL [\old(n)=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=2, hanoi(n-1)=1, n=2] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=3, hanoi(n-1)=3, n=3] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=4, hanoi(n-1)=7, n=4] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=5, hanoi(n-1)=15, n=5] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=6, hanoi(n-1)=31, n=6] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=7, hanoi(n-1)=63, n=7] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=8, hanoi(n-1)=127, n=8] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=9, hanoi(n-1)=255, n=9] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=10, hanoi(n-1)=511, n=10] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=11, hanoi(n-1)=1023, n=11] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=12, hanoi(n-1)=2047, n=12] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=13, hanoi(n-1)=4095, n=13] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=14, hanoi(n-1)=8191, n=14] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=15, hanoi(n-1)=16383, n=15] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=16, hanoi(n-1)=32767, n=16] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=17, hanoi(n-1)=65535, n=17] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=18, hanoi(n-1)=131071, n=18] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=19, hanoi(n-1)=262143, n=19] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=20, hanoi(n-1)=524287, n=20] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=21, hanoi(n-1)=1048575, n=21] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=22, hanoi(n-1)=2097151, n=22] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=23, hanoi(n-1)=4194303, n=23] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=24, hanoi(n-1)=8388607, n=24] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=25, hanoi(n-1)=16777215, n=25] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=26, hanoi(n-1)=33554431, n=26] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=27, hanoi(n-1)=67108863, n=27] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=28, hanoi(n-1)=134217727, n=28] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=29, hanoi(n-1)=268435455, n=29] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=30, hanoi(n-1)=536870911, n=30] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=31, hanoi(n-1)=1073741823, n=31] [L20] return 2 * (hanoi(n-1)) + 1; [L20] RET, EXPR hanoi(n-1) VAL [\old(n)=32, hanoi(n-1)=2147483647, n=32] [L20] return 2 * (hanoi(n-1)) + 1; [L29] RET, EXPR hanoi(n) [L29] unsigned result = hanoi(n); [L31] COND FALSE !(result+1>0 && result+1 == 1<