./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label15.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_78f8fdcd-3229-450d-b24c-7d5cedbe602a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label15.c -s /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/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 a36e59b73de737948c8406f65f182e859a67435b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:54:46,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:54:46,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:54:46,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:54:46,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:54:46,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:54:46,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:54:46,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:54:46,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:54:46,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:54:46,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:54:46,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:54:46,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:54:46,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:54:46,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:54:46,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:54:46,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:54:46,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:54:46,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:54:46,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:54:46,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:54:46,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:54:46,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:54:46,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:54:46,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:54:46,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:54:46,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:54:46,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:54:46,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:54:46,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:54:46,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:54:46,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:54:46,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:54:46,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:54:46,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:54:46,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:54:46,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:54:46,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:54:46,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:54:46,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:54:46,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:54:46,761 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:54:46,781 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:54:46,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:54:46,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:54:46,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:54:46,783 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:54:46,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:54:46,784 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:54:46,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:54:46,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:54:46,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:54:46,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:54:46,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:54:46,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:54:46,786 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:54:46,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:54:46,787 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:54:46,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:54:46,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:54:46,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:54:46,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:54:46,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:54:46,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:54:46,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:54:46,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:54:46,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:54:46,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:54:46,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:54:46,790 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:54:46,791 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_78f8fdcd-3229-450d-b24c-7d5cedbe602a/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 -> a36e59b73de737948c8406f65f182e859a67435b [2019-11-15 23:54:46,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:54:46,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:54:46,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:54:46,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:54:46,860 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:54:46,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label15.c [2019-11-15 23:54:46,924 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/bin/uautomizer/data/ac80e54f5/48f3687add7e4e3d9884ab93c11ca877/FLAG87b9fdae6 [2019-11-15 23:54:47,496 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:54:47,496 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/sv-benchmarks/c/eca-rers2012/Problem02_label15.c [2019-11-15 23:54:47,517 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/bin/uautomizer/data/ac80e54f5/48f3687add7e4e3d9884ab93c11ca877/FLAG87b9fdae6 [2019-11-15 23:54:47,936 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/bin/uautomizer/data/ac80e54f5/48f3687add7e4e3d9884ab93c11ca877 [2019-11-15 23:54:47,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:54:47,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:54:47,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:54:47,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:54:47,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:54:47,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:54:47" (1/1) ... [2019-11-15 23:54:47,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5365288b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:47, skipping insertion in model container [2019-11-15 23:54:47,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:54:47" (1/1) ... [2019-11-15 23:54:47,971 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:54:48,025 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:54:48,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:54:48,487 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:54:48,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:54:48,636 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:54:48,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48 WrapperNode [2019-11-15 23:54:48,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:54:48,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:54:48,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:54:48,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:54:48,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48" (1/1) ... [2019-11-15 23:54:48,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48" (1/1) ... [2019-11-15 23:54:48,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:54:48,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:54:48,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:54:48,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:54:48,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48" (1/1) ... [2019-11-15 23:54:48,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48" (1/1) ... [2019-11-15 23:54:48,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48" (1/1) ... [2019-11-15 23:54:48,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48" (1/1) ... [2019-11-15 23:54:48,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48" (1/1) ... [2019-11-15 23:54:48,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48" (1/1) ... [2019-11-15 23:54:48,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48" (1/1) ... [2019-11-15 23:54:48,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:54:48,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:54:48,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:54:48,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:54:48,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/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 23:54:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:54:48,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:54:50,243 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:54:50,243 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:54:50,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:50 BoogieIcfgContainer [2019-11-15 23:54:50,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:54:50,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:54:50,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:54:50,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:54:50,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:54:47" (1/3) ... [2019-11-15 23:54:50,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d0f7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:54:50, skipping insertion in model container [2019-11-15 23:54:50,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:48" (2/3) ... [2019-11-15 23:54:50,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d0f7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:54:50, skipping insertion in model container [2019-11-15 23:54:50,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:50" (3/3) ... [2019-11-15 23:54:50,251 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label15.c [2019-11-15 23:54:50,261 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:54:50,270 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:54:50,280 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:54:50,328 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:54:50,328 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:54:50,329 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:54:50,329 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:54:50,329 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:54:50,329 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:54:50,329 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:54:50,329 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:54:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-15 23:54:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 23:54:50,375 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:50,376 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:50,378 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:50,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:50,384 INFO L82 PathProgramCache]: Analyzing trace with hash -648019827, now seen corresponding path program 1 times [2019-11-15 23:54:50,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:50,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938032701] [2019-11-15 23:54:50,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:50,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:50,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:50,795 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 23:54:50,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938032701] [2019-11-15 23:54:50,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:50,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:50,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263106472] [2019-11-15 23:54:50,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:50,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:50,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:50,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:50,824 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-15 23:54:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:52,260 INFO L93 Difference]: Finished difference Result 789 states and 1377 transitions. [2019-11-15 23:54:52,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:54:52,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-15 23:54:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:52,281 INFO L225 Difference]: With dead ends: 789 [2019-11-15 23:54:52,281 INFO L226 Difference]: Without dead ends: 465 [2019-11-15 23:54:52,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-11-15 23:54:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 309. [2019-11-15 23:54:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-15 23:54:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2019-11-15 23:54:52,379 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 130 [2019-11-15 23:54:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:52,382 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2019-11-15 23:54:52,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2019-11-15 23:54:52,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-15 23:54:52,395 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:52,396 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:52,397 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash 208795960, now seen corresponding path program 1 times [2019-11-15 23:54:52,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:52,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615391378] [2019-11-15 23:54:52,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:52,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:52,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:52,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615391378] [2019-11-15 23:54:52,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:52,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:52,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34236341] [2019-11-15 23:54:52,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:52,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:52,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:52,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:52,697 INFO L87 Difference]: Start difference. First operand 309 states and 453 transitions. Second operand 4 states. [2019-11-15 23:54:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:53,652 INFO L93 Difference]: Finished difference Result 980 states and 1479 transitions. [2019-11-15 23:54:53,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:54:53,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-15 23:54:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:53,657 INFO L225 Difference]: With dead ends: 980 [2019-11-15 23:54:53,658 INFO L226 Difference]: Without dead ends: 590 [2019-11-15 23:54:53,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-11-15 23:54:53,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-11-15 23:54:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-11-15 23:54:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 788 transitions. [2019-11-15 23:54:53,683 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 788 transitions. Word has length 134 [2019-11-15 23:54:53,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:53,684 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 788 transitions. [2019-11-15 23:54:53,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 788 transitions. [2019-11-15 23:54:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-15 23:54:53,686 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:53,687 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:53,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:53,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:53,687 INFO L82 PathProgramCache]: Analyzing trace with hash -402206747, now seen corresponding path program 1 times [2019-11-15 23:54:53,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:53,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690536171] [2019-11-15 23:54:53,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:53,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:53,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:54:53,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690536171] [2019-11-15 23:54:53,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:53,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:53,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905507061] [2019-11-15 23:54:53,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:53,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:53,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:53,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:53,763 INFO L87 Difference]: Start difference. First operand 590 states and 788 transitions. Second operand 4 states. [2019-11-15 23:54:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:54,725 INFO L93 Difference]: Finished difference Result 2306 states and 3087 transitions. [2019-11-15 23:54:54,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:54:54,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-15 23:54:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:54,736 INFO L225 Difference]: With dead ends: 2306 [2019-11-15 23:54:54,736 INFO L226 Difference]: Without dead ends: 1718 [2019-11-15 23:54:54,738 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:54,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2019-11-15 23:54:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1572. [2019-11-15 23:54:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-11-15 23:54:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 1965 transitions. [2019-11-15 23:54:54,777 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 1965 transitions. Word has length 160 [2019-11-15 23:54:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:54,778 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 1965 transitions. [2019-11-15 23:54:54,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1965 transitions. [2019-11-15 23:54:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-15 23:54:54,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:54,782 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:54,782 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:54,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:54,783 INFO L82 PathProgramCache]: Analyzing trace with hash 864996295, now seen corresponding path program 1 times [2019-11-15 23:54:54,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:54,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155907769] [2019-11-15 23:54:54,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:54,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:54,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:54:54,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155907769] [2019-11-15 23:54:54,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:54,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:54:54,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010178074] [2019-11-15 23:54:54,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:54,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:54,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:54,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:54,917 INFO L87 Difference]: Start difference. First operand 1572 states and 1965 transitions. Second operand 4 states. [2019-11-15 23:54:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:56,005 INFO L93 Difference]: Finished difference Result 4277 states and 5403 transitions. [2019-11-15 23:54:56,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:54:56,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-11-15 23:54:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:56,021 INFO L225 Difference]: With dead ends: 4277 [2019-11-15 23:54:56,021 INFO L226 Difference]: Without dead ends: 2707 [2019-11-15 23:54:56,024 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2019-11-15 23:54:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 1855. [2019-11-15 23:54:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1855 states. [2019-11-15 23:54:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 2281 transitions. [2019-11-15 23:54:56,077 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 2281 transitions. Word has length 168 [2019-11-15 23:54:56,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:56,077 INFO L462 AbstractCegarLoop]: Abstraction has 1855 states and 2281 transitions. [2019-11-15 23:54:56,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2281 transitions. [2019-11-15 23:54:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-15 23:54:56,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:56,083 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:56,084 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1353288396, now seen corresponding path program 1 times [2019-11-15 23:54:56,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:56,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295898858] [2019-11-15 23:54:56,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:56,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:56,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:54:56,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295898858] [2019-11-15 23:54:56,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092376005] [2019-11-15 23:54:56,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/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 23:54:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:56,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:54:56,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-15 23:54:56,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:54:56,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-15 23:54:56,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495708303] [2019-11-15 23:54:56,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:56,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:56,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:56,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:54:56,512 INFO L87 Difference]: Start difference. First operand 1855 states and 2281 transitions. Second operand 3 states. [2019-11-15 23:54:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:57,148 INFO L93 Difference]: Finished difference Result 4267 states and 5231 transitions. [2019-11-15 23:54:57,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:57,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-15 23:54:57,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:57,162 INFO L225 Difference]: With dead ends: 4267 [2019-11-15 23:54:57,162 INFO L226 Difference]: Without dead ends: 2414 [2019-11-15 23:54:57,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:54:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-15 23:54:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1994. [2019-11-15 23:54:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-15 23:54:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2442 transitions. [2019-11-15 23:54:57,219 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2442 transitions. Word has length 171 [2019-11-15 23:54:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:57,221 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 2442 transitions. [2019-11-15 23:54:57,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2442 transitions. [2019-11-15 23:54:57,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 23:54:57,226 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:57,226 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:57,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:54:57,438 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:57,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:57,438 INFO L82 PathProgramCache]: Analyzing trace with hash 141468647, now seen corresponding path program 1 times [2019-11-15 23:54:57,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:57,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760058904] [2019-11-15 23:54:57,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:57,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:57,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:54:57,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760058904] [2019-11-15 23:54:57,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:57,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:57,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594299374] [2019-11-15 23:54:57,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:57,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:57,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:57,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:57,530 INFO L87 Difference]: Start difference. First operand 1994 states and 2442 transitions. Second operand 3 states. [2019-11-15 23:54:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:58,137 INFO L93 Difference]: Finished difference Result 4272 states and 5182 transitions. [2019-11-15 23:54:58,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:58,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-15 23:54:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:58,149 INFO L225 Difference]: With dead ends: 4272 [2019-11-15 23:54:58,149 INFO L226 Difference]: Without dead ends: 2140 [2019-11-15 23:54:58,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-15 23:54:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1994. [2019-11-15 23:54:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-15 23:54:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2341 transitions. [2019-11-15 23:54:58,204 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2341 transitions. Word has length 181 [2019-11-15 23:54:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:58,204 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 2341 transitions. [2019-11-15 23:54:58,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2341 transitions. [2019-11-15 23:54:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 23:54:58,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:58,217 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:58,217 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:58,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:58,217 INFO L82 PathProgramCache]: Analyzing trace with hash -99265028, now seen corresponding path program 1 times [2019-11-15 23:54:58,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:58,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134631819] [2019-11-15 23:54:58,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:58,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:58,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:54:58,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134631819] [2019-11-15 23:54:58,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:58,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:58,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103144933] [2019-11-15 23:54:58,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:58,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:58,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:58,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:58,308 INFO L87 Difference]: Start difference. First operand 1994 states and 2341 transitions. Second operand 3 states. [2019-11-15 23:54:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:58,920 INFO L93 Difference]: Finished difference Result 4822 states and 5634 transitions. [2019-11-15 23:54:58,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:58,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-15 23:54:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:58,933 INFO L225 Difference]: With dead ends: 4822 [2019-11-15 23:54:58,933 INFO L226 Difference]: Without dead ends: 2129 [2019-11-15 23:54:58,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:58,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-11-15 23:54:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1989. [2019-11-15 23:54:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-15 23:54:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2227 transitions. [2019-11-15 23:54:58,993 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2227 transitions. Word has length 183 [2019-11-15 23:54:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:58,993 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2227 transitions. [2019-11-15 23:54:58,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2227 transitions. [2019-11-15 23:54:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 23:54:59,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:59,001 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:59,001 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:59,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:59,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1648518522, now seen corresponding path program 1 times [2019-11-15 23:54:59,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:59,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594437683] [2019-11-15 23:54:59,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:59,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:59,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-15 23:54:59,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594437683] [2019-11-15 23:54:59,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024472652] [2019-11-15 23:54:59,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/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 23:54:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:59,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:54:59,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:54:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 23:54:59,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:54:59,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-15 23:54:59,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763253507] [2019-11-15 23:54:59,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:59,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:59,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:54:59,401 INFO L87 Difference]: Start difference. First operand 1989 states and 2227 transitions. Second operand 3 states. [2019-11-15 23:54:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:59,705 INFO L93 Difference]: Finished difference Result 3545 states and 3921 transitions. [2019-11-15 23:54:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:59,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-15 23:54:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:59,713 INFO L225 Difference]: With dead ends: 3545 [2019-11-15 23:54:59,713 INFO L226 Difference]: Without dead ends: 1274 [2019-11-15 23:54:59,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:54:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-11-15 23:54:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2019-11-15 23:54:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-11-15 23:54:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1372 transitions. [2019-11-15 23:54:59,741 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1372 transitions. Word has length 198 [2019-11-15 23:54:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:59,742 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 1372 transitions. [2019-11-15 23:54:59,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1372 transitions. [2019-11-15 23:54:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-15 23:54:59,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:59,747 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:59,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:54:59,954 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:59,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1576967456, now seen corresponding path program 1 times [2019-11-15 23:54:59,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:59,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997814867] [2019-11-15 23:54:59,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:59,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:59,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:00,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997814867] [2019-11-15 23:55:00,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:00,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:55:00,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233145165] [2019-11-15 23:55:00,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:55:00,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:00,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:55:00,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:55:00,201 INFO L87 Difference]: Start difference. First operand 1274 states and 1372 transitions. Second operand 7 states. [2019-11-15 23:55:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:01,498 INFO L93 Difference]: Finished difference Result 2710 states and 2934 transitions. [2019-11-15 23:55:01,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:55:01,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2019-11-15 23:55:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:01,505 INFO L225 Difference]: With dead ends: 2710 [2019-11-15 23:55:01,505 INFO L226 Difference]: Without dead ends: 1295 [2019-11-15 23:55:01,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:55:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-11-15 23:55:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1274. [2019-11-15 23:55:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-11-15 23:55:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1333 transitions. [2019-11-15 23:55:01,531 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1333 transitions. Word has length 203 [2019-11-15 23:55:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:01,531 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 1333 transitions. [2019-11-15 23:55:01,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:55:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1333 transitions. [2019-11-15 23:55:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-15 23:55:01,535 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:01,536 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:01,536 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:01,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:01,536 INFO L82 PathProgramCache]: Analyzing trace with hash -473711658, now seen corresponding path program 1 times [2019-11-15 23:55:01,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:01,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247202158] [2019-11-15 23:55:01,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:01,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:01,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:01,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247202158] [2019-11-15 23:55:01,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:01,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:01,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271283728] [2019-11-15 23:55:01,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:01,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:01,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:01,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:01,694 INFO L87 Difference]: Start difference. First operand 1274 states and 1333 transitions. Second operand 4 states. [2019-11-15 23:55:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:02,419 INFO L93 Difference]: Finished difference Result 2688 states and 2810 transitions. [2019-11-15 23:55:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:02,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-11-15 23:55:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:02,428 INFO L225 Difference]: With dead ends: 2688 [2019-11-15 23:55:02,428 INFO L226 Difference]: Without dead ends: 1416 [2019-11-15 23:55:02,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-11-15 23:55:02,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1274. [2019-11-15 23:55:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-11-15 23:55:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1316 transitions. [2019-11-15 23:55:02,462 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1316 transitions. Word has length 207 [2019-11-15 23:55:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:02,462 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 1316 transitions. [2019-11-15 23:55:02,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1316 transitions. [2019-11-15 23:55:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-15 23:55:02,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:02,468 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:02,468 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:02,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:02,468 INFO L82 PathProgramCache]: Analyzing trace with hash 283278328, now seen corresponding path program 1 times [2019-11-15 23:55:02,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:02,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035156867] [2019-11-15 23:55:02,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:02,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:02,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 23:55:02,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035156867] [2019-11-15 23:55:02,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:02,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:02,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66247149] [2019-11-15 23:55:02,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:02,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:02,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:02,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:02,658 INFO L87 Difference]: Start difference. First operand 1274 states and 1316 transitions. Second operand 4 states. [2019-11-15 23:55:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:03,298 INFO L93 Difference]: Finished difference Result 2543 states and 2631 transitions. [2019-11-15 23:55:03,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:03,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-11-15 23:55:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:03,299 INFO L225 Difference]: With dead ends: 2543 [2019-11-15 23:55:03,299 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:55:03,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:55:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:55:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:55:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:55:03,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 228 [2019-11-15 23:55:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:03,303 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:55:03,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:55:03,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:55:03,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:55:03,981 WARN L191 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-11-15 23:55:04,568 WARN L191 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-11-15 23:55:04,570 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,570 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,570 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,570 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-15 23:55:04,570 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-15 23:55:04,570 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-15 23:55:04,570 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-15 23:55:04,571 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-15 23:55:04,571 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-15 23:55:04,571 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-15 23:55:04,571 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,571 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,571 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,571 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-15 23:55:04,571 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-15 23:55:04,571 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-15 23:55:04,571 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-15 23:55:04,572 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-15 23:55:04,572 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-15 23:55:04,572 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-15 23:55:04,572 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,572 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,572 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,572 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-15 23:55:04,572 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-15 23:55:04,572 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-15 23:55:04,572 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-15 23:55:04,572 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-15 23:55:04,573 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,573 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,573 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,573 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-15 23:55:04,573 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-15 23:55:04,573 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-15 23:55:04,573 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-15 23:55:04,573 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-15 23:55:04,574 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-15 23:55:04,574 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-15 23:55:04,574 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-15 23:55:04,574 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,574 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,574 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,574 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-15 23:55:04,575 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-15 23:55:04,575 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-15 23:55:04,575 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-15 23:55:04,575 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-15 23:55:04,575 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-15 23:55:04,575 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-15 23:55:04,575 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-15 23:55:04,576 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,576 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,576 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,576 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-15 23:55:04,576 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-15 23:55:04,576 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-15 23:55:04,576 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-15 23:55:04,576 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-15 23:55:04,577 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-15 23:55:04,577 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-15 23:55:04,577 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-15 23:55:04,577 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-15 23:55:04,577 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,577 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,577 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,577 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-15 23:55:04,578 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-15 23:55:04,578 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-15 23:55:04,578 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-15 23:55:04,578 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-15 23:55:04,578 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-15 23:55:04,578 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,578 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,579 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,579 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-15 23:55:04,579 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-15 23:55:04,579 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-15 23:55:04,579 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-15 23:55:04,579 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-15 23:55:04,579 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:55:04,579 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-15 23:55:04,580 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-15 23:55:04,580 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-15 23:55:04,580 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,580 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,580 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,580 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-15 23:55:04,580 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-15 23:55:04,581 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-15 23:55:04,581 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-15 23:55:04,581 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-15 23:55:04,581 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,581 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,581 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,581 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-15 23:55:04,581 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-15 23:55:04,582 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-15 23:55:04,582 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-15 23:55:04,582 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-15 23:55:04,582 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-15 23:55:04,582 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-15 23:55:04,582 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-15 23:55:04,582 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-15 23:55:04,582 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-15 23:55:04,583 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:55:04,583 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-15 23:55:04,583 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,583 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,583 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-15 23:55:04,583 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-15 23:55:04,583 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-15 23:55:04,583 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-15 23:55:04,584 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-15 23:55:04,584 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-15 23:55:04,584 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-15 23:55:04,584 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-15 23:55:04,584 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-15 23:55:04,585 INFO L439 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1)) (.cse6 (= ~a19~0 1))) (let ((.cse3 (= ~a28~0 9)) (.cse16 (not .cse6)) (.cse9 (not .cse7)) (.cse13 (not (= ~a28~0 11))) (.cse15 (= 10 ~a28~0))) (let ((.cse1 (= ~a28~0 7)) (.cse5 (= ~a11~0 1)) (.cse11 (not .cse15)) (.cse14 (or (and (<= ~a19~0 0) .cse9) (and .cse16 .cse9 .cse13))) (.cse4 (and .cse16 .cse13)) (.cse8 (<= 8 ~a17~0)) (.cse10 (<= ~a17~0 8)) (.cse12 (not .cse3)) (.cse0 (= ~a17~0 8)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse7) (and .cse4 .cse8 .cse5) (and .cse9 .cse10 .cse5) (and .cse11 .cse8 .cse10 .cse7 .cse12 .cse13) (and .cse14 .cse5) (and .cse1 .cse10 .cse5) (and .cse11 (and .cse14 .cse10)) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 .cse6 .cse15 .cse2) (and (and .cse4 .cse8 .cse10) .cse7 .cse12) (and .cse3 .cse0 .cse9 .cse2))))) [2019-11-15 23:55:04,586 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,586 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,586 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-15 23:55:04,586 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-15 23:55:04,586 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-15 23:55:04,586 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-15 23:55:04,586 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-15 23:55:04,587 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-15 23:55:04,587 INFO L446 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-15 23:55:04,587 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,587 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,587 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-15 23:55:04,587 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-15 23:55:04,587 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-15 23:55:04,587 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-15 23:55:04,588 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-15 23:55:04,588 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-15 23:55:04,588 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-15 23:55:04,588 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-15 23:55:04,588 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-15 23:55:04,588 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,588 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,589 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-15 23:55:04,589 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-15 23:55:04,589 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-15 23:55:04,589 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-15 23:55:04,589 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-15 23:55:04,589 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-15 23:55:04,590 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1)) (.cse6 (= ~a19~0 1))) (let ((.cse3 (= ~a28~0 9)) (.cse16 (not .cse6)) (.cse9 (not .cse7)) (.cse13 (not (= ~a28~0 11))) (.cse15 (= 10 ~a28~0))) (let ((.cse1 (= ~a28~0 7)) (.cse5 (= ~a11~0 1)) (.cse11 (not .cse15)) (.cse14 (or (and (<= ~a19~0 0) .cse9) (and .cse16 .cse9 .cse13))) (.cse4 (and .cse16 .cse13)) (.cse8 (<= 8 ~a17~0)) (.cse10 (<= ~a17~0 8)) (.cse12 (not .cse3)) (.cse0 (= ~a17~0 8)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse7) (and .cse4 .cse8 .cse5) (and .cse9 .cse10 .cse5) (and .cse11 .cse8 .cse10 .cse7 .cse12 .cse13) (and .cse14 .cse5) (and .cse1 .cse10 .cse5) (and .cse11 (and .cse14 .cse10)) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 .cse6 .cse15 .cse2) (and (and .cse4 .cse8 .cse10) .cse7 .cse12) (and .cse3 .cse0 .cse9 .cse2))))) [2019-11-15 23:55:04,590 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,590 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,590 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-15 23:55:04,590 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-15 23:55:04,590 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-15 23:55:04,590 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-15 23:55:04,590 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-15 23:55:04,591 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,591 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 562) no Hoare annotation was computed. [2019-11-15 23:55:04,591 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,591 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-15 23:55:04,591 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-15 23:55:04,591 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-15 23:55:04,591 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-15 23:55:04,592 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-15 23:55:04,592 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-15 23:55:04,592 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-15 23:55:04,592 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-15 23:55:04,592 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-15 23:55:04,592 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,592 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,592 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-15 23:55:04,593 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,593 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-15 23:55:04,593 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-15 23:55:04,593 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-15 23:55:04,593 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-15 23:55:04,593 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-15 23:55:04,593 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:55:04,593 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-15 23:55:04,594 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,594 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,594 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,594 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-15 23:55:04,594 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-15 23:55:04,594 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-15 23:55:04,594 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-15 23:55:04,594 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-15 23:55:04,595 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,595 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,595 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,595 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-15 23:55:04,595 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-15 23:55:04,595 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-15 23:55:04,595 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-15 23:55:04,596 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-15 23:55:04,596 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-15 23:55:04,596 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,596 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,596 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,596 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-15 23:55:04,596 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-15 23:55:04,596 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-15 23:55:04,597 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-15 23:55:04,597 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-15 23:55:04,597 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-15 23:55:04,597 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:55:04,597 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-15 23:55:04,597 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-15 23:55:04,597 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,597 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,598 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,598 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-15 23:55:04,598 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-15 23:55:04,598 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-15 23:55:04,598 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-15 23:55:04,598 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-15 23:55:04,598 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,598 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,599 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 23:55:04,599 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-15 23:55:04,599 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-15 23:55:04,599 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-15 23:55:04,599 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-15 23:55:04,599 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-15 23:55:04,599 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-15 23:55:04,599 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-15 23:55:04,600 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-15 23:55:04,600 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-15 23:55:04,600 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-15 23:55:04,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:55:04 BoogieIcfgContainer [2019-11-15 23:55:04,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:55:04,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:55:04,643 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:55:04,644 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:55:04,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:50" (3/4) ... [2019-11-15 23:55:04,648 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:55:04,676 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:55:04,677 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:55:04,887 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_78f8fdcd-3229-450d-b24c-7d5cedbe602a/bin/uautomizer/witness.graphml [2019-11-15 23:55:04,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:55:04,889 INFO L168 Benchmark]: Toolchain (without parser) took 16948.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -302.0 MB). Peak memory consumption was 100.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:04,890 INFO L168 Benchmark]: CDTParser took 0.26 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 23:55:04,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:04,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.46 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:04,892 INFO L168 Benchmark]: Boogie Preprocessor took 55.42 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:04,893 INFO L168 Benchmark]: RCFGBuilder took 1461.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.3 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:04,893 INFO L168 Benchmark]: TraceAbstraction took 14397.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 980.3 MB in the beginning and 1.3 GB in the end (delta: -293.6 MB). Peak memory consumption was 422.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:04,894 INFO L168 Benchmark]: Witness Printer took 244.10 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:04,897 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.26 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 687.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.46 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.42 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1461.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.3 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14397.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 980.3 MB in the beginning and 1.3 GB in the end (delta: -293.6 MB). Peak memory consumption was 422.6 MB. Max. memory is 11.5 GB. * Witness Printer took 244.10 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 562]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((a17 == 8 && a28 == 7) && a21 == 1) || ((a28 == 9 && !(a19 == 1) && !(a28 == 11)) && a11 == 1)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || (((!(a19 == 1) && !(a28 == 11)) && 8 <= a17) && a11 == 1)) || ((!(a25 == 1) && a17 <= 8) && a11 == 1)) || (((((!(10 == a28) && 8 <= a17) && a17 <= 8) && a25 == 1) && !(a28 == 9)) && !(a28 == 11))) || (((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11))) && a11 == 1)) || ((a28 == 7 && a17 <= 8) && a11 == 1)) || (!(10 == a28) && ((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11))) && a17 <= 8)) || ((((!(5 == input) && a17 == 8) && a19 == 1) && 10 == a28) && a21 == 1)) || (((((!(a19 == 1) && !(a28 == 11)) && 8 <= a17) && a17 <= 8) && a25 == 1) && !(a28 == 9))) || (((a28 == 9 && a17 == 8) && !(a25 == 1)) && a21 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((a17 == 8 && a28 == 7) && a21 == 1) || ((a28 == 9 && !(a19 == 1) && !(a28 == 11)) && a11 == 1)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || (((!(a19 == 1) && !(a28 == 11)) && 8 <= a17) && a11 == 1)) || ((!(a25 == 1) && a17 <= 8) && a11 == 1)) || (((((!(10 == a28) && 8 <= a17) && a17 <= 8) && a25 == 1) && !(a28 == 9)) && !(a28 == 11))) || (((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11))) && a11 == 1)) || ((a28 == 7 && a17 <= 8) && a11 == 1)) || (!(10 == a28) && ((a19 <= 0 && !(a25 == 1)) || ((!(a19 == 1) && !(a25 == 1)) && !(a28 == 11))) && a17 <= 8)) || ((((!(5 == input) && a17 == 8) && a19 == 1) && 10 == a28) && a21 == 1)) || (((((!(a19 == 1) && !(a28 == 11)) && 8 <= a17) && a17 <= 8) && a25 == 1) && !(a28 == 9))) || (((a28 == 9 && a17 == 8) && !(a25 == 1)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 14.2s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 1262 SDtfs, 2480 SDslu, 295 SDs, 0 SdLazy, 6276 SolverSat, 996 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 381 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1994occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 2023 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 423 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2042 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1232 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2332 NumberOfCodeBlocks, 2332 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2319 ConstructedInterpolants, 0 QuantifiedInterpolants, 1339968 SizeOfPredicates, 1 NumberOfNonLiveVariables, 641 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 890/896 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 correct! Received shutdown request...