./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label56.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_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label56.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/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 e20784f8aa644ffcee7dc85218c97681429f7c28 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:13:41,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:13:41,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:13:41,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:13:41,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:13:41,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:13:41,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:13:41,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:13:41,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:13:41,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:13:41,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:13:41,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:13:41,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:13:41,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:13:41,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:13:41,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:13:41,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:13:41,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:13:41,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:13:41,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:13:41,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:13:41,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:13:41,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:13:41,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:13:41,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:13:41,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:13:41,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:13:41,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:13:41,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:13:41,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:13:41,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:13:41,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:13:41,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:13:41,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:13:41,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:13:41,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:13:41,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:13:41,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:13:41,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:13:41,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:13:41,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:13:41,638 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:13:41,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:13:41,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:13:41,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:13:41,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:13:41,653 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:13:41,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:13:41,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:13:41,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:13:41,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:13:41,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:13:41,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:13:41,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:13:41,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:13:41,655 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:13:41,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:13:41,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:13:41,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:13:41,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:13:41,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:13:41,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:13:41,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:13:41,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:13:41,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:13:41,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:13:41,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:13:41,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:13:41,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:13:41,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:13:41,659 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_5c52e805-2a1b-4156-ad49-bbed380d47dc/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 -> e20784f8aa644ffcee7dc85218c97681429f7c28 [2019-11-16 00:13:41,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:13:41,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:13:41,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:13:41,709 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:13:41,710 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:13:41,712 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label56.c [2019-11-16 00:13:41,765 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/data/522ea469e/c55e7212d4344d8ba8c819932a060333/FLAGe6b7bb107 [2019-11-16 00:13:42,240 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:13:42,240 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/sv-benchmarks/c/eca-rers2012/Problem10_label56.c [2019-11-16 00:13:42,253 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/data/522ea469e/c55e7212d4344d8ba8c819932a060333/FLAGe6b7bb107 [2019-11-16 00:13:42,265 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/data/522ea469e/c55e7212d4344d8ba8c819932a060333 [2019-11-16 00:13:42,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:13:42,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:13:42,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:13:42,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:13:42,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:13:42,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:13:42" (1/1) ... [2019-11-16 00:13:42,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668f3393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42, skipping insertion in model container [2019-11-16 00:13:42,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:13:42" (1/1) ... [2019-11-16 00:13:42,285 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:13:42,329 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:13:42,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:13:42,732 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:13:42,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:13:42,867 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:13:42,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42 WrapperNode [2019-11-16 00:13:42,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:13:42,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:13:42,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:13:42,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:13:42,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42" (1/1) ... [2019-11-16 00:13:42,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42" (1/1) ... [2019-11-16 00:13:42,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:13:42,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:13:42,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:13:42,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:13:42,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42" (1/1) ... [2019-11-16 00:13:42,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42" (1/1) ... [2019-11-16 00:13:42,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42" (1/1) ... [2019-11-16 00:13:42,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42" (1/1) ... [2019-11-16 00:13:43,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42" (1/1) ... [2019-11-16 00:13:43,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42" (1/1) ... [2019-11-16 00:13:43,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42" (1/1) ... [2019-11-16 00:13:43,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:13:43,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:13:43,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:13:43,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:13:43,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/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-16 00:13:43,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:13:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:13:44,303 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:13:44,303 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:13:44,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:13:44 BoogieIcfgContainer [2019-11-16 00:13:44,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:13:44,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:13:44,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:13:44,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:13:44,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:13:42" (1/3) ... [2019-11-16 00:13:44,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ccba0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:13:44, skipping insertion in model container [2019-11-16 00:13:44,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:42" (2/3) ... [2019-11-16 00:13:44,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ccba0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:13:44, skipping insertion in model container [2019-11-16 00:13:44,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:13:44" (3/3) ... [2019-11-16 00:13:44,315 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label56.c [2019-11-16 00:13:44,325 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:13:44,334 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:13:44,344 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:13:44,380 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:13:44,381 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:13:44,381 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:13:44,381 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:13:44,382 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:13:44,382 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:13:44,382 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:13:44,382 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:13:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-11-16 00:13:44,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:13:44,417 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:44,418 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] [2019-11-16 00:13:44,419 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:44,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:44,425 INFO L82 PathProgramCache]: Analyzing trace with hash -573341295, now seen corresponding path program 1 times [2019-11-16 00:13:44,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:44,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134945896] [2019-11-16 00:13:44,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:44,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:44,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:44,693 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-16 00:13:44,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134945896] [2019-11-16 00:13:44,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:44,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:13:44,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183419851] [2019-11-16 00:13:44,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:13:44,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:44,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:13:44,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:13:44,717 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-11-16 00:13:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:46,312 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-11-16 00:13:46,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:13:46,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-16 00:13:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:46,334 INFO L225 Difference]: With dead ends: 694 [2019-11-16 00:13:46,334 INFO L226 Difference]: Without dead ends: 421 [2019-11-16 00:13:46,341 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-16 00:13:46,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-16 00:13:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-11-16 00:13:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-16 00:13:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-11-16 00:13:46,416 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 23 [2019-11-16 00:13:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:46,417 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-11-16 00:13:46,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:13:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-11-16 00:13:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:13:46,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:46,425 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:13:46,426 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:46,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1981617417, now seen corresponding path program 1 times [2019-11-16 00:13:46,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:46,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325490873] [2019-11-16 00:13:46,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:46,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:46,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:13:46,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325490873] [2019-11-16 00:13:46,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:46,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:13:46,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184284880] [2019-11-16 00:13:46,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:13:46,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:46,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:13:46,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:13:46,576 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 4 states. [2019-11-16 00:13:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:47,484 INFO L93 Difference]: Finished difference Result 840 states and 1290 transitions. [2019-11-16 00:13:47,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:13:47,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-16 00:13:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:47,489 INFO L225 Difference]: With dead ends: 840 [2019-11-16 00:13:47,489 INFO L226 Difference]: Without dead ends: 560 [2019-11-16 00:13:47,490 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 00:13:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-11-16 00:13:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2019-11-16 00:13:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-16 00:13:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2019-11-16 00:13:47,510 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 92 [2019-11-16 00:13:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:47,511 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2019-11-16 00:13:47,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:13:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2019-11-16 00:13:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:13:47,513 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:47,513 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:13:47,514 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:47,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:47,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2055444920, now seen corresponding path program 1 times [2019-11-16 00:13:47,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:47,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941481497] [2019-11-16 00:13:47,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:47,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:47,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:13:47,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941481497] [2019-11-16 00:13:47,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:47,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:13:47,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520359740] [2019-11-16 00:13:47,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:13:47,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:47,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:13:47,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:13:47,606 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand 4 states. [2019-11-16 00:13:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:48,510 INFO L93 Difference]: Finished difference Result 1535 states and 2162 transitions. [2019-11-16 00:13:48,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:13:48,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-16 00:13:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:48,520 INFO L225 Difference]: With dead ends: 1535 [2019-11-16 00:13:48,520 INFO L226 Difference]: Without dead ends: 1116 [2019-11-16 00:13:48,522 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-16 00:13:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-11-16 00:13:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 838. [2019-11-16 00:13:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-16 00:13:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1093 transitions. [2019-11-16 00:13:48,561 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1093 transitions. Word has length 98 [2019-11-16 00:13:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:48,561 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1093 transitions. [2019-11-16 00:13:48,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:13:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1093 transitions. [2019-11-16 00:13:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-16 00:13:48,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:48,567 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:13:48,568 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:48,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1680739469, now seen corresponding path program 1 times [2019-11-16 00:13:48,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:48,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948525351] [2019-11-16 00:13:48,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:48,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:48,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:13:48,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948525351] [2019-11-16 00:13:48,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:48,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:13:48,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288723644] [2019-11-16 00:13:48,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:13:48,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:48,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:13:48,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:13:48,806 INFO L87 Difference]: Start difference. First operand 838 states and 1093 transitions. Second operand 4 states. [2019-11-16 00:13:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:49,552 INFO L93 Difference]: Finished difference Result 1813 states and 2363 transitions. [2019-11-16 00:13:49,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:13:49,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-16 00:13:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:49,559 INFO L225 Difference]: With dead ends: 1813 [2019-11-16 00:13:49,559 INFO L226 Difference]: Without dead ends: 977 [2019-11-16 00:13:49,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 00:13:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-11-16 00:13:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-11-16 00:13:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-16 00:13:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1167 transitions. [2019-11-16 00:13:49,585 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1167 transitions. Word has length 160 [2019-11-16 00:13:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:49,586 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1167 transitions. [2019-11-16 00:13:49,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:13:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1167 transitions. [2019-11-16 00:13:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-16 00:13:49,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:49,593 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-11-16 00:13:49,593 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1308448785, now seen corresponding path program 1 times [2019-11-16 00:13:49,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:49,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905755531] [2019-11-16 00:13:49,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:49,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:49,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:13:49,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905755531] [2019-11-16 00:13:49,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:49,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:13:49,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591867560] [2019-11-16 00:13:49,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:13:49,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:49,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:13:49,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:13:49,886 INFO L87 Difference]: Start difference. First operand 977 states and 1167 transitions. Second operand 5 states. [2019-11-16 00:13:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:51,536 INFO L93 Difference]: Finished difference Result 3622 states and 4322 transitions. [2019-11-16 00:13:51,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:13:51,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-11-16 00:13:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:51,550 INFO L225 Difference]: With dead ends: 3622 [2019-11-16 00:13:51,550 INFO L226 Difference]: Without dead ends: 2647 [2019-11-16 00:13:51,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:13:51,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-11-16 00:13:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1950. [2019-11-16 00:13:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-11-16 00:13:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2256 transitions. [2019-11-16 00:13:51,598 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2256 transitions. Word has length 192 [2019-11-16 00:13:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:51,598 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 2256 transitions. [2019-11-16 00:13:51,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:13:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2256 transitions. [2019-11-16 00:13:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-16 00:13:51,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:51,603 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-11-16 00:13:51,604 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:51,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:51,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1589151532, now seen corresponding path program 1 times [2019-11-16 00:13:51,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:51,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312303438] [2019-11-16 00:13:51,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:51,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:51,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:13:51,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312303438] [2019-11-16 00:13:51,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:13:51,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:13:51,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952987561] [2019-11-16 00:13:51,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:13:51,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:51,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:13:51,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:13:51,775 INFO L87 Difference]: Start difference. First operand 1950 states and 2256 transitions. Second operand 5 states. [2019-11-16 00:13:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:52,928 INFO L93 Difference]: Finished difference Result 5288 states and 6070 transitions. [2019-11-16 00:13:52,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:13:52,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2019-11-16 00:13:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:52,939 INFO L225 Difference]: With dead ends: 5288 [2019-11-16 00:13:52,939 INFO L226 Difference]: Without dead ends: 1950 [2019-11-16 00:13:52,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:13:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-11-16 00:13:52,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1672. [2019-11-16 00:13:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-16 00:13:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1832 transitions. [2019-11-16 00:13:52,984 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1832 transitions. Word has length 235 [2019-11-16 00:13:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:52,985 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1832 transitions. [2019-11-16 00:13:52,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:13:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1832 transitions. [2019-11-16 00:13:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-16 00:13:52,990 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:52,990 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:13:52,991 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:52,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash 433365790, now seen corresponding path program 1 times [2019-11-16 00:13:52,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:52,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044427172] [2019-11-16 00:13:52,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:52,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:52,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 69 proven. 141 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-16 00:13:53,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044427172] [2019-11-16 00:13:53,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766061705] [2019-11-16 00:13:53,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/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-16 00:13:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:53,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:13:53,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:13:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-11-16 00:13:53,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:13:53,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:13:53,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552388652] [2019-11-16 00:13:53,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:13:53,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:53,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:13:53,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:13:53,670 INFO L87 Difference]: Start difference. First operand 1672 states and 1832 transitions. Second operand 3 states. [2019-11-16 00:13:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:54,275 INFO L93 Difference]: Finished difference Result 4037 states and 4449 transitions. [2019-11-16 00:13:54,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:13:54,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-11-16 00:13:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:54,288 INFO L225 Difference]: With dead ends: 4037 [2019-11-16 00:13:54,288 INFO L226 Difference]: Without dead ends: 2367 [2019-11-16 00:13:54,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:13:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-11-16 00:13:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2019-11-16 00:13:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-11-16 00:13:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2577 transitions. [2019-11-16 00:13:54,348 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2577 transitions. Word has length 258 [2019-11-16 00:13:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:54,348 INFO L462 AbstractCegarLoop]: Abstraction has 2367 states and 2577 transitions. [2019-11-16 00:13:54,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:13:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2577 transitions. [2019-11-16 00:13:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-16 00:13:54,354 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:54,355 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-11-16 00:13:54,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:13:54,559 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:54,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:54,560 INFO L82 PathProgramCache]: Analyzing trace with hash 666553426, now seen corresponding path program 1 times [2019-11-16 00:13:54,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:54,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25871686] [2019-11-16 00:13:54,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:54,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:54,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 21 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:13:54,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25871686] [2019-11-16 00:13:54,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575606960] [2019-11-16 00:13:54,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/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-16 00:13:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:54,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:13:54,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:13:54,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:54,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:54,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:54,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:55,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:13:56,176 WARN L191 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-11-16 00:13:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 21 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:13:56,428 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:13:56,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-16 00:13:56,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723097917] [2019-11-16 00:13:56,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:13:56,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:13:56,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:13:56,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:13:56,431 INFO L87 Difference]: Start difference. First operand 2367 states and 2577 transitions. Second operand 7 states. [2019-11-16 00:13:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:13:59,416 INFO L93 Difference]: Finished difference Result 6539 states and 7142 transitions. [2019-11-16 00:13:59,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:13:59,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 271 [2019-11-16 00:13:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:13:59,436 INFO L225 Difference]: With dead ends: 6539 [2019-11-16 00:13:59,436 INFO L226 Difference]: Without dead ends: 4174 [2019-11-16 00:13:59,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:13:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4174 states. [2019-11-16 00:13:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4174 to 2923. [2019-11-16 00:13:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2019-11-16 00:13:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3162 transitions. [2019-11-16 00:13:59,510 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3162 transitions. Word has length 271 [2019-11-16 00:13:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:13:59,511 INFO L462 AbstractCegarLoop]: Abstraction has 2923 states and 3162 transitions. [2019-11-16 00:13:59,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:13:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3162 transitions. [2019-11-16 00:13:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-11-16 00:13:59,519 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:13:59,519 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:13:59,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:13:59,730 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:13:59,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:13:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash 960030519, now seen corresponding path program 1 times [2019-11-16 00:13:59,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:13:59,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797109132] [2019-11-16 00:13:59,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:59,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:13:59,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:13:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:13:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 219 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-16 00:13:59,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797109132] [2019-11-16 00:13:59,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63351585] [2019-11-16 00:13:59,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:14:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:00,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:14:00,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:14:00,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:00,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:00,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:00,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:00,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:00,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:00,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:00,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 219 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-16 00:14:00,276 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:14:00,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-16 00:14:00,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477282546] [2019-11-16 00:14:00,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:14:00,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:14:00,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:14:00,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:14:00,282 INFO L87 Difference]: Start difference. First operand 2923 states and 3162 transitions. Second operand 5 states. [2019-11-16 00:14:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:14:01,320 INFO L93 Difference]: Finished difference Result 6678 states and 7231 transitions. [2019-11-16 00:14:01,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:14:01,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 325 [2019-11-16 00:14:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:14:01,340 INFO L225 Difference]: With dead ends: 6678 [2019-11-16 00:14:01,340 INFO L226 Difference]: Without dead ends: 3757 [2019-11-16 00:14:01,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:14:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2019-11-16 00:14:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3340. [2019-11-16 00:14:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3340 states. [2019-11-16 00:14:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 3613 transitions. [2019-11-16 00:14:01,412 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 3613 transitions. Word has length 325 [2019-11-16 00:14:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:14:01,412 INFO L462 AbstractCegarLoop]: Abstraction has 3340 states and 3613 transitions. [2019-11-16 00:14:01,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:14:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 3613 transitions. [2019-11-16 00:14:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-11-16 00:14:01,422 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:14:01,423 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:14:01,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:14:01,627 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:14:01,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:01,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1084368801, now seen corresponding path program 1 times [2019-11-16 00:14:01,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:01,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540875776] [2019-11-16 00:14:01,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:01,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:01,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:14:01,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540875776] [2019-11-16 00:14:01,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:14:01,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:14:01,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356635600] [2019-11-16 00:14:01,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:14:01,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:14:01,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:14:01,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:14:01,855 INFO L87 Difference]: Start difference. First operand 3340 states and 3613 transitions. Second operand 4 states. [2019-11-16 00:14:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:14:02,903 INFO L93 Difference]: Finished difference Result 7095 states and 7688 transitions. [2019-11-16 00:14:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:14:02,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 410 [2019-11-16 00:14:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:14:02,921 INFO L225 Difference]: With dead ends: 7095 [2019-11-16 00:14:02,921 INFO L226 Difference]: Without dead ends: 3896 [2019-11-16 00:14:02,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-16 00:14:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2019-11-16 00:14:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3757. [2019-11-16 00:14:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3757 states. [2019-11-16 00:14:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 4037 transitions. [2019-11-16 00:14:02,999 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 4037 transitions. Word has length 410 [2019-11-16 00:14:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:14:03,000 INFO L462 AbstractCegarLoop]: Abstraction has 3757 states and 4037 transitions. [2019-11-16 00:14:03,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:14:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 4037 transitions. [2019-11-16 00:14:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-16 00:14:03,012 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:14:03,012 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:14:03,012 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:14:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:03,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1688260000, now seen corresponding path program 1 times [2019-11-16 00:14:03,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:03,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820317132] [2019-11-16 00:14:03,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:03,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:03,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 45 proven. 443 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-16 00:14:03,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820317132] [2019-11-16 00:14:03,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394567019] [2019-11-16 00:14:03,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:14:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:03,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:14:03,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:14:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:04,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:04,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:04,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:04,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:04,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:04,343 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 16 [2019-11-16 00:14:04,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:04,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:05,356 WARN L191 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-11-16 00:14:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 168 proven. 320 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-16 00:14:05,969 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:14:05,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2019-11-16 00:14:05,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3221439] [2019-11-16 00:14:05,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:14:05,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:14:05,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:14:05,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:14:05,971 INFO L87 Difference]: Start difference. First operand 3757 states and 4037 transitions. Second operand 13 states. [2019-11-16 00:14:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:14:21,741 INFO L93 Difference]: Finished difference Result 9491 states and 10207 transitions. [2019-11-16 00:14:21,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:14:21,742 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 419 [2019-11-16 00:14:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:14:21,765 INFO L225 Difference]: With dead ends: 9491 [2019-11-16 00:14:21,765 INFO L226 Difference]: Without dead ends: 5736 [2019-11-16 00:14:21,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:14:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5736 states. [2019-11-16 00:14:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5736 to 3757. [2019-11-16 00:14:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3757 states. [2019-11-16 00:14:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 4037 transitions. [2019-11-16 00:14:21,860 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 4037 transitions. Word has length 419 [2019-11-16 00:14:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:14:21,861 INFO L462 AbstractCegarLoop]: Abstraction has 3757 states and 4037 transitions. [2019-11-16 00:14:21,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:14:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 4037 transitions. [2019-11-16 00:14:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-11-16 00:14:21,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:14:21,878 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:14:22,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:14:22,082 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:14:22,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:22,083 INFO L82 PathProgramCache]: Analyzing trace with hash 615073138, now seen corresponding path program 1 times [2019-11-16 00:14:22,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:22,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985641028] [2019-11-16 00:14:22,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:22,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:22,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 563 proven. 109 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-16 00:14:22,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985641028] [2019-11-16 00:14:22,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287564805] [2019-11-16 00:14:22,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:14:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:22,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:14:22,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:14:22,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:22,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-16 00:14:23,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:14:23,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-16 00:14:23,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650159347] [2019-11-16 00:14:23,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:14:23,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:14:23,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:14:23,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:14:23,045 INFO L87 Difference]: Start difference. First operand 3757 states and 4037 transitions. Second operand 4 states. [2019-11-16 00:14:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:14:24,218 INFO L93 Difference]: Finished difference Result 9458 states and 10172 transitions. [2019-11-16 00:14:24,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:14:24,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 533 [2019-11-16 00:14:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:14:24,241 INFO L225 Difference]: With dead ends: 9458 [2019-11-16 00:14:24,246 INFO L226 Difference]: Without dead ends: 5703 [2019-11-16 00:14:24,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:14:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2019-11-16 00:14:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 4174. [2019-11-16 00:14:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-11-16 00:14:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 4485 transitions. [2019-11-16 00:14:24,326 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 4485 transitions. Word has length 533 [2019-11-16 00:14:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:14:24,327 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 4485 transitions. [2019-11-16 00:14:24,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:14:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 4485 transitions. [2019-11-16 00:14:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-11-16 00:14:24,346 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:14:24,347 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:14:24,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:14:24,554 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:14:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1979476456, now seen corresponding path program 1 times [2019-11-16 00:14:24,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:24,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494483672] [2019-11-16 00:14:24,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:24,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:24,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 682 proven. 228 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-11-16 00:14:25,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494483672] [2019-11-16 00:14:25,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42522864] [2019-11-16 00:14:25,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:14:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:25,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:14:25,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:14:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-16 00:14:25,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:14:25,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-16 00:14:25,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570542950] [2019-11-16 00:14:25,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:14:25,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:14:25,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:14:25,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:14:25,928 INFO L87 Difference]: Start difference. First operand 4174 states and 4485 transitions. Second operand 3 states. [2019-11-16 00:14:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:14:26,331 INFO L93 Difference]: Finished difference Result 7510 states and 8069 transitions. [2019-11-16 00:14:26,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:14:26,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 561 [2019-11-16 00:14:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:14:26,332 INFO L225 Difference]: With dead ends: 7510 [2019-11-16 00:14:26,332 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:14:26,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 560 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:14:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:14:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:14:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:14:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:14:26,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 561 [2019-11-16 00:14:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:14:26,339 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:14:26,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:14:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:14:26,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:14:26,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:14:26,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:14:26,808 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 254 [2019-11-16 00:14:27,063 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 254 [2019-11-16 00:14:28,917 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 249 DAG size of output: 81 [2019-11-16 00:14:30,459 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 249 DAG size of output: 81 [2019-11-16 00:14:30,462 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-11-16 00:14:30,462 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,462 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,462 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,462 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,462 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,462 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,462 INFO L443 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-11-16 00:14:30,462 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,463 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-11-16 00:14:30,464 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-16 00:14:30,465 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-16 00:14:30,466 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-16 00:14:30,466 INFO L439 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse7 (= 9 ~a19~0)) (.cse5 (= 1 ~a10~0))) (let ((.cse0 (= ~a19~0 8)) (.cse6 (not .cse5)) (.cse3 (= 14 ~a4~0)) (.cse8 (<= ~a10~0 2)) (.cse4 (= ~a12~0 0)) (.cse1 (<= 56 ~a1~0)) (.cse2 (<= ~a1~0 589891)) (.cse9 (not .cse7))) (or (and .cse0 .cse1) (and (<= ~a19~0 8) (not .cse0)) (and .cse2 (and (< 218 ~a1~0) .cse3 .cse4 .cse5)) (and (and .cse3 .cse6 .cse4 .cse7) .cse8) (and .cse0 (not (= ~a10~0 4))) (and (and (= ~a10~0 0) .cse9) (<= ~a1~0 218)) (and .cse0 (exists ((v_~a1~0_346 Int)) (and (<= 0 (* 9 v_~a1~0_346)) (< 218 v_~a1~0_346) (<= v_~a1~0_346 589891) (<= (+ ~a1~0 545163) (div (* v_~a1~0_346 9) 10))))) (and (= ~a10~0 3) .cse2 .cse3 .cse4 .cse7) (and (<= ~a1~0 505232) .cse3 .cse6 .cse4 .cse7) (and .cse3 .cse4 (<= (+ ~a1~0 13) 0) .cse7) (and .cse3 .cse8 .cse4 .cse1 (exists ((v_~a1~0_343 Int)) (and (<= v_~a1~0_343 218) (<= ~a1~0 (+ (div (* (div v_~a1~0_343 5) 5) 5) 505228)) (= 0 (mod v_~a1~0_343 5)))) .cse7) (and .cse2 .cse9 .cse5)))) [2019-11-16 00:14:30,466 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-11-16 00:14:30,466 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-11-16 00:14:30,466 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-11-16 00:14:30,466 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-11-16 00:14:30,466 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,467 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,467 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,467 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,467 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,467 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-11-16 00:14:30,467 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-11-16 00:14:30,467 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-11-16 00:14:30,467 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-16 00:14:30,467 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-16 00:14:30,467 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-16 00:14:30,467 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-16 00:14:30,468 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-16 00:14:30,468 INFO L443 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-11-16 00:14:30,468 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-11-16 00:14:30,468 INFO L446 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-11-16 00:14:30,468 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-11-16 00:14:30,468 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-11-16 00:14:30,468 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-11-16 00:14:30,468 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,468 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,468 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,468 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,468 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,469 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-16 00:14:30,469 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-16 00:14:30,469 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-16 00:14:30,469 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-16 00:14:30,469 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-16 00:14:30,469 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-11-16 00:14:30,469 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-11-16 00:14:30,475 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-11-16 00:14:30,475 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-11-16 00:14:30,475 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,475 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,475 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,475 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,475 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,476 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-11-16 00:14:30,476 INFO L443 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-11-16 00:14:30,476 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-11-16 00:14:30,476 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-11-16 00:14:30,476 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-16 00:14:30,476 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-16 00:14:30,476 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-16 00:14:30,477 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-16 00:14:30,477 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-16 00:14:30,477 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2019-11-16 00:14:30,477 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-11-16 00:14:30,477 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-11-16 00:14:30,477 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:14:30,477 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-11-16 00:14:30,478 INFO L439 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse7 (= 9 ~a19~0)) (.cse5 (= 1 ~a10~0))) (let ((.cse0 (= ~a19~0 8)) (.cse6 (not .cse5)) (.cse3 (= 14 ~a4~0)) (.cse8 (<= ~a10~0 2)) (.cse4 (= ~a12~0 0)) (.cse1 (<= 56 ~a1~0)) (.cse2 (<= ~a1~0 589891)) (.cse9 (not .cse7))) (or (and .cse0 .cse1) (and (<= ~a19~0 8) (not .cse0)) (and .cse2 (and (< 218 ~a1~0) .cse3 .cse4 .cse5)) (and (and .cse3 .cse6 .cse4 .cse7) .cse8) (and .cse0 (not (= ~a10~0 4))) (and (and (= ~a10~0 0) .cse9) (<= ~a1~0 218)) (and .cse0 (exists ((v_~a1~0_346 Int)) (and (<= 0 (* 9 v_~a1~0_346)) (< 218 v_~a1~0_346) (<= v_~a1~0_346 589891) (<= (+ ~a1~0 545163) (div (* v_~a1~0_346 9) 10))))) (and (= ~a10~0 3) .cse2 .cse3 .cse4 .cse7) (and (<= ~a1~0 505232) .cse3 .cse6 .cse4 .cse7) (and .cse3 .cse4 (<= (+ ~a1~0 13) 0) .cse7) (and .cse3 .cse8 .cse4 .cse1 (exists ((v_~a1~0_343 Int)) (and (<= v_~a1~0_343 218) (<= ~a1~0 (+ (div (* (div v_~a1~0_343 5) 5) 5) 505228)) (= 0 (mod v_~a1~0_343 5)))) .cse7) (and .cse2 .cse9 .cse5)))) [2019-11-16 00:14:30,478 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-11-16 00:14:30,478 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,478 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,478 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,479 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,479 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-16 00:14:30,479 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,480 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,480 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-11-16 00:14:30,480 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-11-16 00:14:30,480 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-11-16 00:14:30,480 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-16 00:14:30,480 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-16 00:14:30,480 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-16 00:14:30,481 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-16 00:14:30,481 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-16 00:14:30,481 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-16 00:14:30,481 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-11-16 00:14:30,481 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-11-16 00:14:30,481 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-11-16 00:14:30,482 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-11-16 00:14:30,482 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,482 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,483 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,483 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,483 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,483 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,483 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-11-16 00:14:30,483 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-11-16 00:14:30,483 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-11-16 00:14:30,484 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:14:30,484 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-16 00:14:30,484 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-16 00:14:30,484 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-16 00:14:30,484 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-16 00:14:30,484 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-16 00:14:30,484 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-16 00:14:30,485 INFO L443 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-11-16 00:14:30,485 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-11-16 00:14:30,485 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-11-16 00:14:30,485 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-11-16 00:14:30,485 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-11-16 00:14:30,485 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-11-16 00:14:30,486 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,486 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,486 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,486 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,486 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,486 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,486 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-11-16 00:14:30,487 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-16 00:14:30,487 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-16 00:14:30,487 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-16 00:14:30,487 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-16 00:14:30,487 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-16 00:14:30,487 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:14:30,487 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-16 00:14:30,488 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-11-16 00:14:30,488 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-11-16 00:14:30,488 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-11-16 00:14:30,488 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-11-16 00:14:30,488 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-11-16 00:14:30,488 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-11-16 00:14:30,488 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,489 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,489 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,489 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,489 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,489 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,489 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-11-16 00:14:30,490 INFO L443 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-11-16 00:14:30,490 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-11-16 00:14:30,490 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-16 00:14:30,490 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-16 00:14:30,490 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-16 00:14:30,490 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-16 00:14:30,490 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-16 00:14:30,491 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-16 00:14:30,491 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-11-16 00:14:30,491 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-11-16 00:14:30,491 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:14:30,491 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-11-16 00:14:30,491 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,491 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,492 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,492 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,492 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,492 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-11-16 00:14:30,492 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-11-16 00:14:30,492 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-11-16 00:14:30,493 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-11-16 00:14:30,493 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-16 00:14:30,493 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-16 00:14:30,493 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-16 00:14:30,493 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:14:30,493 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-16 00:14:30,493 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-16 00:14:30,494 INFO L443 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-11-16 00:14:30,494 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-11-16 00:14:30,494 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-11-16 00:14:30,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:14:30 BoogieIcfgContainer [2019-11-16 00:14:30,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:14:30,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:14:30,565 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:14:30,565 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:14:30,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:13:44" (3/4) ... [2019-11-16 00:14:30,569 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:14:30,601 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:14:30,602 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:14:30,647 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((a19 == 8 && 56 <= a1) || (a19 <= 8 && !(a19 == 8))) || (a1 <= 589891 && ((218 < a1 && 14 == a4) && a12 == 0) && 1 == a10)) || ((((14 == a4 && !(1 == a10)) && a12 == 0) && 9 == a19) && a10 <= 2)) || (a19 == 8 && !(a10 == 4))) || ((a10 == 0 && !(9 == a19)) && a1 <= 218)) || (a19 == 8 && (\exists v_~a1~0_346 : int :: ((0 <= 9 * v_~a1~0_346 && 218 < v_~a1~0_346) && v_~a1~0_346 <= 589891) && a1 + 545163 <= v_~a1~0_346 * 9 / 10))) || ((((a10 == 3 && a1 <= 589891) && 14 == a4) && a12 == 0) && 9 == a19)) || ((((a1 <= 505232 && 14 == a4) && !(1 == a10)) && a12 == 0) && 9 == a19)) || (((14 == a4 && a12 == 0) && a1 + 13 <= 0) && 9 == a19)) || (((((14 == a4 && a10 <= 2) && a12 == 0) && 56 <= a1) && (\exists v_~a1~0_343 : int :: (v_~a1~0_343 <= 218 && a1 <= v_~a1~0_343 / 5 * 5 / 5 + 505228) && 0 == v_~a1~0_343 % 5)) && 9 == a19)) || ((a1 <= 589891 && !(9 == a19)) && 1 == a10) [2019-11-16 00:14:30,650 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((a19 == 8 && 56 <= a1) || (a19 <= 8 && !(a19 == 8))) || (a1 <= 589891 && ((218 < a1 && 14 == a4) && a12 == 0) && 1 == a10)) || ((((14 == a4 && !(1 == a10)) && a12 == 0) && 9 == a19) && a10 <= 2)) || (a19 == 8 && !(a10 == 4))) || ((a10 == 0 && !(9 == a19)) && a1 <= 218)) || (a19 == 8 && (\exists v_~a1~0_346 : int :: ((0 <= 9 * v_~a1~0_346 && 218 < v_~a1~0_346) && v_~a1~0_346 <= 589891) && a1 + 545163 <= v_~a1~0_346 * 9 / 10))) || ((((a10 == 3 && a1 <= 589891) && 14 == a4) && a12 == 0) && 9 == a19)) || ((((a1 <= 505232 && 14 == a4) && !(1 == a10)) && a12 == 0) && 9 == a19)) || (((14 == a4 && a12 == 0) && a1 + 13 <= 0) && 9 == a19)) || (((((14 == a4 && a10 <= 2) && a12 == 0) && 56 <= a1) && (\exists v_~a1~0_343 : int :: (v_~a1~0_343 <= 218 && a1 <= v_~a1~0_343 / 5 * 5 / 5 + 505228) && 0 == v_~a1~0_343 % 5)) && 9 == a19)) || ((a1 <= 589891 && !(9 == a19)) && 1 == a10) [2019-11-16 00:14:30,737 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5c52e805-2a1b-4156-ad49-bbed380d47dc/bin/uautomizer/witness.graphml [2019-11-16 00:14:30,737 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:14:30,739 INFO L168 Benchmark]: Toolchain (without parser) took 48469.60 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 934.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -206.0 MB). Peak memory consumption was 728.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:30,739 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:14:30,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:30,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:30,740 INFO L168 Benchmark]: Boogie Preprocessor took 93.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:30,740 INFO L168 Benchmark]: RCFGBuilder took 1255.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:30,741 INFO L168 Benchmark]: TraceAbstraction took 46258.65 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 757.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -151.7 MB). Peak memory consumption was 605.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:30,741 INFO L168 Benchmark]: Witness Printer took 172.97 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:14:30,743 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.48 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 597.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1255.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46258.65 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 757.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -151.7 MB). Peak memory consumption was 605.9 MB. Max. memory is 11.5 GB. * Witness Printer took 172.97 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 73]: 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: 582]: Loop Invariant [2019-11-16 00:14:30,751 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] Derived loop invariant: (((((((((((a19 == 8 && 56 <= a1) || (a19 <= 8 && !(a19 == 8))) || (a1 <= 589891 && ((218 < a1 && 14 == a4) && a12 == 0) && 1 == a10)) || ((((14 == a4 && !(1 == a10)) && a12 == 0) && 9 == a19) && a10 <= 2)) || (a19 == 8 && !(a10 == 4))) || ((a10 == 0 && !(9 == a19)) && a1 <= 218)) || (a19 == 8 && (\exists v_~a1~0_346 : int :: ((0 <= 9 * v_~a1~0_346 && 218 < v_~a1~0_346) && v_~a1~0_346 <= 589891) && a1 + 545163 <= v_~a1~0_346 * 9 / 10))) || ((((a10 == 3 && a1 <= 589891) && 14 == a4) && a12 == 0) && 9 == a19)) || ((((a1 <= 505232 && 14 == a4) && !(1 == a10)) && a12 == 0) && 9 == a19)) || (((14 == a4 && a12 == 0) && a1 + 13 <= 0) && 9 == a19)) || (((((14 == a4 && a10 <= 2) && a12 == 0) && 56 <= a1) && (\exists v_~a1~0_343 : int :: (v_~a1~0_343 <= 218 && a1 <= v_~a1~0_343 / 5 * 5 / 5 + 505228) && 0 == v_~a1~0_343 % 5)) && 9 == a19)) || ((a1 <= 589891 && !(9 == a19)) && 1 == a10) - InvariantResult [Line: 20]: Loop Invariant [2019-11-16 00:14:30,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-11-16 00:14:30,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] [2019-11-16 00:14:30,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_343,QUANTIFIED] Derived loop invariant: (((((((((((a19 == 8 && 56 <= a1) || (a19 <= 8 && !(a19 == 8))) || (a1 <= 589891 && ((218 < a1 && 14 == a4) && a12 == 0) && 1 == a10)) || ((((14 == a4 && !(1 == a10)) && a12 == 0) && 9 == a19) && a10 <= 2)) || (a19 == 8 && !(a10 == 4))) || ((a10 == 0 && !(9 == a19)) && a1 <= 218)) || (a19 == 8 && (\exists v_~a1~0_346 : int :: ((0 <= 9 * v_~a1~0_346 && 218 < v_~a1~0_346) && v_~a1~0_346 <= 589891) && a1 + 545163 <= v_~a1~0_346 * 9 / 10))) || ((((a10 == 3 && a1 <= 589891) && 14 == a4) && a12 == 0) && 9 == a19)) || ((((a1 <= 505232 && 14 == a4) && !(1 == a10)) && a12 == 0) && 9 == a19)) || (((14 == a4 && a12 == 0) && a1 + 13 <= 0) && 9 == a19)) || (((((14 == a4 && a10 <= 2) && a12 == 0) && 56 <= a1) && (\exists v_~a1~0_343 : int :: (v_~a1~0_343 <= 218 && a1 <= v_~a1~0_343 / 5 * 5 / 5 + 505228) && 0 == v_~a1~0_343 % 5)) && 9 == a19)) || ((a1 <= 589891 && !(9 == a19)) && 1 == a10) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Result: SAFE, OverallTime: 46.1s, OverallIterations: 13, TraceHistogramMax: 7, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.9s, HoareTripleCheckerStatistics: 1019 SDtfs, 4607 SDslu, 207 SDs, 0 SdLazy, 12232 SolverSat, 1745 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2444 GetRequests, 2367 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4174occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 6846 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 86 NumberOfFragments, 387 HoareAnnotationTreeSize, 3 FomulaSimplifications, 10726 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 48908 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 5944 NumberOfCodeBlocks, 5944 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5925 ConstructedInterpolants, 200 QuantifiedInterpolants, 11179190 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3162 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 5946/7489 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...