./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/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 59acfc6d5178664a3f2144603274c2b6e876292a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-cad4683 [2019-11-15 20:05:35,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:05:35,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:05:35,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:05:35,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:05:35,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:05:35,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:05:35,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:05:35,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:05:35,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:05:35,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:05:35,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:05:35,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:05:35,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:05:35,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:05:35,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:05:35,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:05:35,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:05:35,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:05:35,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:05:35,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:05:35,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:05:35,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:05:35,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:05:35,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:05:35,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:05:35,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:05:35,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:05:35,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:05:35,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:05:35,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:05:35,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:05:35,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:05:35,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:05:35,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:05:35,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:05:35,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:05:35,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:05:35,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:05:35,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:05:35,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:05:35,496 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:05:35,534 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:05:35,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:05:35,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:05:35,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:05:35,536 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:05:35,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:05:35,536 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:05:35,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:05:35,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:05:35,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:05:35,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:05:35,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:05:35,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:05:35,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:05:35,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:05:35,538 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:05:35,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:05:35,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:05:35,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:05:35,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:05:35,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:05:35,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:05:35,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:05:35,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:05:35,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:05:35,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:05:35,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:05:35,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:05:35,541 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_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/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 -> 59acfc6d5178664a3f2144603274c2b6e876292a [2019-11-15 20:05:35,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:05:35,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:05:35,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:05:35,597 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:05:35,598 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:05:35,598 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2019-11-15 20:05:35,656 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/data/57a442e1d/b8f355d9282b4e19bf8abfe0d3f02a8b/FLAG686b7819a [2019-11-15 20:05:36,026 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:05:36,027 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2019-11-15 20:05:36,033 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/data/57a442e1d/b8f355d9282b4e19bf8abfe0d3f02a8b/FLAG686b7819a [2019-11-15 20:05:36,397 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/data/57a442e1d/b8f355d9282b4e19bf8abfe0d3f02a8b [2019-11-15 20:05:36,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:05:36,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:05:36,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:05:36,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:05:36,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:05:36,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:05:36" (1/1) ... [2019-11-15 20:05:36,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0515df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36, skipping insertion in model container [2019-11-15 20:05:36,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:05:36" (1/1) ... [2019-11-15 20:05:36,419 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:05:36,436 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:05:36,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:05:36,650 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:05:36,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:05:36,774 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:05:36,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36 WrapperNode [2019-11-15 20:05:36,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:05:36,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:05:36,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:05:36,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:05:36,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36" (1/1) ... [2019-11-15 20:05:36,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36" (1/1) ... [2019-11-15 20:05:36,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:05:36,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:05:36,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:05:36,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:05:36,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36" (1/1) ... [2019-11-15 20:05:36,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36" (1/1) ... [2019-11-15 20:05:36,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36" (1/1) ... [2019-11-15 20:05:36,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36" (1/1) ... [2019-11-15 20:05:36,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36" (1/1) ... [2019-11-15 20:05:36,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36" (1/1) ... [2019-11-15 20:05:36,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36" (1/1) ... [2019-11-15 20:05:36,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:05:36,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:05:36,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:05:36,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:05:36,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/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-15 20:05:36,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:05:36,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:05:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-11-15 20:05:36,900 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-11-15 20:05:37,071 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:05:37,072 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 20:05:37,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:05:37 BoogieIcfgContainer [2019-11-15 20:05:37,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:05:37,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:05:37,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:05:37,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:05:37,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:05:36" (1/3) ... [2019-11-15 20:05:37,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261bd78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:05:37, skipping insertion in model container [2019-11-15 20:05:37,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:05:36" (2/3) ... [2019-11-15 20:05:37,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261bd78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:05:37, skipping insertion in model container [2019-11-15 20:05:37,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:05:37" (3/3) ... [2019-11-15 20:05:37,080 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_25x0-2.c [2019-11-15 20:05:37,090 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:05:37,097 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:05:37,109 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:05:37,132 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:05:37,132 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:05:37,133 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:05:37,133 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:05:37,133 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:05:37,133 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:05:37,133 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:05:37,133 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:05:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-15 20:05:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 20:05:37,156 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:37,157 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:37,159 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:37,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:37,164 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-15 20:05:37,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:37,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925182342] [2019-11-15 20:05:37,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:37,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:37,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:37,413 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-15 20:05:37,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925182342] [2019-11-15 20:05:37,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:05:37,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:05:37,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731775629] [2019-11-15 20:05:37,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:05:37,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:37,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:05:37,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:05:37,437 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-15 20:05:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:37,575 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-15 20:05:37,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:05:37,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-15 20:05:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:37,587 INFO L225 Difference]: With dead ends: 24 [2019-11-15 20:05:37,587 INFO L226 Difference]: Without dead ends: 14 [2019-11-15 20:05:37,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:05:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-15 20:05:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 20:05:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 20:05:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-15 20:05:37,644 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-15 20:05:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:37,644 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-15 20:05:37,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:05:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-15 20:05:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 20:05:37,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:37,647 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:37,647 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-15 20:05:37,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:37,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427439718] [2019-11-15 20:05:37,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:37,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:37,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:37,862 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-15 20:05:37,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427439718] [2019-11-15 20:05:37,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594515547] [2019-11-15 20:05:37,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:37,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:05:37,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:37,967 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-15 20:05:37,968 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:37,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 20:05:37,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870586477] [2019-11-15 20:05:37,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:05:37,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:37,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:05:37,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:05:37,971 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2019-11-15 20:05:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:38,083 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-15 20:05:38,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:05:38,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-11-15 20:05:38,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:38,085 INFO L225 Difference]: With dead ends: 21 [2019-11-15 20:05:38,085 INFO L226 Difference]: Without dead ends: 17 [2019-11-15 20:05:38,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:05:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-15 20:05:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 20:05:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 20:05:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-15 20:05:38,091 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-15 20:05:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:38,092 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-15 20:05:38,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:05:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-15 20:05:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 20:05:38,093 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:38,093 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:38,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:38,299 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:38,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-15 20:05:38,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:38,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848280173] [2019-11-15 20:05:38,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:38,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:38,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 20:05:38,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848280173] [2019-11-15 20:05:38,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399563320] [2019-11-15 20:05:38,523 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:38,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:05:38,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:38,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:05:38,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 20:05:38,585 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:38,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-15 20:05:38,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978262960] [2019-11-15 20:05:38,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:05:38,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:38,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:05:38,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:05:38,587 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2019-11-15 20:05:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:38,709 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-15 20:05:38,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:05:38,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-15 20:05:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:38,711 INFO L225 Difference]: With dead ends: 24 [2019-11-15 20:05:38,711 INFO L226 Difference]: Without dead ends: 20 [2019-11-15 20:05:38,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:05:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-15 20:05:38,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 20:05:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 20:05:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-15 20:05:38,717 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-15 20:05:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:38,718 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-15 20:05:38,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:05:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-15 20:05:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 20:05:38,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:38,720 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:38,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:38,924 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:38,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:38,924 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-15 20:05:38,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:38,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960350069] [2019-11-15 20:05:38,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:38,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:38,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:39,152 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-15 20:05:39,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960350069] [2019-11-15 20:05:39,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052162729] [2019-11-15 20:05:39,153 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:39,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 20:05:39,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:39,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:05:39,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:39,236 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-15 20:05:39,236 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:39,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-11-15 20:05:39,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388232723] [2019-11-15 20:05:39,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 20:05:39,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:39,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 20:05:39,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:05:39,238 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-11-15 20:05:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:39,349 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-15 20:05:39,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:05:39,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-11-15 20:05:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:39,351 INFO L225 Difference]: With dead ends: 27 [2019-11-15 20:05:39,351 INFO L226 Difference]: Without dead ends: 23 [2019-11-15 20:05:39,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:05:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-15 20:05:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 20:05:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:05:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-15 20:05:39,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-15 20:05:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:39,359 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-15 20:05:39,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 20:05:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-15 20:05:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 20:05:39,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:39,361 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:39,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:39,573 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:39,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:39,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-15 20:05:39,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:39,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543723816] [2019-11-15 20:05:39,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:39,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:39,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 20:05:39,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543723816] [2019-11-15 20:05:39,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449533023] [2019-11-15 20:05:39,811 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:39,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:05:39,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:39,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:05:39,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 20:05:39,910 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:39,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-11-15 20:05:39,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788413698] [2019-11-15 20:05:39,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:05:39,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:39,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:05:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:05:39,915 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-11-15 20:05:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:40,060 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-15 20:05:40,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:05:40,061 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-15 20:05:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:40,062 INFO L225 Difference]: With dead ends: 30 [2019-11-15 20:05:40,062 INFO L226 Difference]: Without dead ends: 26 [2019-11-15 20:05:40,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:05:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-15 20:05:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-15 20:05:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 20:05:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-15 20:05:40,069 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-15 20:05:40,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:40,069 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-15 20:05:40,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:05:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-15 20:05:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 20:05:40,071 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:40,071 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:40,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:40,276 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:40,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:40,276 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-15 20:05:40,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:40,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19738214] [2019-11-15 20:05:40,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:40,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:40,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:40,542 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-15 20:05:40,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19738214] [2019-11-15 20:05:40,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478203506] [2019-11-15 20:05:40,543 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:40,600 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 20:05:40,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:40,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:05:40,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:40,655 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-15 20:05:40,655 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:40,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2019-11-15 20:05:40,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430344903] [2019-11-15 20:05:40,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 20:05:40,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:40,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 20:05:40,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:05:40,657 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2019-11-15 20:05:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:40,808 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-15 20:05:40,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:05:40,809 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-15 20:05:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:40,810 INFO L225 Difference]: With dead ends: 33 [2019-11-15 20:05:40,810 INFO L226 Difference]: Without dead ends: 29 [2019-11-15 20:05:40,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-15 20:05:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-15 20:05:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-15 20:05:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 20:05:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-15 20:05:40,816 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-15 20:05:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:40,817 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-15 20:05:40,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 20:05:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-15 20:05:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:05:40,818 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:40,819 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:41,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:41,021 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:41,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:41,022 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-15 20:05:41,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:41,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561301994] [2019-11-15 20:05:41,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:41,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:41,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-15 20:05:41,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561301994] [2019-11-15 20:05:41,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139802695] [2019-11-15 20:05:41,354 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:41,410 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-15 20:05:41,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:41,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 20:05:41,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-15 20:05:41,449 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:41,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-11-15 20:05:41,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359734288] [2019-11-15 20:05:41,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:05:41,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:41,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:05:41,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:05:41,452 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2019-11-15 20:05:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:41,607 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-15 20:05:41,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:05:41,608 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-11-15 20:05:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:41,609 INFO L225 Difference]: With dead ends: 36 [2019-11-15 20:05:41,609 INFO L226 Difference]: Without dead ends: 32 [2019-11-15 20:05:41,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:05:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-15 20:05:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-15 20:05:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 20:05:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-15 20:05:41,616 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-15 20:05:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:41,616 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-15 20:05:41,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:05:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-15 20:05:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 20:05:41,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:41,618 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:41,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:41,819 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:41,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:41,819 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-15 20:05:41,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:41,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126438761] [2019-11-15 20:05:41,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:41,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:41,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,175 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-15 20:05:42,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126438761] [2019-11-15 20:05:42,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731268427] [2019-11-15 20:05:42,176 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 20:05:42,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:42,323 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-15 20:05:42,328 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:42,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2019-11-15 20:05:42,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879660854] [2019-11-15 20:05:42,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 20:05:42,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 20:05:42,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:05:42,331 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 15 states. [2019-11-15 20:05:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:42,541 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-15 20:05:42,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:05:42,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-11-15 20:05:42,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:42,544 INFO L225 Difference]: With dead ends: 39 [2019-11-15 20:05:42,544 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 20:05:42,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-11-15 20:05:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 20:05:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-15 20:05:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 20:05:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-15 20:05:42,554 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-15 20:05:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:42,555 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-15 20:05:42,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 20:05:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-15 20:05:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 20:05:42,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:42,560 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:42,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:42,764 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:42,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:42,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-15 20:05:42,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:42,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731590996] [2019-11-15 20:05:42,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:42,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:42,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 20:05:43,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731590996] [2019-11-15 20:05:43,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419276732] [2019-11-15 20:05:43,083 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:43,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:05:43,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:43,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 20:05:43,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 20:05:43,194 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:43,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 16 [2019-11-15 20:05:43,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81457705] [2019-11-15 20:05:43,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 20:05:43,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:43,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 20:05:43,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:05:43,199 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 16 states. [2019-11-15 20:05:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:43,390 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-15 20:05:43,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:05:43,390 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2019-11-15 20:05:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:43,392 INFO L225 Difference]: With dead ends: 42 [2019-11-15 20:05:43,392 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 20:05:43,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2019-11-15 20:05:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 20:05:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-15 20:05:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 20:05:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-15 20:05:43,399 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-15 20:05:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:43,400 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-15 20:05:43,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 20:05:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-15 20:05:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 20:05:43,401 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:43,401 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:43,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:43,602 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-15 20:05:43,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:43,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177821697] [2019-11-15 20:05:43,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:43,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:43,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:43,964 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-15 20:05:43,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177821697] [2019-11-15 20:05:43,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488418721] [2019-11-15 20:05:43,964 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:44,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-15 20:05:44,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:44,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 20:05:44,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:44,099 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-15 20:05:44,099 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:44,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2019-11-15 20:05:44,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513161745] [2019-11-15 20:05:44,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 20:05:44,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:44,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 20:05:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:05:44,102 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 17 states. [2019-11-15 20:05:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:44,309 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-15 20:05:44,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:05:44,310 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2019-11-15 20:05:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:44,311 INFO L225 Difference]: With dead ends: 45 [2019-11-15 20:05:44,311 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 20:05:44,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2019-11-15 20:05:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 20:05:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-15 20:05:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 20:05:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-15 20:05:44,318 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-15 20:05:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:44,318 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-15 20:05:44,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 20:05:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-15 20:05:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 20:05:44,320 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:44,320 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:44,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:44,522 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:44,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:44,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-15 20:05:44,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:44,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835805385] [2019-11-15 20:05:44,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:44,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:44,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 20:05:44,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835805385] [2019-11-15 20:05:44,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152499690] [2019-11-15 20:05:44,939 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:45,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:05:45,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:45,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 20:05:45,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 20:05:45,071 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:45,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2019-11-15 20:05:45,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700386041] [2019-11-15 20:05:45,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 20:05:45,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:45,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 20:05:45,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:05:45,073 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 18 states. [2019-11-15 20:05:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:45,304 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-15 20:05:45,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 20:05:45,304 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2019-11-15 20:05:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:45,305 INFO L225 Difference]: With dead ends: 48 [2019-11-15 20:05:45,306 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 20:05:45,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2019-11-15 20:05:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 20:05:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-15 20:05:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 20:05:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-15 20:05:45,312 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-15 20:05:45,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:45,313 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-15 20:05:45,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 20:05:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-15 20:05:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 20:05:45,314 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:45,314 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:45,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:45,515 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:45,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:45,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-15 20:05:45,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:45,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859186312] [2019-11-15 20:05:45,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:45,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:45,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:45,966 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-15 20:05:45,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859186312] [2019-11-15 20:05:45,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571692825] [2019-11-15 20:05:45,966 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:46,055 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-15 20:05:46,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:46,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 20:05:46,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:46,127 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-15 20:05:46,127 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:46,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 19 [2019-11-15 20:05:46,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182450347] [2019-11-15 20:05:46,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 20:05:46,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:46,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 20:05:46,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-11-15 20:05:46,132 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 19 states. [2019-11-15 20:05:46,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:46,354 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-15 20:05:46,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:05:46,355 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-11-15 20:05:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:46,356 INFO L225 Difference]: With dead ends: 51 [2019-11-15 20:05:46,357 INFO L226 Difference]: Without dead ends: 47 [2019-11-15 20:05:46,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=636, Unknown=0, NotChecked=0, Total=930 [2019-11-15 20:05:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-15 20:05:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-15 20:05:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 20:05:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-15 20:05:46,369 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-15 20:05:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:46,369 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-15 20:05:46,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 20:05:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-15 20:05:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 20:05:46,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:46,371 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:46,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:46,571 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:46,572 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-15 20:05:46,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:46,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203836830] [2019-11-15 20:05:46,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:46,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:46,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-15 20:05:47,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203836830] [2019-11-15 20:05:47,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475925089] [2019-11-15 20:05:47,007 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:47,105 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-15 20:05:47,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:47,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 20:05:47,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-15 20:05:47,153 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:47,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2019-11-15 20:05:47,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269713155] [2019-11-15 20:05:47,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 20:05:47,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 20:05:47,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:05:47,155 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 20 states. [2019-11-15 20:05:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:47,390 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-15 20:05:47,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 20:05:47,390 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2019-11-15 20:05:47,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:47,392 INFO L225 Difference]: With dead ends: 54 [2019-11-15 20:05:47,392 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 20:05:47,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=337, Invalid=719, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 20:05:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 20:05:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-15 20:05:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 20:05:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-15 20:05:47,398 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-15 20:05:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:47,398 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-15 20:05:47,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 20:05:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-15 20:05:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 20:05:47,406 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:47,406 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:47,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:47,611 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:47,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:47,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-15 20:05:47,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:47,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432130758] [2019-11-15 20:05:47,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:47,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:47,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:48,185 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-15 20:05:48,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432130758] [2019-11-15 20:05:48,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86965988] [2019-11-15 20:05:48,186 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:48,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 20:05:48,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:48,315 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-15 20:05:48,316 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:48,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 21 [2019-11-15 20:05:48,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029245592] [2019-11-15 20:05:48,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 20:05:48,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 20:05:48,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:05:48,318 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 21 states. [2019-11-15 20:05:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:48,615 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-15 20:05:48,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 20:05:48,616 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-11-15 20:05:48,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:48,617 INFO L225 Difference]: With dead ends: 57 [2019-11-15 20:05:48,617 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 20:05:48,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=383, Invalid=807, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 20:05:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 20:05:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-15 20:05:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 20:05:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-15 20:05:48,626 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-15 20:05:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:48,627 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-15 20:05:48,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 20:05:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-15 20:05:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:05:48,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:48,632 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:48,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:48,836 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-15 20:05:48,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:48,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008271866] [2019-11-15 20:05:48,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:48,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:48,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-15 20:05:49,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008271866] [2019-11-15 20:05:49,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257555677] [2019-11-15 20:05:49,520 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:49,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:05:49,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:49,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 20:05:49,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-15 20:05:49,659 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:49,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 22 [2019-11-15 20:05:49,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542781505] [2019-11-15 20:05:49,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 20:05:49,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:49,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 20:05:49,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:05:49,661 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 22 states. [2019-11-15 20:05:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:49,966 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-15 20:05:49,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 20:05:49,966 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2019-11-15 20:05:49,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:49,967 INFO L225 Difference]: With dead ends: 60 [2019-11-15 20:05:49,968 INFO L226 Difference]: Without dead ends: 56 [2019-11-15 20:05:49,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=432, Invalid=900, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 20:05:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-15 20:05:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-15 20:05:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-15 20:05:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-15 20:05:49,974 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-15 20:05:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:49,974 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-15 20:05:49,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 20:05:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-15 20:05:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:05:49,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:49,981 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:50,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:50,185 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:50,185 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-15 20:05:50,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:50,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824805750] [2019-11-15 20:05:50,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:50,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:50,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,892 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-15 20:05:50,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824805750] [2019-11-15 20:05:50,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869768069] [2019-11-15 20:05:50,895 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:51,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-15 20:05:51,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:51,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-15 20:05:51,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:51,066 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-15 20:05:51,066 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:51,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2019-11-15 20:05:51,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265844410] [2019-11-15 20:05:51,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 20:05:51,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:51,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 20:05:51,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-11-15 20:05:51,069 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 23 states. [2019-11-15 20:05:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:51,367 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-15 20:05:51,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:05:51,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2019-11-15 20:05:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:51,369 INFO L225 Difference]: With dead ends: 63 [2019-11-15 20:05:51,369 INFO L226 Difference]: Without dead ends: 59 [2019-11-15 20:05:51,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=484, Invalid=998, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 20:05:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-15 20:05:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-15 20:05:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-15 20:05:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-15 20:05:51,381 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-11-15 20:05:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:51,381 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-15 20:05:51,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 20:05:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-15 20:05:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 20:05:51,383 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:51,383 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:51,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:51,587 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:51,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:51,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-11-15 20:05:51,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:51,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236685177] [2019-11-15 20:05:51,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:51,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:51,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-15 20:05:52,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236685177] [2019-11-15 20:05:52,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512081943] [2019-11-15 20:05:52,281 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:52,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:05:52,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:52,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 20:05:52,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-15 20:05:52,452 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:52,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 24 [2019-11-15 20:05:52,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052377362] [2019-11-15 20:05:52,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 20:05:52,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:52,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 20:05:52,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-11-15 20:05:52,455 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 24 states. [2019-11-15 20:05:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:52,808 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-15 20:05:52,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 20:05:52,809 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 105 [2019-11-15 20:05:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:52,810 INFO L225 Difference]: With dead ends: 66 [2019-11-15 20:05:52,810 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 20:05:52,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=539, Invalid=1101, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 20:05:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 20:05:52,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-15 20:05:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-15 20:05:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-15 20:05:52,829 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-11-15 20:05:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:52,830 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-15 20:05:52,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 20:05:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-15 20:05:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-15 20:05:52,832 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:52,832 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:53,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:53,040 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:53,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-11-15 20:05:53,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:53,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745384004] [2019-11-15 20:05:53,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:53,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:53,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-15 20:05:53,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745384004] [2019-11-15 20:05:53,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638122478] [2019-11-15 20:05:53,788 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:53,911 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-15 20:05:53,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:53,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 20:05:53,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-15 20:05:53,961 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:53,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 25 [2019-11-15 20:05:53,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267175940] [2019-11-15 20:05:53,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 20:05:53,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 20:05:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-11-15 20:05:53,963 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 25 states. [2019-11-15 20:05:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:54,384 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-11-15 20:05:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 20:05:54,385 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 111 [2019-11-15 20:05:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:54,386 INFO L225 Difference]: With dead ends: 69 [2019-11-15 20:05:54,386 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 20:05:54,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=597, Invalid=1209, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 20:05:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 20:05:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-15 20:05:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-15 20:05:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-15 20:05:54,393 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-11-15 20:05:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:54,394 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-15 20:05:54,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 20:05:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-15 20:05:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 20:05:54,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:54,396 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:54,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:54,600 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:54,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:54,600 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-11-15 20:05:54,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:54,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518556872] [2019-11-15 20:05:54,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:54,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:54,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-15 20:05:55,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518556872] [2019-11-15 20:05:55,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538758833] [2019-11-15 20:05:55,460 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:55,566 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-11-15 20:05:55,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:55,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 20:05:55,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-15 20:05:55,628 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:55,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2019-11-15 20:05:55,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656606049] [2019-11-15 20:05:55,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 20:05:55,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:55,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 20:05:55,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:05:55,630 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 26 states. [2019-11-15 20:05:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:55,940 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-11-15 20:05:55,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 20:05:55,941 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2019-11-15 20:05:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:55,942 INFO L225 Difference]: With dead ends: 72 [2019-11-15 20:05:55,942 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 20:05:55,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=658, Invalid=1322, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 20:05:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 20:05:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 20:05:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 20:05:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-15 20:05:55,948 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-11-15 20:05:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:55,948 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-15 20:05:55,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 20:05:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-15 20:05:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 20:05:55,950 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:55,950 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:56,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:56,151 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-11-15 20:05:56,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:56,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112377035] [2019-11-15 20:05:56,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:56,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:56,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:57,072 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-15 20:05:57,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112377035] [2019-11-15 20:05:57,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648581014] [2019-11-15 20:05:57,073 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:57,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-15 20:05:57,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:57,206 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-15 20:05:57,206 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:57,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 27 [2019-11-15 20:05:57,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766635515] [2019-11-15 20:05:57,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 20:05:57,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:57,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 20:05:57,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2019-11-15 20:05:57,209 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 27 states. [2019-11-15 20:05:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:57,556 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-11-15 20:05:57,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 20:05:57,557 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2019-11-15 20:05:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:57,558 INFO L225 Difference]: With dead ends: 75 [2019-11-15 20:05:57,558 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 20:05:57,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=722, Invalid=1440, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 20:05:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 20:05:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-15 20:05:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 20:05:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-15 20:05:57,564 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-11-15 20:05:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:57,564 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-15 20:05:57,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 20:05:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-15 20:05:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-15 20:05:57,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:57,566 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:57,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:57,770 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:57,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-11-15 20:05:57,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:57,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375730811] [2019-11-15 20:05:57,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:57,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:57,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-11-15 20:05:58,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375730811] [2019-11-15 20:05:58,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069319612] [2019-11-15 20:05:58,791 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:58,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:05:58,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:58,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 20:05:58,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-11-15 20:05:58,937 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:58,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 28 [2019-11-15 20:05:58,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183953986] [2019-11-15 20:05:58,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 20:05:58,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:58,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 20:05:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=492, Unknown=0, NotChecked=0, Total=756 [2019-11-15 20:05:58,939 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 28 states. [2019-11-15 20:05:59,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:59,313 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-11-15 20:05:59,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 20:05:59,314 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 129 [2019-11-15 20:05:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:59,315 INFO L225 Difference]: With dead ends: 78 [2019-11-15 20:05:59,315 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 20:05:59,317 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=789, Invalid=1563, Unknown=0, NotChecked=0, Total=2352 [2019-11-15 20:05:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 20:05:59,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-15 20:05:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 20:05:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-11-15 20:05:59,321 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2019-11-15 20:05:59,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:59,322 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-11-15 20:05:59,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 20:05:59,322 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-11-15 20:05:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-15 20:05:59,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:59,330 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:59,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:59,530 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:59,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:59,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1463802477, now seen corresponding path program 21 times [2019-11-15 20:05:59,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:59,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289124303] [2019-11-15 20:05:59,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:59,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:59,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:00,661 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-15 20:06:00,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289124303] [2019-11-15 20:06:00,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923253781] [2019-11-15 20:06:00,661 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:06:00,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-11-15 20:06:00,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:06:00,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 20:06:00,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:06:00,886 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-15 20:06:00,887 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:06:00,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 29 [2019-11-15 20:06:00,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287042488] [2019-11-15 20:06:00,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 20:06:00,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:06:00,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 20:06:00,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2019-11-15 20:06:00,889 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 29 states. [2019-11-15 20:06:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:06:01,182 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-11-15 20:06:01,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 20:06:01,183 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 135 [2019-11-15 20:06:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:06:01,184 INFO L225 Difference]: With dead ends: 81 [2019-11-15 20:06:01,184 INFO L226 Difference]: Without dead ends: 77 [2019-11-15 20:06:01,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=859, Invalid=1691, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 20:06:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-15 20:06:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-15 20:06:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 20:06:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-11-15 20:06:01,190 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 135 [2019-11-15 20:06:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:06:01,191 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-11-15 20:06:01,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 20:06:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-11-15 20:06:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 20:06:01,193 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:06:01,193 INFO L380 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:06:01,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:06:01,394 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:06:01,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:06:01,394 INFO L82 PathProgramCache]: Analyzing trace with hash -555819607, now seen corresponding path program 22 times [2019-11-15 20:06:01,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:06:01,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378857198] [2019-11-15 20:06:01,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:01,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:01,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:06:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-15 20:06:02,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378857198] [2019-11-15 20:06:02,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587748279] [2019-11-15 20:06:02,646 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:06:02,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:06:02,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:06:02,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-15 20:06:02,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:06:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-15 20:06:02,884 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:06:02,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 30 [2019-11-15 20:06:02,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758328106] [2019-11-15 20:06:02,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 20:06:02,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:06:02,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 20:06:02,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2019-11-15 20:06:02,890 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 30 states. [2019-11-15 20:06:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:06:03,326 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-11-15 20:06:03,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 20:06:03,327 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 141 [2019-11-15 20:06:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:06:03,328 INFO L225 Difference]: With dead ends: 84 [2019-11-15 20:06:03,328 INFO L226 Difference]: Without dead ends: 80 [2019-11-15 20:06:03,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=932, Invalid=1824, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 20:06:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-15 20:06:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-15 20:06:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 20:06:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-11-15 20:06:03,334 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 141 [2019-11-15 20:06:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:06:03,334 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-11-15 20:06:03,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 20:06:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-11-15 20:06:03,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-15 20:06:03,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:06:03,340 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:06:03,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:06:03,541 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:06:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:06:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash -945685357, now seen corresponding path program 23 times [2019-11-15 20:06:03,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:06:03,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373715925] [2019-11-15 20:06:03,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:03,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:03,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:06:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:04,847 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-15 20:06:04,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373715925] [2019-11-15 20:06:04,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070267564] [2019-11-15 20:06:04,849 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:06:04,997 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-11-15 20:06:04,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:06:05,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-15 20:06:05,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:06:05,085 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-15 20:06:05,086 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:06:05,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 31 [2019-11-15 20:06:05,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777641789] [2019-11-15 20:06:05,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 20:06:05,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:06:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 20:06:05,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=594, Unknown=0, NotChecked=0, Total=930 [2019-11-15 20:06:05,088 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 31 states. [2019-11-15 20:06:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:06:05,557 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-11-15 20:06:05,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 20:06:05,558 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2019-11-15 20:06:05,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:06:05,559 INFO L225 Difference]: With dead ends: 87 [2019-11-15 20:06:05,559 INFO L226 Difference]: Without dead ends: 83 [2019-11-15 20:06:05,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1008, Invalid=1962, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 20:06:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-15 20:06:05,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-15 20:06:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-15 20:06:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-11-15 20:06:05,564 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 147 [2019-11-15 20:06:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:06:05,565 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-11-15 20:06:05,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 20:06:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-11-15 20:06:05,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-15 20:06:05,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:06:05,566 INFO L380 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:06:05,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:06:05,773 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:06:05,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:06:05,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1588806697, now seen corresponding path program 24 times [2019-11-15 20:06:05,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:06:05,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660904764] [2019-11-15 20:06:05,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:05,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:05,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:06:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-15 20:06:07,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660904764] [2019-11-15 20:06:07,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883143357] [2019-11-15 20:06:07,108 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:06:07,278 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-11-15 20:06:07,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:06:07,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-15 20:06:07,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:06:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-15 20:06:07,372 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:06:07,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 32 [2019-11-15 20:06:07,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968274845] [2019-11-15 20:06:07,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 20:06:07,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:06:07,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 20:06:07,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2019-11-15 20:06:07,375 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 32 states. [2019-11-15 20:06:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:06:07,810 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-11-15 20:06:07,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 20:06:07,810 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 153 [2019-11-15 20:06:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:06:07,811 INFO L225 Difference]: With dead ends: 90 [2019-11-15 20:06:07,811 INFO L226 Difference]: Without dead ends: 86 [2019-11-15 20:06:07,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1087, Invalid=2105, Unknown=0, NotChecked=0, Total=3192 [2019-11-15 20:06:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-15 20:06:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-15 20:06:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-15 20:06:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-11-15 20:06:07,817 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 153 [2019-11-15 20:06:07,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:06:07,818 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-11-15 20:06:07,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 20:06:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-11-15 20:06:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-15 20:06:07,819 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:06:07,820 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:06:08,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:06:08,024 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:06:08,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:06:08,024 INFO L82 PathProgramCache]: Analyzing trace with hash 959677331, now seen corresponding path program 25 times [2019-11-15 20:06:08,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:06:08,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226229257] [2019-11-15 20:06:08,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:08,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:08,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:06:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:06:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:06:08,119 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:06:08,119 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:06:08,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:06:08 BoogieIcfgContainer [2019-11-15 20:06:08,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:06:08,199 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:06:08,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:06:08,200 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:06:08,200 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:05:37" (3/4) ... [2019-11-15 20:06:08,202 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:06:08,286 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_afb0e7d5-3246-44c6-8bfc-0ac7aa6696ae/bin/uautomizer/witness.graphml [2019-11-15 20:06:08,286 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:06:08,288 INFO L168 Benchmark]: Toolchain (without parser) took 31886.19 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 607.6 MB). Free memory was 950.1 MB in the beginning and 947.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 610.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:06:08,289 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:06:08,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:06:08,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.16 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-15 20:06:08,290 INFO L168 Benchmark]: Boogie Preprocessor took 19.67 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-15 20:06:08,290 INFO L168 Benchmark]: RCFGBuilder took 240.51 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:06:08,291 INFO L168 Benchmark]: TraceAbstraction took 31124.70 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 464.0 MB). Free memory was 1.1 GB in the beginning and 967.1 MB in the end (delta: 153.2 MB). Peak memory consumption was 617.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:06:08,291 INFO L168 Benchmark]: Witness Printer took 87.07 ms. Allocated memory is still 1.6 GB. Free memory was 967.1 MB in the beginning and 947.3 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:06:08,293 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 372.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.16 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 19.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 240.51 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31124.70 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 464.0 MB). Free memory was 1.1 GB in the beginning and 967.1 MB in the end (delta: 153.2 MB). Peak memory consumption was 617.1 MB. Max. memory is 11.5 GB. * Witness Printer took 87.07 ms. Allocated memory is still 1.6 GB. Free memory was 967.1 MB in the beginning and 947.3 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 25; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Result: UNSAFE, OverallTime: 31.0s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 202 SDtfs, 1131 SDslu, 1350 SDs, 0 SdLazy, 1561 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3392 GetRequests, 2618 SyntacticMatches, 0 SemanticMatches, 774 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5200 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 4200 NumberOfCodeBlocks, 4200 NumberOfCodeBlocksAsserted, 222 NumberOfCheckSat, 3992 ConstructedInterpolants, 0 QuantifiedInterpolants, 1105472 SizeOfPredicates, 348 NumberOfNonLiveVariables, 6096 ConjunctsInSsa, 696 ConjunctsInUnsatCore, 49 InterpolantComputations, 1 PerfectInterpolantSequences, 15000/30000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...