./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label59.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_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label59.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/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 30c34688967b08e009ee7c945b5c905ca7f15dd9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:02:01,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:02:01,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:02:01,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:02:01,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:02:01,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:02:01,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:02:01,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:02:01,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:02:01,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:02:01,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:02:01,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:02:01,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:02:01,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:02:01,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:02:01,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:02:01,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:02:01,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:02:01,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:02:01,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:02:01,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:02:01,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:02:01,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:02:01,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:02:01,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:02:01,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:02:01,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:02:01,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:02:01,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:02:01,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:02:01,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:02:01,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:02:01,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:02:01,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:02:01,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:02:01,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:02:01,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:02:01,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:02:01,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:02:01,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:02:01,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:02:01,305 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:02:01,319 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:02:01,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:02:01,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:02:01,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:02:01,321 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:02:01,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:02:01,321 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:02:01,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:02:01,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:02:01,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:02:01,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:02:01,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:02:01,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:02:01,323 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:02:01,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:02:01,323 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:02:01,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:02:01,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:02:01,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:02:01,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:02:01,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:02:01,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:02:01,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:02:01,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:02:01,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:02:01,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:02:01,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:02:01,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:02:01,327 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_6937aeb3-0a9d-49d3-b64a-5ad516454cab/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 -> 30c34688967b08e009ee7c945b5c905ca7f15dd9 [2019-11-16 00:02:01,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:02:01,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:02:01,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:02:01,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:02:01,367 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:02:01,368 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label59.c [2019-11-16 00:02:01,427 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/data/8738957ea/13aa3be462a3481baf5e3a5ac7c59cd2/FLAGa36f77679 [2019-11-16 00:02:01,967 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:02:01,967 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/sv-benchmarks/c/eca-rers2012/Problem15_label59.c [2019-11-16 00:02:01,989 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/data/8738957ea/13aa3be462a3481baf5e3a5ac7c59cd2/FLAGa36f77679 [2019-11-16 00:02:02,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/data/8738957ea/13aa3be462a3481baf5e3a5ac7c59cd2 [2019-11-16 00:02:02,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:02:02,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:02:02,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:02:02,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:02:02,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:02:02,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:02" (1/1) ... [2019-11-16 00:02:02,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6807562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02, skipping insertion in model container [2019-11-16 00:02:02,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:02" (1/1) ... [2019-11-16 00:02:02,193 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:02:02,280 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:02:03,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:02:03,071 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:02:03,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:02:03,361 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:02:03,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:03 WrapperNode [2019-11-16 00:02:03,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:02:03,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:02:03,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:02:03,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:02:03,371 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:02:03" (1/1) ... [2019-11-16 00:02:03,408 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:02:03" (1/1) ... [2019-11-16 00:02:03,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:02:03,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:02:03,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:02:03,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:02:03,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:03" (1/1) ... [2019-11-16 00:02:03,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:03" (1/1) ... [2019-11-16 00:02:03,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:03" (1/1) ... [2019-11-16 00:02:03,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:03" (1/1) ... [2019-11-16 00:02:03,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:03" (1/1) ... [2019-11-16 00:02:03,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:03" (1/1) ... [2019-11-16 00:02:03,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:03" (1/1) ... [2019-11-16 00:02:03,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:02:03,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:02:03,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:02:03,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:02:03,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/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:02:03,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:02:03,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:02:07,292 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:02:07,292 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:02:07,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:07 BoogieIcfgContainer [2019-11-16 00:02:07,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:02:07,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:02:07,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:02:07,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:02:07,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:02:02" (1/3) ... [2019-11-16 00:02:07,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623f7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:07, skipping insertion in model container [2019-11-16 00:02:07,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:03" (2/3) ... [2019-11-16 00:02:07,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623f7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:07, skipping insertion in model container [2019-11-16 00:02:07,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:07" (3/3) ... [2019-11-16 00:02:07,305 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label59.c [2019-11-16 00:02:07,314 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:02:07,324 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:02:07,335 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:02:07,373 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:02:07,373 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:02:07,373 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:02:07,373 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:02:07,373 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:02:07,374 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:02:07,374 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:02:07,375 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:02:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-16 00:02:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:02:07,413 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:07,414 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:07,415 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:07,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:07,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1425694346, now seen corresponding path program 1 times [2019-11-16 00:02:07,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:07,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164404327] [2019-11-16 00:02:07,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:07,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:07,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:07,711 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:02:07,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164404327] [2019-11-16 00:02:07,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:07,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:07,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155987553] [2019-11-16 00:02:07,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:07,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:07,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:07,733 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-16 00:02:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:11,682 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2019-11-16 00:02:11,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:11,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-16 00:02:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:11,725 INFO L225 Difference]: With dead ends: 1514 [2019-11-16 00:02:11,729 INFO L226 Difference]: Without dead ends: 1008 [2019-11-16 00:02:11,740 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:02:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-11-16 00:02:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2019-11-16 00:02:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-16 00:02:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2019-11-16 00:02:11,847 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 54 [2019-11-16 00:02:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:11,848 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2019-11-16 00:02:11,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2019-11-16 00:02:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-16 00:02:11,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:11,858 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:02:11,859 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:11,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:11,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1246806213, now seen corresponding path program 1 times [2019-11-16 00:02:11,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:11,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319822262] [2019-11-16 00:02:11,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:11,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:11,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:12,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319822262] [2019-11-16 00:02:12,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:12,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:12,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064103769] [2019-11-16 00:02:12,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:02:12,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:12,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:02:12,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:12,113 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 5 states. [2019-11-16 00:02:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:16,477 INFO L93 Difference]: Finished difference Result 2303 states and 3981 transitions. [2019-11-16 00:02:16,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:02:16,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-11-16 00:02:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:16,487 INFO L225 Difference]: With dead ends: 2303 [2019-11-16 00:02:16,489 INFO L226 Difference]: Without dead ends: 1628 [2019-11-16 00:02:16,491 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:02:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2019-11-16 00:02:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 989. [2019-11-16 00:02:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-11-16 00:02:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1597 transitions. [2019-11-16 00:02:16,519 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1597 transitions. Word has length 119 [2019-11-16 00:02:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:16,520 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 1597 transitions. [2019-11-16 00:02:16,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:02:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1597 transitions. [2019-11-16 00:02:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-16 00:02:16,524 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:16,525 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:02:16,525 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:16,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash -214871010, now seen corresponding path program 1 times [2019-11-16 00:02:16,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:16,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027875251] [2019-11-16 00:02:16,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:16,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:16,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:16,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027875251] [2019-11-16 00:02:16,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:16,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:16,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265201132] [2019-11-16 00:02:16,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:16,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:16,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:16,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:16,706 INFO L87 Difference]: Start difference. First operand 989 states and 1597 transitions. Second operand 4 states. [2019-11-16 00:02:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:20,071 INFO L93 Difference]: Finished difference Result 3777 states and 6149 transitions. [2019-11-16 00:02:20,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:20,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-16 00:02:20,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:20,088 INFO L225 Difference]: With dead ends: 3777 [2019-11-16 00:02:20,088 INFO L226 Difference]: Without dead ends: 2790 [2019-11-16 00:02:20,091 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:02:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2019-11-16 00:02:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1886. [2019-11-16 00:02:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2019-11-16 00:02:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2633 transitions. [2019-11-16 00:02:20,140 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2633 transitions. Word has length 120 [2019-11-16 00:02:20,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:20,142 INFO L462 AbstractCegarLoop]: Abstraction has 1886 states and 2633 transitions. [2019-11-16 00:02:20,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2633 transitions. [2019-11-16 00:02:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-16 00:02:20,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:20,149 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:02:20,149 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:20,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:20,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1115564308, now seen corresponding path program 1 times [2019-11-16 00:02:20,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:20,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500046957] [2019-11-16 00:02:20,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:20,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:20,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:20,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500046957] [2019-11-16 00:02:20,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:20,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:20,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170591417] [2019-11-16 00:02:20,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:20,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:20,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:20,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:20,265 INFO L87 Difference]: Start difference. First operand 1886 states and 2633 transitions. Second operand 4 states. [2019-11-16 00:02:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:23,436 INFO L93 Difference]: Finished difference Result 7368 states and 10298 transitions. [2019-11-16 00:02:23,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:23,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-16 00:02:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:23,465 INFO L225 Difference]: With dead ends: 7368 [2019-11-16 00:02:23,466 INFO L226 Difference]: Without dead ends: 5484 [2019-11-16 00:02:23,469 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:02:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2019-11-16 00:02:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5180. [2019-11-16 00:02:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2019-11-16 00:02:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 6692 transitions. [2019-11-16 00:02:23,561 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 6692 transitions. Word has length 124 [2019-11-16 00:02:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:23,562 INFO L462 AbstractCegarLoop]: Abstraction has 5180 states and 6692 transitions. [2019-11-16 00:02:23,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 6692 transitions. [2019-11-16 00:02:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-16 00:02:23,563 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:23,564 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:02:23,564 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1684612182, now seen corresponding path program 1 times [2019-11-16 00:02:23,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:23,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535279235] [2019-11-16 00:02:23,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:23,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:23,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:23,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535279235] [2019-11-16 00:02:23,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:23,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:23,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614885301] [2019-11-16 00:02:23,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:23,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:23,673 INFO L87 Difference]: Start difference. First operand 5180 states and 6692 transitions. Second operand 4 states. [2019-11-16 00:02:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:26,255 INFO L93 Difference]: Finished difference Result 17833 states and 23134 transitions. [2019-11-16 00:02:26,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:26,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-16 00:02:26,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:26,288 INFO L225 Difference]: With dead ends: 17833 [2019-11-16 00:02:26,288 INFO L226 Difference]: Without dead ends: 8469 [2019-11-16 00:02:26,298 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:02:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2019-11-16 00:02:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 8469. [2019-11-16 00:02:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8469 states. [2019-11-16 00:02:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8469 states to 8469 states and 9448 transitions. [2019-11-16 00:02:26,462 INFO L78 Accepts]: Start accepts. Automaton has 8469 states and 9448 transitions. Word has length 145 [2019-11-16 00:02:26,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:26,463 INFO L462 AbstractCegarLoop]: Abstraction has 8469 states and 9448 transitions. [2019-11-16 00:02:26,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 8469 states and 9448 transitions. [2019-11-16 00:02:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-11-16 00:02:26,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:26,467 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:26,468 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:26,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1210416382, now seen corresponding path program 1 times [2019-11-16 00:02:26,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:26,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938295095] [2019-11-16 00:02:26,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:26,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:26,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:26,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938295095] [2019-11-16 00:02:26,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:26,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:26,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293782598] [2019-11-16 00:02:26,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:02:26,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:26,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:02:26,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:26,793 INFO L87 Difference]: Start difference. First operand 8469 states and 9448 transitions. Second operand 5 states. [2019-11-16 00:02:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:29,198 INFO L93 Difference]: Finished difference Result 20244 states and 22382 transitions. [2019-11-16 00:02:29,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:02:29,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 287 [2019-11-16 00:02:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:29,236 INFO L225 Difference]: With dead ends: 20244 [2019-11-16 00:02:29,237 INFO L226 Difference]: Without dead ends: 11179 [2019-11-16 00:02:29,243 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:02:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11179 states. [2019-11-16 00:02:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11179 to 9667. [2019-11-16 00:02:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9667 states. [2019-11-16 00:02:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9667 states to 9667 states and 10707 transitions. [2019-11-16 00:02:29,412 INFO L78 Accepts]: Start accepts. Automaton has 9667 states and 10707 transitions. Word has length 287 [2019-11-16 00:02:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:29,413 INFO L462 AbstractCegarLoop]: Abstraction has 9667 states and 10707 transitions. [2019-11-16 00:02:29,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:02:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9667 states and 10707 transitions. [2019-11-16 00:02:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-16 00:02:29,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:29,419 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:29,419 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:29,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1076396748, now seen corresponding path program 1 times [2019-11-16 00:02:29,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:29,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139062765] [2019-11-16 00:02:29,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:29,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:29,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:30,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139062765] [2019-11-16 00:02:30,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099439964] [2019-11-16 00:02:30,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/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:02:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:30,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:02:30,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:30,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:02:30,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-16 00:02:30,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878999916] [2019-11-16 00:02:30,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:02:30,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:30,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:02:30,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:02:30,572 INFO L87 Difference]: Start difference. First operand 9667 states and 10707 transitions. Second operand 3 states. [2019-11-16 00:02:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:31,854 INFO L93 Difference]: Finished difference Result 19034 states and 21112 transitions. [2019-11-16 00:02:31,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:02:31,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-11-16 00:02:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:31,875 INFO L225 Difference]: With dead ends: 19034 [2019-11-16 00:02:31,875 INFO L226 Difference]: Without dead ends: 9668 [2019-11-16 00:02:31,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 324 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:02:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9668 states. [2019-11-16 00:02:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9668 to 9665. [2019-11-16 00:02:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9665 states. [2019-11-16 00:02:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9665 states to 9665 states and 10555 transitions. [2019-11-16 00:02:32,042 INFO L78 Accepts]: Start accepts. Automaton has 9665 states and 10555 transitions. Word has length 324 [2019-11-16 00:02:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:32,044 INFO L462 AbstractCegarLoop]: Abstraction has 9665 states and 10555 transitions. [2019-11-16 00:02:32,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:02:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9665 states and 10555 transitions. [2019-11-16 00:02:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-11-16 00:02:32,061 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:32,062 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:32,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:32,265 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:32,266 INFO L82 PathProgramCache]: Analyzing trace with hash -864696258, now seen corresponding path program 1 times [2019-11-16 00:02:32,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:32,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311983744] [2019-11-16 00:02:32,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:32,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:32,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2019-11-16 00:02:33,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311983744] [2019-11-16 00:02:33,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:33,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:33,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755740006] [2019-11-16 00:02:33,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:02:33,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:33,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:02:33,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:33,163 INFO L87 Difference]: Start difference. First operand 9665 states and 10555 transitions. Second operand 5 states. [2019-11-16 00:02:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:35,010 INFO L93 Difference]: Finished difference Result 19629 states and 21436 transitions. [2019-11-16 00:02:35,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:35,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 505 [2019-11-16 00:02:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:35,028 INFO L225 Difference]: With dead ends: 19629 [2019-11-16 00:02:35,028 INFO L226 Difference]: Without dead ends: 10265 [2019-11-16 00:02:35,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:02:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10265 states. [2019-11-16 00:02:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10265 to 10263. [2019-11-16 00:02:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10263 states. [2019-11-16 00:02:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10263 states to 10263 states and 11158 transitions. [2019-11-16 00:02:35,164 INFO L78 Accepts]: Start accepts. Automaton has 10263 states and 11158 transitions. Word has length 505 [2019-11-16 00:02:35,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:35,164 INFO L462 AbstractCegarLoop]: Abstraction has 10263 states and 11158 transitions. [2019-11-16 00:02:35,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:02:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 10263 states and 11158 transitions. [2019-11-16 00:02:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-11-16 00:02:35,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:35,186 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:35,186 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:35,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:35,187 INFO L82 PathProgramCache]: Analyzing trace with hash 535763756, now seen corresponding path program 1 times [2019-11-16 00:02:35,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:35,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795176420] [2019-11-16 00:02:35,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:35,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:35,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 435 proven. 70 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-16 00:02:36,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795176420] [2019-11-16 00:02:36,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626390508] [2019-11-16 00:02:36,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/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:02:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:36,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:02:36,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:36,802 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-11-16 00:02:36,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:02:36,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-16 00:02:36,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346339133] [2019-11-16 00:02:36,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:02:36,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:36,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:02:36,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:02:36,806 INFO L87 Difference]: Start difference. First operand 10263 states and 11158 transitions. Second operand 3 states. [2019-11-16 00:02:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:37,860 INFO L93 Difference]: Finished difference Result 23217 states and 25265 transitions. [2019-11-16 00:02:37,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:02:37,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 579 [2019-11-16 00:02:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:37,880 INFO L225 Difference]: With dead ends: 23217 [2019-11-16 00:02:37,881 INFO L226 Difference]: Without dead ends: 13255 [2019-11-16 00:02:37,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 579 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:02:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13255 states. [2019-11-16 00:02:38,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13255 to 13252. [2019-11-16 00:02:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13252 states. [2019-11-16 00:02:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13252 states to 13252 states and 14238 transitions. [2019-11-16 00:02:38,044 INFO L78 Accepts]: Start accepts. Automaton has 13252 states and 14238 transitions. Word has length 579 [2019-11-16 00:02:38,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:38,044 INFO L462 AbstractCegarLoop]: Abstraction has 13252 states and 14238 transitions. [2019-11-16 00:02:38,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:02:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 13252 states and 14238 transitions. [2019-11-16 00:02:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2019-11-16 00:02:38,066 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:38,067 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:38,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:38,279 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash 112753897, now seen corresponding path program 1 times [2019-11-16 00:02:38,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:38,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899827701] [2019-11-16 00:02:38,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:38,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:38,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 462 proven. 133 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-16 00:02:39,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899827701] [2019-11-16 00:02:39,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011653701] [2019-11-16 00:02:39,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/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:02:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:39,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:02:39,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-11-16 00:02:39,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:02:39,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-16 00:02:39,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974296406] [2019-11-16 00:02:39,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:02:39,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:39,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:02:39,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:02:39,677 INFO L87 Difference]: Start difference. First operand 13252 states and 14238 transitions. Second operand 3 states. [2019-11-16 00:02:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:40,714 INFO L93 Difference]: Finished difference Result 25907 states and 27873 transitions. [2019-11-16 00:02:40,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:02:40,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 587 [2019-11-16 00:02:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:40,873 INFO L225 Difference]: With dead ends: 25907 [2019-11-16 00:02:40,873 INFO L226 Difference]: Without dead ends: 13255 [2019-11-16 00:02:40,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 588 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:02:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13255 states. [2019-11-16 00:02:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13255 to 12654. [2019-11-16 00:02:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12654 states. [2019-11-16 00:02:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12654 states to 12654 states and 13391 transitions. [2019-11-16 00:02:41,008 INFO L78 Accepts]: Start accepts. Automaton has 12654 states and 13391 transitions. Word has length 587 [2019-11-16 00:02:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:41,009 INFO L462 AbstractCegarLoop]: Abstraction has 12654 states and 13391 transitions. [2019-11-16 00:02:41,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:02:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 12654 states and 13391 transitions. [2019-11-16 00:02:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2019-11-16 00:02:41,020 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:41,021 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:41,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:41,228 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:41,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:41,228 INFO L82 PathProgramCache]: Analyzing trace with hash -637061868, now seen corresponding path program 1 times [2019-11-16 00:02:41,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:41,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860809925] [2019-11-16 00:02:41,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:41,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:41,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-11-16 00:02:41,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860809925] [2019-11-16 00:02:41,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:41,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:41,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026571138] [2019-11-16 00:02:41,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:41,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:41,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:41,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:41,728 INFO L87 Difference]: Start difference. First operand 12654 states and 13391 transitions. Second operand 4 states. [2019-11-16 00:02:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:43,503 INFO L93 Difference]: Finished difference Result 27103 states and 28751 transitions. [2019-11-16 00:02:43,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:43,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 634 [2019-11-16 00:02:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:43,515 INFO L225 Difference]: With dead ends: 27103 [2019-11-16 00:02:43,515 INFO L226 Difference]: Without dead ends: 15049 [2019-11-16 00:02:43,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:02:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15049 states. [2019-11-16 00:02:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15049 to 13549. [2019-11-16 00:02:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13549 states. [2019-11-16 00:02:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13549 states to 13549 states and 14130 transitions. [2019-11-16 00:02:43,662 INFO L78 Accepts]: Start accepts. Automaton has 13549 states and 14130 transitions. Word has length 634 [2019-11-16 00:02:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:43,663 INFO L462 AbstractCegarLoop]: Abstraction has 13549 states and 14130 transitions. [2019-11-16 00:02:43,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 13549 states and 14130 transitions. [2019-11-16 00:02:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2019-11-16 00:02:43,673 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:43,673 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:43,674 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:43,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:43,674 INFO L82 PathProgramCache]: Analyzing trace with hash 434787481, now seen corresponding path program 1 times [2019-11-16 00:02:43,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:43,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152511574] [2019-11-16 00:02:43,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:43,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:43,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 534 proven. 191 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:02:44,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152511574] [2019-11-16 00:02:44,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940404649] [2019-11-16 00:02:44,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/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:02:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:44,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:02:44,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:44,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:02:44,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:44,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:44,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:44,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:44,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:44,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:02:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 638 proven. 87 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:02:45,547 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:45,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-11-16 00:02:45,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924647878] [2019-11-16 00:02:45,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:02:45,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:45,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:02:45,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:02:45,552 INFO L87 Difference]: Start difference. First operand 13549 states and 14130 transitions. Second operand 9 states. [2019-11-16 00:03:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:00,507 INFO L93 Difference]: Finished difference Result 43591 states and 45334 transitions. [2019-11-16 00:03:00,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-16 00:03:00,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 670 [2019-11-16 00:03:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:00,533 INFO L225 Difference]: With dead ends: 43591 [2019-11-16 00:03:00,534 INFO L226 Difference]: Without dead ends: 30943 [2019-11-16 00:03:00,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 696 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=972, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:03:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2019-11-16 00:03:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 20433. [2019-11-16 00:03:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20433 states. [2019-11-16 00:03:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20433 states to 20433 states and 21158 transitions. [2019-11-16 00:03:00,753 INFO L78 Accepts]: Start accepts. Automaton has 20433 states and 21158 transitions. Word has length 670 [2019-11-16 00:03:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:00,754 INFO L462 AbstractCegarLoop]: Abstraction has 20433 states and 21158 transitions. [2019-11-16 00:03:00,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:03:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 20433 states and 21158 transitions. [2019-11-16 00:03:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2019-11-16 00:03:00,765 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:00,766 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:00,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:00,972 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1969280993, now seen corresponding path program 1 times [2019-11-16 00:03:00,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:00,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558937432] [2019-11-16 00:03:00,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:00,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:00,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 590 proven. 106 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-11-16 00:03:02,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558937432] [2019-11-16 00:03:02,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607945938] [2019-11-16 00:03:02,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/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:03:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:02,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:03:02,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:02,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:02,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:04,756 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= (+ c_~a4~0 86) 0)) (.cse3 (= 1 c_~a2~0))) (or (and (exists ((v_~a0~0_825 Int)) (let ((.cse1 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse0 4) 5))) (<= 278887 .cse0) (< .cse1 0) (<= c_~a0~0 (+ (div (+ .cse0 (- 278886)) 5) 1)) (not (= (mod .cse1 5) 0)) (< .cse0 278886))))) .cse2 .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse5 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse4 278887) (not (= (mod (+ .cse4 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse4 4) 5))) (< .cse5 0) (<= c_~a0~0 (+ (div (+ .cse4 (- 278886)) 5) 1)) (not (= (mod .cse5 5) 0)) (< .cse4 278886)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse7 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse6 (div .cse7 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse6 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (< .cse7 0) (<= c_~a0~0 (div (+ .cse6 (- 278886)) 5)) (<= 278886 .cse6) (not (= (mod .cse7 5) 0)))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse9 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse8 4) 5))) (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (<= 278887 .cse8) (= (mod .cse9 5) 0) (< .cse8 278886))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse11 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse10 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse10 (- 278887)) 5)) (<= 0 .cse11) (<= 278886 .cse10)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse13 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse12 278887) (not (= (mod (+ .cse12 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (+ (div (+ .cse12 (- 278887)) 5) 1)) (= (mod .cse13 5) 0) (<= 278886 .cse12)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse15 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse14 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse14 4) 5))) (<= c_~a0~0 (div (+ .cse14 (- 278887)) 5)) (<= 0 .cse15) (< .cse14 278886))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse17 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse16 278887) (not (= (mod (+ .cse16 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse16 4) 5)) (< .cse17 0) (<= c_~a0~0 (div (+ .cse16 (- 278886)) 5)) (not (= (mod .cse17 5) 0)))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse19 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse18 (div .cse19 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse18 278887) (not (= (mod (+ .cse18 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse18 4) 5))) (<= c_~a0~0 (+ (div (+ .cse18 (- 278887)) 5) 1)) (<= 0 .cse19) (< .cse18 278886))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse21 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse20 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse20 4) 5)) (< .cse21 0) (<= c_~a0~0 (div (+ .cse20 (- 278886)) 5)) (not (= (mod .cse21 5) 0)))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse23 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse22 (div .cse23 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse22 278887) (not (= (mod (+ .cse22 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse22 4) 5))) (<= c_~a0~0 (+ (div (+ .cse22 (- 278887)) 5) 1)) (= (mod .cse23 5) 0) (< .cse22 278886)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse25 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse24 278887) (not (= (mod (+ .cse24 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse24 4) 5)) (<= c_~a0~0 (+ (div (+ .cse24 (- 278887)) 5) 1)) (= (mod .cse25 5) 0)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse27 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse26 (div .cse27 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse26 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse26 4) 5))) (<= c_~a0~0 (div (+ .cse26 (- 278887)) 5)) (= (mod .cse27 5) 0) (< .cse26 278886)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse29 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse28 (div .cse29 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse28 4) 5)) (<= 278887 .cse28) (< .cse29 0) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)) (not (= (mod .cse29 5) 0))))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse31 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse30 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse30 4) 5))) (< .cse31 0) (<= c_~a0~0 (+ (div (+ .cse30 (- 278886)) 5) 1)) (not (= (mod .cse31 5) 0)) (< .cse30 278886))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse33 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse32 (div .cse33 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse32 278887) (not (= (mod (+ .cse32 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (< .cse33 0) (<= c_~a0~0 (div (+ .cse32 (- 278886)) 5)) (<= 278886 .cse32) (not (= (mod .cse33 5) 0))))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse35 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse34 (div .cse35 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse34 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse34 4) 5)) (<= c_~a0~0 (div (+ .cse34 (- 278887)) 5)) (= (mod .cse35 5) 0)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse37 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse36 4) 5))) (<= c_~a0~0 (div (+ .cse36 (- 278887)) 5)) (<= 278887 .cse36) (<= 0 .cse37) (< .cse36 278886)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse39 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse38 (div .cse39 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse38 4) 5)) (<= c_~a0~0 (div (+ .cse38 (- 278887)) 5)) (<= 278887 .cse38) (= (mod .cse39 5) 0))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse41 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse40 (div .cse41 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse40 278887) (not (= (mod (+ .cse40 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse40 4) 5)) (<= c_~a0~0 (+ (div (+ .cse40 (- 278887)) 5) 1)) (<= 0 .cse41)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse43 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse42 (- 278887)) 5)) (<= 278887 .cse42) (<= 0 .cse43) (<= 278886 .cse42))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse45 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= 278887 .cse44) (< .cse45 0) (<= c_~a0~0 (div (+ .cse44 (- 278886)) 5)) (<= 278886 .cse44) (not (= (mod .cse45 5) 0))))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse47 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse46 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse46 4) 5)) (<= c_~a0~0 (div (+ .cse46 (- 278887)) 5)) (<= 0 .cse47))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse49 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse48 278887) (not (= (mod (+ .cse48 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (+ (div (+ .cse48 (- 278887)) 5) 1)) (<= 0 .cse49) (<= 278886 .cse48)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse51 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse50 (div .cse51 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse50 4) 5)) (<= c_~a0~0 (div (+ .cse50 (- 278887)) 5)) (<= 278887 .cse50) (<= 0 .cse51)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse53 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse52 (div .cse53 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse52 (- 278887)) 5)) (<= 278887 .cse52) (= (mod .cse53 5) 0) (<= 278886 .cse52)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse55 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse54 (div .cse55 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse54 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse54 (- 278887)) 5)) (= (mod .cse55 5) 0) (<= 278886 .cse54)))))))) is different from false [2019-11-16 00:03:06,814 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= (+ c_~a4~0 86) 0)) (.cse3 (= 1 c_~a2~0))) (or (and (exists ((v_~a0~0_825 Int)) (let ((.cse1 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse0 4) 5))) (<= 278887 .cse0) (< .cse1 0) (<= c_~a0~0 (+ (div (+ .cse0 (- 278886)) 5) 1)) (not (= (mod .cse1 5) 0)) (< .cse0 278886))))) .cse2 .cse3) (and .cse2 .cse3 (exists ((v_prenex_2 Int)) (let ((.cse5 (div (* v_prenex_2 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (< 0 (+ v_prenex_2 147)) (<= (+ v_prenex_2 98) 0) (= (mod (+ .cse4 3) 5) 0) (<= 278886 .cse4) (<= (* 250 v_prenex_2) 0) (<= c_~a0~0 (div (+ .cse4 (- 278886)) 5)) (< .cse5 0) (not (= (mod .cse5 5) 0))))))) (and .cse2 (exists ((v_prenex_13 Int)) (let ((.cse7 (div (* v_prenex_13 (- 250)) 9))) (let ((.cse6 (div .cse7 5))) (and (<= c_~a0~0 (div (+ .cse6 (- 278886)) 5)) (<= (+ v_prenex_13 98) 0) (< 0 (+ v_prenex_13 147)) (= 0 (mod (+ .cse6 4) 5)) (<= (* 250 v_prenex_13) 0) (< .cse7 0) (not (= (mod .cse7 5) 0)) (<= 278887 .cse6))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (div (* v_prenex_1 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (not (= 0 (mod (+ .cse8 4) 5))) (<= c_~a0~0 (+ (div (+ .cse8 (- 278886)) 5) 1)) (<= (* 250 v_prenex_1) 0) (<= (+ v_prenex_1 98) 0) (not (= (mod .cse9 5) 0)) (< .cse8 278886) (< 0 (+ v_prenex_1 147)) (< .cse8 278887) (not (= (mod (+ .cse8 3) 5) 0)) (< .cse9 0)))))) (and .cse2 .cse3 (exists ((v_prenex_5 Int)) (let ((.cse11 (div (* v_prenex_5 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (<= 278886 .cse10) (<= (+ v_prenex_5 98) 0) (<= (* 250 v_prenex_5) 0) (< .cse10 278887) (<= c_~a0~0 (+ (div (+ .cse10 (- 278887)) 5) 1)) (= (mod .cse11 5) 0) (< 0 (+ v_prenex_5 147)) (not (= (mod (+ .cse10 3) 5) 0))))))) (and .cse2 (exists ((v_prenex_3 Int)) (let ((.cse13 (div (* v_prenex_3 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (< .cse12 278886) (<= (* 250 v_prenex_3) 0) (not (= 0 (mod (+ .cse12 4) 5))) (<= (+ v_prenex_3 98) 0) (<= 278887 .cse12) (< 0 (+ v_prenex_3 147)) (= (mod .cse13 5) 0) (<= c_~a0~0 (div (+ .cse12 (- 278887)) 5)))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_18 Int)) (let ((.cse15 (div (* v_prenex_18 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (< 0 (+ v_prenex_18 147)) (<= 278887 .cse14) (= 0 (mod (+ .cse14 4) 5)) (<= c_~a0~0 (div (+ .cse14 (- 278887)) 5)) (<= (* 250 v_prenex_18) 0) (= (mod .cse15 5) 0) (<= (+ v_prenex_18 98) 0)))))) (and .cse2 .cse3 (exists ((v_prenex_8 Int)) (let ((.cse17 (div (* v_prenex_8 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (<= (* 250 v_prenex_8) 0) (< .cse16 278887) (< .cse16 278886) (<= (+ v_prenex_8 98) 0) (<= 0 .cse17) (not (= 0 (mod (+ .cse16 4) 5))) (< 0 (+ v_prenex_8 147)) (not (= (mod (+ .cse16 3) 5) 0)) (<= c_~a0~0 (+ (div (+ .cse16 (- 278887)) 5) 1))))))) (and .cse2 .cse3 (exists ((v_prenex_9 Int)) (let ((.cse18 (div (* v_prenex_9 (- 250)) 9))) (let ((.cse19 (div .cse18 5))) (and (<= (+ v_prenex_9 98) 0) (not (= (mod .cse18 5) 0)) (< .cse18 0) (<= (* 250 v_prenex_9) 0) (= (mod (+ .cse19 3) 5) 0) (< 0 (+ v_prenex_9 147)) (= 0 (mod (+ .cse19 4) 5)) (<= c_~a0~0 (div (+ .cse19 (- 278886)) 5))))))) (and .cse2 .cse3 (exists ((v_prenex_26 Int)) (let ((.cse21 (div (* v_prenex_26 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (< 0 (+ v_prenex_26 147)) (<= 278886 .cse20) (<= (+ v_prenex_26 98) 0) (<= (* 250 v_prenex_26) 0) (= (mod .cse21 5) 0) (<= c_~a0~0 (div (+ .cse20 (- 278887)) 5)) (= (mod (+ .cse20 3) 5) 0)))))) (and .cse2 (exists ((v_prenex_11 Int)) (let ((.cse22 (div (* v_prenex_11 (- 250)) 9))) (let ((.cse23 (div .cse22 5))) (and (= (mod .cse22 5) 0) (< 0 (+ v_prenex_11 147)) (<= (* 250 v_prenex_11) 0) (<= c_~a0~0 (+ (div (+ .cse23 (- 278887)) 5) 1)) (< .cse23 278887) (not (= (mod (+ .cse23 3) 5) 0)) (= 0 (mod (+ .cse23 4) 5)) (<= (+ v_prenex_11 98) 0))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_22 Int)) (let ((.cse25 (div (* v_prenex_22 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (<= (* 250 v_prenex_22) 0) (= 0 (mod (+ .cse24 4) 5)) (<= 0 .cse25) (< 0 (+ v_prenex_22 147)) (<= (+ v_prenex_22 98) 0) (<= c_~a0~0 (div (+ .cse24 (- 278887)) 5)) (= (mod (+ .cse24 3) 5) 0)))))) (and .cse2 .cse3 (exists ((v_prenex_12 Int)) (let ((.cse27 (div (* v_prenex_12 (- 250)) 9))) (let ((.cse26 (div .cse27 5))) (and (<= (* 250 v_prenex_12) 0) (<= c_~a0~0 (div (+ .cse26 (- 278887)) 5)) (not (= 0 (mod (+ .cse26 4) 5))) (= (mod (+ .cse26 3) 5) 0) (< 0 (+ v_prenex_12 147)) (< .cse26 278886) (= (mod .cse27 5) 0) (<= (+ v_prenex_12 98) 0)))))) (and .cse2 .cse3 (exists ((v_prenex_24 Int)) (let ((.cse28 (div (* v_prenex_24 (- 250)) 9))) (let ((.cse29 (div .cse28 5))) (and (<= 0 .cse28) (= 0 (mod (+ .cse29 4) 5)) (< 0 (+ v_prenex_24 147)) (<= c_~a0~0 (div (+ .cse29 (- 278887)) 5)) (<= (+ v_prenex_24 98) 0) (<= 278887 .cse29) (<= (* 250 v_prenex_24) 0)))))) (and .cse2 (exists ((v_prenex_20 Int)) (let ((.cse31 (div (* v_prenex_20 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (<= (+ v_prenex_20 98) 0) (<= c_~a0~0 (div (+ .cse30 (- 278887)) 5)) (< 0 (+ v_prenex_20 147)) (<= 278887 .cse30) (<= 278886 .cse30) (<= (* 250 v_prenex_20) 0) (<= 0 .cse31))))) .cse3) (and .cse2 (exists ((v_prenex_17 Int)) (let ((.cse32 (div (* v_prenex_17 (- 250)) 9))) (let ((.cse33 (div .cse32 5))) (and (<= 0 .cse32) (<= (+ v_prenex_17 98) 0) (< 0 (+ v_prenex_17 147)) (< .cse33 278886) (not (= 0 (mod (+ .cse33 4) 5))) (<= 278887 .cse33) (<= (* 250 v_prenex_17) 0) (<= c_~a0~0 (div (+ .cse33 (- 278887)) 5)))))) .cse3) (and .cse2 (exists ((v_prenex_23 Int)) (let ((.cse35 (div (* v_prenex_23 (- 250)) 9))) (let ((.cse34 (div .cse35 5))) (and (<= 278886 .cse34) (<= (* 250 v_prenex_23) 0) (<= (+ v_prenex_23 98) 0) (not (= (mod (+ .cse34 3) 5) 0)) (<= c_~a0~0 (+ (div (+ .cse34 (- 278887)) 5) 1)) (< 0 (+ v_prenex_23 147)) (< .cse34 278887) (<= 0 .cse35))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_14 Int)) (let ((.cse37 (div (* v_prenex_14 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (= (mod (+ .cse36 3) 5) 0) (not (= (mod .cse37 5) 0)) (<= c_~a0~0 (+ (div (+ .cse36 (- 278886)) 5) 1)) (<= (+ v_prenex_14 98) 0) (< 0 (+ v_prenex_14 147)) (not (= 0 (mod (+ .cse36 4) 5))) (<= (* 250 v_prenex_14) 0) (< .cse36 278886) (< .cse37 0)))))) (and .cse2 .cse3 (exists ((v_prenex_7 Int)) (let ((.cse38 (div (* v_prenex_7 (- 250)) 9))) (let ((.cse39 (div .cse38 5))) (and (< .cse38 0) (= 0 (mod (+ .cse39 4) 5)) (not (= (mod (+ .cse39 3) 5) 0)) (<= (* 250 v_prenex_7) 0) (<= (+ v_prenex_7 98) 0) (not (= (mod .cse38 5) 0)) (< 0 (+ v_prenex_7 147)) (< .cse39 278887) (<= c_~a0~0 (div (+ .cse39 (- 278886)) 5))))))) (and .cse2 .cse3 (exists ((v_prenex_15 Int)) (let ((.cse40 (div (* v_prenex_15 (- 250)) 9))) (let ((.cse41 (div .cse40 5))) (and (not (= (mod .cse40 5) 0)) (< .cse41 278887) (< 0 (+ v_prenex_15 147)) (<= 278886 .cse41) (not (= (mod (+ .cse41 3) 5) 0)) (<= c_~a0~0 (div (+ .cse41 (- 278886)) 5)) (< .cse40 0) (<= (* 250 v_prenex_15) 0) (<= (+ v_prenex_15 98) 0)))))) (and .cse2 .cse3 (exists ((v_prenex_19 Int)) (let ((.cse43 (div (* v_prenex_19 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (<= (+ v_prenex_19 98) 0) (<= c_~a0~0 (+ (div (+ .cse42 (- 278887)) 5) 1)) (< .cse42 278887) (<= 0 .cse43) (<= (* 250 v_prenex_19) 0) (= 0 (mod (+ .cse42 4) 5)) (< 0 (+ v_prenex_19 147)) (not (= (mod (+ .cse42 3) 5) 0))))))) (and .cse2 .cse3 (exists ((v_prenex_10 Int)) (let ((.cse45 (div (* v_prenex_10 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (< .cse44 278887) (<= c_~a0~0 (+ (div (+ .cse44 (- 278887)) 5) 1)) (<= (* 250 v_prenex_10) 0) (<= (+ v_prenex_10 98) 0) (not (= 0 (mod (+ .cse44 4) 5))) (< .cse44 278886) (= (mod .cse45 5) 0) (not (= (mod (+ .cse44 3) 5) 0)) (< 0 (+ v_prenex_10 147))))))) (and .cse2 (exists ((v_prenex_16 Int)) (let ((.cse47 (div (* v_prenex_16 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (= (mod (+ .cse46 3) 5) 0) (< 0 (+ v_prenex_16 147)) (= (mod .cse47 5) 0) (<= (+ v_prenex_16 98) 0) (= 0 (mod (+ .cse46 4) 5)) (<= (* 250 v_prenex_16) 0) (<= c_~a0~0 (div (+ .cse46 (- 278887)) 5)))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_6 Int)) (let ((.cse49 (div (* v_prenex_6 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (not (= 0 (mod (+ .cse48 4) 5))) (< 0 (+ v_prenex_6 147)) (<= (+ v_prenex_6 98) 0) (= (mod (+ .cse48 3) 5) 0) (<= c_~a0~0 (div (+ .cse48 (- 278887)) 5)) (<= 0 .cse49) (<= (* 250 v_prenex_6) 0) (< .cse48 278886)))))) (and .cse2 (exists ((v_prenex_25 Int)) (let ((.cse50 (div (* v_prenex_25 (- 250)) 9))) (let ((.cse51 (div .cse50 5))) (and (<= (+ v_prenex_25 98) 0) (= (mod .cse50 5) 0) (< 0 (+ v_prenex_25 147)) (<= c_~a0~0 (div (+ .cse51 (- 278887)) 5)) (<= 278886 .cse51) (<= (* 250 v_prenex_25) 0) (<= 278887 .cse51))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_21 Int)) (let ((.cse53 (div (* v_prenex_21 (- 250)) 9))) (let ((.cse52 (div .cse53 5))) (and (<= (+ v_prenex_21 98) 0) (< 0 (+ v_prenex_21 147)) (<= 278886 .cse52) (< .cse53 0) (<= c_~a0~0 (div (+ .cse52 (- 278886)) 5)) (not (= (mod .cse53 5) 0)) (<= (* 250 v_prenex_21) 0) (<= 278887 .cse52)))))) (and .cse2 (exists ((v_prenex_4 Int)) (let ((.cse55 (div (* v_prenex_4 (- 250)) 9))) (let ((.cse54 (div .cse55 5))) (and (<= c_~a0~0 (div (+ .cse54 (- 278887)) 5)) (<= 0 .cse55) (< 0 (+ v_prenex_4 147)) (<= (+ v_prenex_4 98) 0) (<= 278886 .cse54) (= (mod (+ .cse54 3) 5) 0) (<= (* 250 v_prenex_4) 0))))) .cse3))) is different from false [2019-11-16 00:03:07,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 27 terms [2019-11-16 00:03:07,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:07,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 536 proven. 19 refuted. 0 times theorem prover too weak. 344 trivial. 33 not checked. [2019-11-16 00:03:15,425 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:15,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2019-11-16 00:03:15,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768137020] [2019-11-16 00:03:15,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:03:15,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:15,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:03:15,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=95, Unknown=2, NotChecked=42, Total=182 [2019-11-16 00:03:15,427 INFO L87 Difference]: Start difference. First operand 20433 states and 21158 transitions. Second operand 14 states. [2019-11-16 00:03:20,526 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse2 (<= (+ c_~a4~0 86) 0)) (.cse3 (= 1 c_~a2~0))) (or (and (exists ((v_~a0~0_825 Int)) (let ((.cse1 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse0 4) 5))) (<= 278887 .cse0) (< .cse1 0) (<= c_~a0~0 (+ (div (+ .cse0 (- 278886)) 5) 1)) (not (= (mod .cse1 5) 0)) (< .cse0 278886))))) .cse2 .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse5 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse4 278887) (not (= (mod (+ .cse4 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse4 4) 5))) (< .cse5 0) (<= c_~a0~0 (+ (div (+ .cse4 (- 278886)) 5) 1)) (not (= (mod .cse5 5) 0)) (< .cse4 278886)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse7 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse6 (div .cse7 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse6 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (< .cse7 0) (<= c_~a0~0 (div (+ .cse6 (- 278886)) 5)) (<= 278886 .cse6) (not (= (mod .cse7 5) 0)))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse9 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse8 4) 5))) (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (<= 278887 .cse8) (= (mod .cse9 5) 0) (< .cse8 278886))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse11 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse10 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse10 (- 278887)) 5)) (<= 0 .cse11) (<= 278886 .cse10)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse13 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse12 278887) (not (= (mod (+ .cse12 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (+ (div (+ .cse12 (- 278887)) 5) 1)) (= (mod .cse13 5) 0) (<= 278886 .cse12)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse15 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse14 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse14 4) 5))) (<= c_~a0~0 (div (+ .cse14 (- 278887)) 5)) (<= 0 .cse15) (< .cse14 278886))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse17 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse16 278887) (not (= (mod (+ .cse16 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse16 4) 5)) (< .cse17 0) (<= c_~a0~0 (div (+ .cse16 (- 278886)) 5)) (not (= (mod .cse17 5) 0)))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse19 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse18 (div .cse19 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse18 278887) (not (= (mod (+ .cse18 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse18 4) 5))) (<= c_~a0~0 (+ (div (+ .cse18 (- 278887)) 5) 1)) (<= 0 .cse19) (< .cse18 278886))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse21 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse20 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse20 4) 5)) (< .cse21 0) (<= c_~a0~0 (div (+ .cse20 (- 278886)) 5)) (not (= (mod .cse21 5) 0)))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse23 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse22 (div .cse23 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse22 278887) (not (= (mod (+ .cse22 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse22 4) 5))) (<= c_~a0~0 (+ (div (+ .cse22 (- 278887)) 5) 1)) (= (mod .cse23 5) 0) (< .cse22 278886)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse25 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse24 278887) (not (= (mod (+ .cse24 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse24 4) 5)) (<= c_~a0~0 (+ (div (+ .cse24 (- 278887)) 5) 1)) (= (mod .cse25 5) 0)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse27 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse26 (div .cse27 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse26 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse26 4) 5))) (<= c_~a0~0 (div (+ .cse26 (- 278887)) 5)) (= (mod .cse27 5) 0) (< .cse26 278886)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse29 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse28 (div .cse29 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse28 4) 5)) (<= 278887 .cse28) (< .cse29 0) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)) (not (= (mod .cse29 5) 0))))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse31 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse30 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse30 4) 5))) (< .cse31 0) (<= c_~a0~0 (+ (div (+ .cse30 (- 278886)) 5) 1)) (not (= (mod .cse31 5) 0)) (< .cse30 278886))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse33 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse32 (div .cse33 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse32 278887) (not (= (mod (+ .cse32 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (< .cse33 0) (<= c_~a0~0 (div (+ .cse32 (- 278886)) 5)) (<= 278886 .cse32) (not (= (mod .cse33 5) 0))))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse35 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse34 (div .cse35 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse34 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse34 4) 5)) (<= c_~a0~0 (div (+ .cse34 (- 278887)) 5)) (= (mod .cse35 5) 0)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse37 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse36 4) 5))) (<= c_~a0~0 (div (+ .cse36 (- 278887)) 5)) (<= 278887 .cse36) (<= 0 .cse37) (< .cse36 278886)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse39 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse38 (div .cse39 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse38 4) 5)) (<= c_~a0~0 (div (+ .cse38 (- 278887)) 5)) (<= 278887 .cse38) (= (mod .cse39 5) 0))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse41 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse40 (div .cse41 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse40 278887) (not (= (mod (+ .cse40 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse40 4) 5)) (<= c_~a0~0 (+ (div (+ .cse40 (- 278887)) 5) 1)) (<= 0 .cse41)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse43 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse42 (- 278887)) 5)) (<= 278887 .cse42) (<= 0 .cse43) (<= 278886 .cse42))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse45 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= 278887 .cse44) (< .cse45 0) (<= c_~a0~0 (div (+ .cse44 (- 278886)) 5)) (<= 278886 .cse44) (not (= (mod .cse45 5) 0))))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse47 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse46 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse46 4) 5)) (<= c_~a0~0 (div (+ .cse46 (- 278887)) 5)) (<= 0 .cse47))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse49 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse48 278887) (not (= (mod (+ .cse48 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (+ (div (+ .cse48 (- 278887)) 5) 1)) (<= 0 .cse49) (<= 278886 .cse48)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse51 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse50 (div .cse51 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse50 4) 5)) (<= c_~a0~0 (div (+ .cse50 (- 278887)) 5)) (<= 278887 .cse50) (<= 0 .cse51)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse53 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse52 (div .cse53 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse52 (- 278887)) 5)) (<= 278887 .cse52) (= (mod .cse53 5) 0) (<= 278886 .cse52)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse55 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse54 (div .cse55 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse54 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse54 (- 278887)) 5)) (= (mod .cse55 5) 0) (<= 278886 .cse54)))))))) (<= (+ c_~a29~0 144) 0) (not (= 3 c_~a2~0))) is different from false [2019-11-16 00:03:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:24,768 INFO L93 Difference]: Finished difference Result 48869 states and 50525 transitions. [2019-11-16 00:03:24,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:03:24,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 706 [2019-11-16 00:03:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:24,789 INFO L225 Difference]: With dead ends: 48869 [2019-11-16 00:03:24,789 INFO L226 Difference]: Without dead ends: 28737 [2019-11-16 00:03:24,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 705 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=62, Invalid=157, Unknown=3, NotChecked=84, Total=306 [2019-11-16 00:03:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28737 states. [2019-11-16 00:03:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28737 to 22827. [2019-11-16 00:03:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22827 states. [2019-11-16 00:03:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22827 states to 22827 states and 23624 transitions. [2019-11-16 00:03:25,009 INFO L78 Accepts]: Start accepts. Automaton has 22827 states and 23624 transitions. Word has length 706 [2019-11-16 00:03:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:25,009 INFO L462 AbstractCegarLoop]: Abstraction has 22827 states and 23624 transitions. [2019-11-16 00:03:25,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:03:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 22827 states and 23624 transitions. [2019-11-16 00:03:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2019-11-16 00:03:25,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:25,026 INFO L380 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 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, 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, 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] [2019-11-16 00:03:25,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:25,228 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:25,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1995279578, now seen corresponding path program 1 times [2019-11-16 00:03:25,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:25,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307045306] [2019-11-16 00:03:25,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:25,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:25,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-11-16 00:03:26,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307045306] [2019-11-16 00:03:26,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:26,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:26,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417982617] [2019-11-16 00:03:26,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:26,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:26,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:26,051 INFO L87 Difference]: Start difference. First operand 22827 states and 23624 transitions. Second operand 3 states. [2019-11-16 00:03:27,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:27,112 INFO L93 Difference]: Finished difference Result 37519 states and 38767 transitions. [2019-11-16 00:03:27,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:27,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 861 [2019-11-16 00:03:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:27,125 INFO L225 Difference]: With dead ends: 37519 [2019-11-16 00:03:27,125 INFO L226 Difference]: Without dead ends: 16490 [2019-11-16 00:03:27,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16490 states. [2019-11-16 00:03:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16490 to 15892. [2019-11-16 00:03:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15892 states. [2019-11-16 00:03:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15892 states to 15892 states and 16283 transitions. [2019-11-16 00:03:27,260 INFO L78 Accepts]: Start accepts. Automaton has 15892 states and 16283 transitions. Word has length 861 [2019-11-16 00:03:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:27,261 INFO L462 AbstractCegarLoop]: Abstraction has 15892 states and 16283 transitions. [2019-11-16 00:03:27,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 15892 states and 16283 transitions. [2019-11-16 00:03:27,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2019-11-16 00:03:27,272 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:27,273 INFO L380 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:27,273 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:27,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:27,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1791373101, now seen corresponding path program 1 times [2019-11-16 00:03:27,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:27,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107756776] [2019-11-16 00:03:27,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:27,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:27,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 1036 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2019-11-16 00:03:28,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107756776] [2019-11-16 00:03:28,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:28,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:28,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465704792] [2019-11-16 00:03:28,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:28,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:28,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:28,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:28,323 INFO L87 Difference]: Start difference. First operand 15892 states and 16283 transitions. Second operand 5 states. [2019-11-16 00:03:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:29,828 INFO L93 Difference]: Finished difference Result 32398 states and 33201 transitions. [2019-11-16 00:03:29,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:03:29,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 870 [2019-11-16 00:03:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:29,841 INFO L225 Difference]: With dead ends: 32398 [2019-11-16 00:03:29,841 INFO L226 Difference]: Without dead ends: 17106 [2019-11-16 00:03:29,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17106 states. [2019-11-16 00:03:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17106 to 15890. [2019-11-16 00:03:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15890 states. [2019-11-16 00:03:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15890 states to 15890 states and 16269 transitions. [2019-11-16 00:03:30,034 INFO L78 Accepts]: Start accepts. Automaton has 15890 states and 16269 transitions. Word has length 870 [2019-11-16 00:03:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:30,035 INFO L462 AbstractCegarLoop]: Abstraction has 15890 states and 16269 transitions. [2019-11-16 00:03:30,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 15890 states and 16269 transitions. [2019-11-16 00:03:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2019-11-16 00:03:30,046 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:30,047 INFO L380 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:30,047 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:30,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:30,047 INFO L82 PathProgramCache]: Analyzing trace with hash -323160536, now seen corresponding path program 1 times [2019-11-16 00:03:30,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:30,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307880843] [2019-11-16 00:03:30,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:30,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:30,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1481 backedges. 1025 proven. 286 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-11-16 00:03:31,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307880843] [2019-11-16 00:03:31,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642830463] [2019-11-16 00:03:31,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/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:03:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:32,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:03:32,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:32,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:03:32,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:32,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:32,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:32,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:32,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:32,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:32,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-16 00:03:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1481 backedges. 1239 proven. 2 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-16 00:03:33,264 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:33,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-11-16 00:03:33,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980291990] [2019-11-16 00:03:33,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:03:33,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:03:33,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:03:33,266 INFO L87 Difference]: Start difference. First operand 15890 states and 16269 transitions. Second operand 16 states. [2019-11-16 00:03:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:38,452 INFO L93 Difference]: Finished difference Result 32897 states and 33666 transitions. [2019-11-16 00:03:38,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-16 00:03:38,452 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 896 [2019-11-16 00:03:38,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:38,467 INFO L225 Difference]: With dead ends: 32897 [2019-11-16 00:03:38,467 INFO L226 Difference]: Without dead ends: 17607 [2019-11-16 00:03:38,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 909 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2019-11-16 00:03:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17607 states. [2019-11-16 00:03:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17607 to 14991. [2019-11-16 00:03:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14991 states. [2019-11-16 00:03:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14991 states to 14991 states and 15320 transitions. [2019-11-16 00:03:38,606 INFO L78 Accepts]: Start accepts. Automaton has 14991 states and 15320 transitions. Word has length 896 [2019-11-16 00:03:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:38,607 INFO L462 AbstractCegarLoop]: Abstraction has 14991 states and 15320 transitions. [2019-11-16 00:03:38,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:03:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 14991 states and 15320 transitions. [2019-11-16 00:03:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2019-11-16 00:03:38,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:38,618 INFO L380 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:38,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:38,819 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:38,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:38,819 INFO L82 PathProgramCache]: Analyzing trace with hash -542640556, now seen corresponding path program 1 times [2019-11-16 00:03:38,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:38,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909984644] [2019-11-16 00:03:38,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:38,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:38,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:40,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 1032 proven. 198 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-16 00:03:40,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909984644] [2019-11-16 00:03:40,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514634904] [2019-11-16 00:03:40,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:40,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:03:40,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:40,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:40,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:16,352 WARN L191 SmtUtils]: Spent 35.37 s on a formula simplification. DAG size of input: 129 DAG size of output: 38 [2019-11-16 00:04:16,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:04:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 767 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-11-16 00:04:17,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:04:17,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-11-16 00:04:17,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662097950] [2019-11-16 00:04:17,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:04:17,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:17,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:04:17,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:04:17,360 INFO L87 Difference]: Start difference. First operand 14991 states and 15320 transitions. Second operand 5 states. [2019-11-16 00:04:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:22,478 INFO L93 Difference]: Finished difference Result 34579 states and 35341 transitions. [2019-11-16 00:04:22,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:04:22,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 902 [2019-11-16 00:04:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:22,496 INFO L225 Difference]: With dead ends: 34579 [2019-11-16 00:04:22,496 INFO L226 Difference]: Without dead ends: 20689 [2019-11-16 00:04:22,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 903 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:04:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20689 states. [2019-11-16 00:04:22,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20689 to 16791. [2019-11-16 00:04:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2019-11-16 00:04:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 17136 transitions. [2019-11-16 00:04:22,644 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 17136 transitions. Word has length 902 [2019-11-16 00:04:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:22,644 INFO L462 AbstractCegarLoop]: Abstraction has 16791 states and 17136 transitions. [2019-11-16 00:04:22,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:04:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 17136 transitions. [2019-11-16 00:04:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2019-11-16 00:04:22,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:22,653 INFO L380 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:22,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:22,855 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:22,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:22,855 INFO L82 PathProgramCache]: Analyzing trace with hash 411928055, now seen corresponding path program 1 times [2019-11-16 00:04:22,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:22,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090698434] [2019-11-16 00:04:22,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:22,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:22,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 1024 proven. 188 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-11-16 00:04:24,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090698434] [2019-11-16 00:04:24,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514591722] [2019-11-16 00:04:24,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:24,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:04:24,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:24,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:24,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:24,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:24,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:24,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:24,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:24,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:24,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:42,678 WARN L191 SmtUtils]: Spent 18.36 s on a formula simplification. DAG size of input: 75 DAG size of output: 30 [2019-11-16 00:04:42,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:04:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 782 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-11-16 00:04:43,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:04:43,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-11-16 00:04:43,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089637517] [2019-11-16 00:04:43,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:04:43,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:43,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:04:43,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:04:43,475 INFO L87 Difference]: Start difference. First operand 16791 states and 17136 transitions. Second operand 5 states. [2019-11-16 00:04:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:46,706 INFO L93 Difference]: Finished difference Result 37812 states and 38607 transitions. [2019-11-16 00:04:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:04:46,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 931 [2019-11-16 00:04:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:46,720 INFO L225 Difference]: With dead ends: 37812 [2019-11-16 00:04:46,720 INFO L226 Difference]: Without dead ends: 22487 [2019-11-16 00:04:46,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 930 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:04:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22487 states. [2019-11-16 00:04:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22487 to 16191. [2019-11-16 00:04:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16191 states. [2019-11-16 00:04:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16191 states to 16191 states and 16531 transitions. [2019-11-16 00:04:46,872 INFO L78 Accepts]: Start accepts. Automaton has 16191 states and 16531 transitions. Word has length 931 [2019-11-16 00:04:46,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:46,873 INFO L462 AbstractCegarLoop]: Abstraction has 16191 states and 16531 transitions. [2019-11-16 00:04:46,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:04:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 16191 states and 16531 transitions. [2019-11-16 00:04:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1015 [2019-11-16 00:04:46,882 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:46,883 INFO L380 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:04:47,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:47,086 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:47,087 INFO L82 PathProgramCache]: Analyzing trace with hash 20026544, now seen corresponding path program 1 times [2019-11-16 00:04:47,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:47,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755686815] [2019-11-16 00:04:47,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:47,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:47,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1017 proven. 150 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-11-16 00:04:48,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755686815] [2019-11-16 00:04:48,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632270044] [2019-11-16 00:04:48,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:48,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:04:48,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:48,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:48,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:48,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:04:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-11-16 00:04:49,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:04:49,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-11-16 00:04:49,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050945732] [2019-11-16 00:04:49,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:04:49,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:49,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:04:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:04:49,295 INFO L87 Difference]: Start difference. First operand 16191 states and 16531 transitions. Second operand 5 states. [2019-11-16 00:04:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:51,564 INFO L93 Difference]: Finished difference Result 37206 states and 38023 transitions. [2019-11-16 00:04:51,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:04:51,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1014 [2019-11-16 00:04:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:51,578 INFO L225 Difference]: With dead ends: 37206 [2019-11-16 00:04:51,578 INFO L226 Difference]: Without dead ends: 22481 [2019-11-16 00:04:51,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 1013 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:04:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22481 states. [2019-11-16 00:04:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22481 to 18884. [2019-11-16 00:04:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18884 states. [2019-11-16 00:04:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18884 states to 18884 states and 19309 transitions. [2019-11-16 00:04:51,749 INFO L78 Accepts]: Start accepts. Automaton has 18884 states and 19309 transitions. Word has length 1014 [2019-11-16 00:04:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:51,750 INFO L462 AbstractCegarLoop]: Abstraction has 18884 states and 19309 transitions. [2019-11-16 00:04:51,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:04:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 18884 states and 19309 transitions. [2019-11-16 00:04:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2019-11-16 00:04:51,760 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:51,761 INFO L380 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:51,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:51,965 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:51,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:51,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2103214973, now seen corresponding path program 1 times [2019-11-16 00:04:51,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:51,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876830798] [2019-11-16 00:04:51,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:51,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:51,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 1138 proven. 343 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-11-16 00:04:54,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876830798] [2019-11-16 00:04:54,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648905999] [2019-11-16 00:04:54,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:54,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:04:54,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 1203 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-11-16 00:04:55,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:04:55,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2019-11-16 00:04:55,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606517072] [2019-11-16 00:04:55,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:04:55,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:55,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:04:55,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:04:55,971 INFO L87 Difference]: Start difference. First operand 18884 states and 19309 transitions. Second operand 5 states. [2019-11-16 00:04:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:57,074 INFO L93 Difference]: Finished difference Result 37186 states and 38031 transitions. [2019-11-16 00:04:57,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:04:57,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1052 [2019-11-16 00:04:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:57,086 INFO L225 Difference]: With dead ends: 37186 [2019-11-16 00:04:57,086 INFO L226 Difference]: Without dead ends: 17700 [2019-11-16 00:04:57,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1067 GetRequests, 1051 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:04:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17700 states. [2019-11-16 00:04:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17700 to 17682. [2019-11-16 00:04:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17682 states. [2019-11-16 00:04:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17682 states to 17682 states and 17982 transitions. [2019-11-16 00:04:57,234 INFO L78 Accepts]: Start accepts. Automaton has 17682 states and 17982 transitions. Word has length 1052 [2019-11-16 00:04:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:57,235 INFO L462 AbstractCegarLoop]: Abstraction has 17682 states and 17982 transitions. [2019-11-16 00:04:57,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:04:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 17682 states and 17982 transitions. [2019-11-16 00:04:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1082 [2019-11-16 00:04:57,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:57,248 INFO L380 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 3, 3, 3, 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] [2019-11-16 00:04:57,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:57,452 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:57,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1579037771, now seen corresponding path program 1 times [2019-11-16 00:04:57,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:57,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243327763] [2019-11-16 00:04:57,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:57,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:57,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1847 backedges. 1137 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2019-11-16 00:04:58,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243327763] [2019-11-16 00:04:58,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:58,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:04:58,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293653486] [2019-11-16 00:04:58,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:04:58,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:58,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:04:58,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:04:58,213 INFO L87 Difference]: Start difference. First operand 17682 states and 17982 transitions. Second operand 3 states. [2019-11-16 00:04:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:58,993 INFO L93 Difference]: Finished difference Result 33266 states and 33837 transitions. [2019-11-16 00:04:58,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:04:58,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1081 [2019-11-16 00:04:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:59,004 INFO L225 Difference]: With dead ends: 33266 [2019-11-16 00:04:59,004 INFO L226 Difference]: Without dead ends: 17382 [2019-11-16 00:04:59,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:04:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17382 states. [2019-11-16 00:04:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17382 to 17083. [2019-11-16 00:04:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17083 states. [2019-11-16 00:04:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17083 states to 17083 states and 17375 transitions. [2019-11-16 00:04:59,154 INFO L78 Accepts]: Start accepts. Automaton has 17083 states and 17375 transitions. Word has length 1081 [2019-11-16 00:04:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:59,155 INFO L462 AbstractCegarLoop]: Abstraction has 17083 states and 17375 transitions. [2019-11-16 00:04:59,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:04:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 17083 states and 17375 transitions. [2019-11-16 00:04:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2019-11-16 00:04:59,168 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:59,169 INFO L380 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:59,169 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:59,170 INFO L82 PathProgramCache]: Analyzing trace with hash -733344715, now seen corresponding path program 1 times [2019-11-16 00:04:59,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:59,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088174739] [2019-11-16 00:04:59,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:59,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:59,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1865 backedges. 1439 proven. 102 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-11-16 00:05:01,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088174739] [2019-11-16 00:05:01,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280305671] [2019-11-16 00:05:01,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:01,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:05:01,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:01,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:01,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:17,195 WARN L191 SmtUtils]: Spent 15.31 s on a formula simplification. DAG size of input: 96 DAG size of output: 30 [2019-11-16 00:05:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1865 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2019-11-16 00:05:18,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:05:18,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-11-16 00:05:18,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489404473] [2019-11-16 00:05:18,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:05:18,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:18,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:05:18,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:05:18,294 INFO L87 Difference]: Start difference. First operand 17083 states and 17375 transitions. Second operand 4 states. [2019-11-16 00:05:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:20,800 INFO L93 Difference]: Finished difference Result 33568 states and 34138 transitions. [2019-11-16 00:05:20,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:05:20,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1102 [2019-11-16 00:05:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:20,811 INFO L225 Difference]: With dead ends: 33568 [2019-11-16 00:05:20,811 INFO L226 Difference]: Without dead ends: 17685 [2019-11-16 00:05:20,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 1101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:05:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17685 states. [2019-11-16 00:05:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17685 to 10195. [2019-11-16 00:05:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10195 states. [2019-11-16 00:05:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10195 states to 10195 states and 10336 transitions. [2019-11-16 00:05:20,921 INFO L78 Accepts]: Start accepts. Automaton has 10195 states and 10336 transitions. Word has length 1102 [2019-11-16 00:05:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:20,922 INFO L462 AbstractCegarLoop]: Abstraction has 10195 states and 10336 transitions. [2019-11-16 00:05:20,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:05:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 10195 states and 10336 transitions. [2019-11-16 00:05:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2019-11-16 00:05:20,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:20,932 INFO L380 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:05:21,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:21,133 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:21,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:21,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1476661208, now seen corresponding path program 1 times [2019-11-16 00:05:21,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:21,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200216293] [2019-11-16 00:05:21,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:21,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:21,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 1107 proven. 628 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-16 00:05:22,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200216293] [2019-11-16 00:05:22,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594477657] [2019-11-16 00:05:22,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:23,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1280 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:05:23,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:23,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:23,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:23,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:23,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:23,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 1458 proven. 104 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-11-16 00:05:27,443 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:05:27,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 15 [2019-11-16 00:05:27,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321420272] [2019-11-16 00:05:27,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:05:27,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:27,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:05:27,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:05:27,446 INFO L87 Difference]: Start difference. First operand 10195 states and 10336 transitions. Second operand 15 states. [2019-11-16 00:05:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:42,591 INFO L93 Difference]: Finished difference Result 28371 states and 28766 transitions. [2019-11-16 00:05:42,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-16 00:05:42,592 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1131 [2019-11-16 00:05:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:42,603 INFO L225 Difference]: With dead ends: 28371 [2019-11-16 00:05:42,604 INFO L226 Difference]: Without dead ends: 18174 [2019-11-16 00:05:42,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1202 GetRequests, 1157 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2019-11-16 00:05:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18174 states. [2019-11-16 00:05:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18174 to 10495. [2019-11-16 00:05:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10495 states. [2019-11-16 00:05:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10495 states to 10495 states and 10609 transitions. [2019-11-16 00:05:42,717 INFO L78 Accepts]: Start accepts. Automaton has 10495 states and 10609 transitions. Word has length 1131 [2019-11-16 00:05:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:42,718 INFO L462 AbstractCegarLoop]: Abstraction has 10495 states and 10609 transitions. [2019-11-16 00:05:42,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:05:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 10495 states and 10609 transitions. [2019-11-16 00:05:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1191 [2019-11-16 00:05:42,727 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:42,728 INFO L380 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:05:42,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:42,929 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1950595044, now seen corresponding path program 1 times [2019-11-16 00:05:42,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:42,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451257561] [2019-11-16 00:05:42,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:42,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:42,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 1362 proven. 237 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-11-16 00:05:44,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451257561] [2019-11-16 00:05:44,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191771662] [2019-11-16 00:05:44,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:44,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:05:44,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:44,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:44,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:47,065 WARN L191 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 38 DAG size of output: 24 [2019-11-16 00:05:47,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 1110 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-11-16 00:05:48,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:05:48,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-11-16 00:05:48,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052854979] [2019-11-16 00:05:48,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:05:48,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:48,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:05:48,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:05:48,067 INFO L87 Difference]: Start difference. First operand 10495 states and 10609 transitions. Second operand 5 states. [2019-11-16 00:05:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:49,876 INFO L93 Difference]: Finished difference Result 22220 states and 22464 transitions. [2019-11-16 00:05:49,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:05:49,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1190 [2019-11-16 00:05:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:49,878 INFO L225 Difference]: With dead ends: 22220 [2019-11-16 00:05:49,878 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:05:49,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1197 GetRequests, 1189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:05:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:05:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:05:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:05:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:05:49,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1190 [2019-11-16 00:05:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:49,885 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:05:49,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:05:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:05:49,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:05:50,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:50,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:05:52,339 WARN L191 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 1766 DAG size of output: 1607 [2019-11-16 00:05:53,886 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 1215 DAG size of output: 1058 [2019-11-16 00:05:54,447 WARN L191 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 731 DAG size of output: 630 [2019-11-16 00:06:30,275 WARN L191 SmtUtils]: Spent 35.82 s on a formula simplification. DAG size of input: 1549 DAG size of output: 165 [2019-11-16 00:07:23,337 WARN L191 SmtUtils]: Spent 53.06 s on a formula simplification. DAG size of input: 1001 DAG size of output: 165 [2019-11-16 00:07:27,156 WARN L191 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 607 DAG size of output: 168 [2019-11-16 00:07:27,158 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,158 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,158 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,159 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,160 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,161 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:07:27,162 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,163 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,164 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-16 00:07:27,165 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:07:27,165 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:07:27,165 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,165 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:07:27,165 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:07:27,165 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,165 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,165 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,166 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,166 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-16 00:07:27,166 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,166 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,166 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,166 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,166 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:07:27,167 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:07:27,167 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,167 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-16 00:07:27,167 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,167 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,167 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,167 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,167 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,168 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,168 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-16 00:07:27,168 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,168 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,168 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,168 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,168 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,169 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,169 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,169 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-16 00:07:27,169 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,169 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,169 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,169 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,169 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,170 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-16 00:07:27,170 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,170 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,170 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,170 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,170 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,170 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,171 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,171 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,171 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:07:27,171 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:07:27,171 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,171 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,171 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-16 00:07:27,171 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,172 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,172 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,172 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,172 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,172 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-16 00:07:27,172 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,172 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,173 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,173 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,173 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,173 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-16 00:07:27,173 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,173 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,173 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,173 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,174 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-16 00:07:27,174 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-16 00:07:27,174 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,174 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,174 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,174 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,174 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,174 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:07:27,175 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:07:27,175 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,175 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-16 00:07:27,175 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:07:27,175 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-16 00:07:27,175 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,175 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,176 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,176 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,176 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,176 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:07:27,176 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:07:27,176 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:07:27,176 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:07:27,176 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,177 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,177 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,177 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-16 00:07:27,177 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-16 00:07:27,177 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,177 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,177 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,177 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,178 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,178 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,178 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:07:27,178 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:07:27,178 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-16 00:07:27,178 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,178 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-16 00:07:27,179 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,179 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,179 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,179 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,179 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,179 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,179 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,179 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,180 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-16 00:07:27,180 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-16 00:07:27,180 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:07:27,180 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:07:27,180 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,180 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,180 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,181 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,181 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse29 (+ ~a29~0 144)) (.cse30 (+ ~a29~0 16))) (let ((.cse32 (<= .cse30 0)) (.cse9 (< 0 .cse29)) (.cse31 (+ ~a4~0 86))) (let ((.cse18 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse27 (<= (+ ~a0~0 61) 0)) (.cse13 (<= .cse31 0)) (.cse8 (and .cse32 .cse9)) (.cse11 (+ ~a29~0 127)) (.cse23 (<= (+ ~a0~0 147) 0)) (.cse15 (<= 3 ~a2~0))) (let ((.cse7 (<= 0 (+ ~a0~0 146))) (.cse0 (and .cse23 .cse15)) (.cse12 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse2 (<= 4453 ~a29~0)) (.cse4 (= ~a2~0 1)) (.cse5 (<= 0 .cse11)) (.cse25 (and .cse13 .cse8)) (.cse14 (<= ~a2~0 3)) (.cse21 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse22 (or .cse18 (< 0 .cse31) .cse32 .cse27)) (.cse1 (= 5 ~a2~0)) (.cse19 (<= ~a0~0 599976)) (.cse24 (<= 2 ~a2~0)) (.cse6 (<= (+ ~a0~0 98) 0)) (.cse16 (< 0 .cse30)) (.cse17 (= 2 ~a2~0)) (.cse26 (<= .cse29 0)) (.cse3 (<= (+ ~a0~0 242851) 0)) (.cse20 (= 4 ~a2~0))) (or (and (and .cse0 .cse1) .cse2) (and (and .cse3 .cse4) .cse5) (and .cse6 .cse4 .cse7 .cse8) (and .cse6 .cse7 .cse8 .cse1) (and .cse1 (and .cse3 .cse9)) (let ((.cse10 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) (<= 0 .cse10) .cse5 .cse4 (<= .cse11 0) (<= .cse10 0))) (and (or (and .cse12 .cse13 .cse14 .cse15) (and .cse13 .cse16 .cse17 .cse18)) .cse19) (and .cse6 .cse7 .cse1 .cse5) (and (or (< 0 (+ ~a4~0 42)) (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse16 .cse0 .cse20) (and (and .cse14 .cse15) .cse6) (and .cse13 .cse20 (<= ~a0~0 599920) .cse12 .cse21) (and (and (and .cse13 .cse22 .cse1) .cse2) .cse19) (and (and .cse4 .cse23) .cse16) (and (or (and (and .cse24 .cse25 (not (= ~a2~0 3)) .cse14) .cse5) (and .cse26 .cse13 .cse17)) .cse19) (and .cse13 .cse27) (and (or (and .cse13 .cse16 (<= ~a29~0 42) .cse20) (and (and .cse25 .cse21) .cse20)) .cse19) (and .cse19 (and .cse16 (and .cse13 .cse14 .cse15))) (and (and (and .cse13 (or (<= ~a29~0 43) .cse21)) .cse22 .cse1) .cse16 .cse19) (and .cse24 .cse23 (<= ~a2~0 2)) (and .cse6 .cse16 .cse17) (and (and (or .cse26 (and .cse3 .cse8)) .cse20) (exists ((v_~a0~0_836 Int)) (let ((.cse28 (div v_~a0~0_836 5))) (and (<= ~a0~0 (+ (div (+ .cse28 (- 278887)) 5) 1)) (< .cse28 278887) (not (= (mod (+ .cse28 4) 5) 0)) (<= 0 v_~a0~0_836) (not (= (mod (+ .cse28 3) 5) 0)) (< .cse28 278886) (<= v_~a0~0_836 599999)))))))))) [2019-11-16 00:07:27,182 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-16 00:07:27,182 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-16 00:07:27,182 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,182 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,182 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,182 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,182 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,183 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,183 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,183 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:07:27,183 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,183 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:07:27,183 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-16 00:07:27,183 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,183 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:07:27,184 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:07:27,184 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-16 00:07:27,184 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-16 00:07:27,184 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,184 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,184 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,184 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,185 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,185 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-16 00:07:27,185 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-16 00:07:27,185 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,185 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:07:27,185 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:07:27,185 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,186 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,186 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,186 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,186 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,186 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,187 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse30 (+ ~a29~0 16)) (.cse29 (+ ~a29~0 144))) (let ((.cse16 (<= (+ ~a0~0 147) 0)) (.cse26 (not (= ~a2~0 3))) (.cse21 (<= 3 ~a2~0)) (.cse28 (+ ~a29~0 127)) (.cse1 (<= (+ ~a4~0 86) 0)) (.cse23 (<= (+ ~a0~0 242851) 0)) (.cse12 (and (<= .cse30 0) (< 0 .cse29)))) (let ((.cse4 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse15 (and .cse23 .cse12)) (.cse5 (< 0 .cse30)) (.cse8 (= 4 ~a2~0)) (.cse19 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse3 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse9 (<= (+ ~a0~0 98) 0)) (.cse11 (<= 0 (+ ~a0~0 146))) (.cse7 (and .cse1 .cse12)) (.cse20 (<= ~a2~0 3)) (.cse14 (<= .cse29 0)) (.cse18 (= 2 ~a2~0)) (.cse6 (<= ~a0~0 599976)) (.cse17 (<= 0 .cse28)) (.cse10 (= ~a2~0 1)) (.cse25 (<= 2 ~a2~0)) (.cse22 (and .cse16 .cse26 .cse21)) (.cse0 (= 5 ~a2~0)) (.cse24 (<= 4453 ~a29~0))) (or (and (and (let ((.cse2 (<= ~a29~0 43))) (and .cse0 (and .cse1 (or .cse2 .cse3)) (or .cse4 .cse2))) .cse5) .cse6) (and (or (and (and .cse7 .cse3) .cse8) (and .cse5 (<= ~a29~0 42) .cse8 .cse1)) .cse6) (and .cse9 .cse10 .cse11 .cse12) (and (exists ((v_~a0~0_836 Int)) (let ((.cse13 (div v_~a0~0_836 5))) (and (<= ~a0~0 (+ (div (+ .cse13 (- 278887)) 5) 1)) (< .cse13 278887) (not (= (mod (+ .cse13 4) 5) 0)) (<= 0 v_~a0~0_836) (not (= (mod (+ .cse13 3) 5) 0)) (< .cse13 278886) (<= v_~a0~0_836 599999)))) (and (or .cse14 .cse15) .cse8)) (and .cse5 (and .cse10 .cse16)) (and .cse9 .cse11 .cse12 .cse0) (and (or (and (and .cse1 .cse17) .cse18 .cse4) (and .cse19 .cse1 .cse20 .cse21)) .cse6) (and .cse22 .cse5 .cse8) (and (and .cse23 .cse10) .cse17) (and .cse23 .cse5 .cse0) (and .cse9 (and .cse20 .cse21)) (and (and (and .cse1 .cse4 .cse0) .cse24) .cse6) (and .cse9 .cse5 .cse18) (and .cse15 .cse0) (and .cse1 (<= (+ ~a0~0 61) 0)) (and .cse6 (and (and .cse1 .cse20 .cse21) .cse5)) (and .cse1 .cse8 (<= ~a0~0 599920) .cse19 .cse3) (and .cse0 (and .cse9 .cse11 .cse17)) (and (or (and (and .cse25 .cse7 .cse26 .cse20) .cse17) (and .cse14 .cse1 .cse18)) .cse6) (let ((.cse27 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) (<= 0 .cse27) .cse17 .cse10 (<= .cse28 0) (<= .cse27 0))) (and .cse25 .cse16 (<= ~a2~0 2)) (and (and .cse22 .cse0) .cse24))))) [2019-11-16 00:07:27,187 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,187 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-16 00:07:27,187 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-16 00:07:27,187 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,187 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,188 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,188 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,188 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,188 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,188 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-16 00:07:27,188 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-16 00:07:27,188 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,188 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,189 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-16 00:07:27,189 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,189 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,189 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,189 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,189 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,189 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,189 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-16 00:07:27,190 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-16 00:07:27,190 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,190 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,190 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,190 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,190 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,191 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,191 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:07:27,191 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-16 00:07:27,191 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,191 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-16 00:07:27,191 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,191 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,191 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,192 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,192 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,192 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,192 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,192 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-16 00:07:27,192 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-16 00:07:27,192 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,192 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,193 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,193 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,193 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,193 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,193 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,193 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-16 00:07:27,193 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-16 00:07:27,193 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,194 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,194 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,194 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,194 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,194 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,194 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,194 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:07:27,195 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:07:27,195 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,195 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-16 00:07:27,195 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-16 00:07:27,195 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,195 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,195 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,195 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,196 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,196 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,196 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse30 (+ ~a29~0 16)) (.cse29 (+ ~a29~0 144))) (let ((.cse16 (<= (+ ~a0~0 147) 0)) (.cse28 (not (= ~a2~0 3))) (.cse23 (<= 3 ~a2~0)) (.cse19 (+ ~a29~0 127)) (.cse1 (<= (+ ~a4~0 86) 0)) (.cse25 (<= (+ ~a0~0 242851) 0)) (.cse12 (and (<= .cse30 0) (< 0 .cse29)))) (let ((.cse10 (= ~a2~0 1)) (.cse4 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse15 (and .cse25 .cse12)) (.cse5 (< 0 .cse30)) (.cse8 (= 4 ~a2~0)) (.cse21 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse3 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse6 (<= ~a0~0 599976)) (.cse7 (and .cse1 .cse12)) (.cse22 (<= ~a2~0 3)) (.cse14 (<= .cse29 0)) (.cse20 (= 2 ~a2~0)) (.cse9 (<= (+ ~a0~0 98) 0)) (.cse11 (<= 0 (+ ~a0~0 146))) (.cse18 (<= 0 .cse19)) (.cse27 (<= 2 ~a2~0)) (.cse24 (and .cse16 .cse28 .cse23)) (.cse0 (= 5 ~a2~0)) (.cse26 (<= 4453 ~a29~0))) (or (and (and (let ((.cse2 (<= ~a29~0 43))) (and .cse0 (and .cse1 (or .cse2 .cse3)) (or .cse4 .cse2))) .cse5) .cse6) (and (or (and (and .cse7 .cse3) .cse8) (and .cse5 (<= ~a29~0 42) .cse8 .cse1)) .cse6) (and .cse9 .cse10 .cse11 .cse12) (and (exists ((v_~a0~0_836 Int)) (let ((.cse13 (div v_~a0~0_836 5))) (and (<= ~a0~0 (+ (div (+ .cse13 (- 278887)) 5) 1)) (< .cse13 278887) (not (= (mod (+ .cse13 4) 5) 0)) (<= 0 v_~a0~0_836) (not (= (mod (+ .cse13 3) 5) 0)) (< .cse13 278886) (<= v_~a0~0_836 599999)))) (and (or .cse14 .cse15) .cse8)) (and .cse5 (and .cse10 .cse16)) (and .cse9 .cse11 .cse12 .cse0) (let ((.cse17 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) (<= 0 .cse17) .cse18 .cse10 (<= .cse19 0) (<= .cse17 0))) (and (or (and (and .cse1 .cse18) .cse20 .cse4) (and .cse21 .cse1 .cse22 .cse23)) .cse6) (and .cse24 .cse5 .cse8) (and (and .cse25 .cse10) .cse18) (and .cse25 .cse5 .cse0) (and .cse9 (and .cse22 .cse23)) (and (and (and .cse1 .cse4 .cse0) .cse26) .cse6) (and .cse9 .cse5 .cse20) (and .cse15 .cse0) (and .cse1 (<= (+ ~a0~0 61) 0)) (and .cse6 (and (and .cse1 .cse22 .cse23) .cse5)) (and .cse1 .cse8 (<= ~a0~0 599920) .cse21 .cse3) (and .cse6 (or (and (and .cse27 .cse7 .cse28 .cse22) .cse18) (and .cse14 .cse1 .cse20))) (and .cse0 (and .cse9 .cse11 .cse18)) (and .cse27 .cse16 (<= ~a2~0 2)) (and (and .cse24 .cse0) .cse26))))) [2019-11-16 00:07:27,196 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-16 00:07:27,197 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-16 00:07:27,197 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,197 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,197 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,197 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,197 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,197 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,198 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,198 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,198 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-16 00:07:27,198 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-16 00:07:27,198 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,198 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:07:27,198 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:07:27,198 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,199 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,199 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,199 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,199 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,199 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,199 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-16 00:07:27,199 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,199 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,200 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,200 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,200 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:07:27,200 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:07:27,200 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:07:27,200 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,200 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:07:27,200 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-16 00:07:27,201 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,201 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,201 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 169) no Hoare annotation was computed. [2019-11-16 00:07:27,201 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,201 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,201 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,202 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,202 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,202 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-16 00:07:27,202 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,202 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,202 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,202 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,202 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-16 00:07:27,203 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,203 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:07:27,203 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,203 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,203 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,203 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,203 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,203 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,204 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,204 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,204 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,204 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:07:27,204 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:07:27,204 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,204 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-16 00:07:27,204 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,205 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,205 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,205 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-16 00:07:27,205 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,205 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,205 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,205 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,205 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,206 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,206 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,206 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:07:27,206 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:07:27,206 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,206 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,206 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,206 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-16 00:07:27,207 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,207 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,207 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,207 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,207 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,207 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-16 00:07:27,207 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,207 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,208 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:07:27,208 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:07:27,208 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,208 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:07:27,208 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-16 00:07:27,208 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,208 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:07:27,208 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,209 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:07:27,209 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:07:27,209 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,209 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,209 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:07:27,209 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:07:27,209 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-16 00:07:27,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,266 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,267 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:07:27 BoogieIcfgContainer [2019-11-16 00:07:27,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:07:27,270 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:07:27,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:07:27,271 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:07:27,271 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:07" (3/4) ... [2019-11-16 00:07:27,274 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:07:27,310 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:07:27,313 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:07:27,342 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((5 == a2 && a4 + 86 <= 0 && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16) && a0 <= 599976) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2) || (((0 < a29 + 16 && a29 <= 42) && 4 == a2) && a4 + 86 <= 0)) && a0 <= 599976)) || (((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999) && (a29 + 144 <= 0 || (a0 + 242851 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144)) && 4 == a2)) || (0 < a29 + 16 && a2 == 1 && a0 + 147 <= 0)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((((a4 + 86 <= 0 && 0 <= a29 + 127) && 2 == a2) && !(6 == input)) || ((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2)) && a0 <= 599976)) || ((((a0 + 147 <= 0 && !(a2 == 3)) && 3 <= a2) && 0 < a29 + 16) && 4 == a2)) || ((a0 + 242851 <= 0 && a2 == 1) && 0 <= a29 + 127)) || ((a0 + 242851 <= 0 && 0 < a29 + 16) && 5 == a2)) || (a0 + 98 <= 0 && a2 <= 3 && 3 <= a2)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || ((a0 + 242851 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || (a0 <= 599976 && ((a4 + 86 <= 0 && a2 <= 3) && 3 <= a2) && 0 < a29 + 16)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || (5 == a2 && (a0 + 98 <= 0 && 0 <= a0 + 146) && 0 <= a29 + 127)) || ((((((2 <= a2 && a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && a2 <= 3) && 0 <= a29 + 127) || ((a29 + 144 <= 0 && a4 + 86 <= 0) && 2 == a2)) && a0 <= 599976)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 2)) || ((((a0 + 147 <= 0 && !(a2 == 3)) && 3 <= a2) && 5 == a2) && 4453 <= a29) [2019-11-16 00:07:27,345 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((5 == a2 && a4 + 86 <= 0 && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16) && a0 <= 599976) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2) || (((0 < a29 + 16 && a29 <= 42) && 4 == a2) && a4 + 86 <= 0)) && a0 <= 599976)) || (((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999) && (a29 + 144 <= 0 || (a0 + 242851 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144)) && 4 == a2)) || (0 < a29 + 16 && a2 == 1 && a0 + 147 <= 0)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (((((a4 + 86 <= 0 && 0 <= a29 + 127) && 2 == a2) && !(6 == input)) || ((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2)) && a0 <= 599976)) || ((((a0 + 147 <= 0 && !(a2 == 3)) && 3 <= a2) && 0 < a29 + 16) && 4 == a2)) || ((a0 + 242851 <= 0 && a2 == 1) && 0 <= a29 + 127)) || ((a0 + 242851 <= 0 && 0 < a29 + 16) && 5 == a2)) || (a0 + 98 <= 0 && a2 <= 3 && 3 <= a2)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || ((a0 + 242851 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || (a0 <= 599976 && ((a4 + 86 <= 0 && a2 <= 3) && 3 <= a2) && 0 < a29 + 16)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || (a0 <= 599976 && (((((2 <= a2 && a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && a2 <= 3) && 0 <= a29 + 127) || ((a29 + 144 <= 0 && a4 + 86 <= 0) && 2 == a2)))) || (5 == a2 && (a0 + 98 <= 0 && 0 <= a0 + 146) && 0 <= a29 + 127)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 2)) || ((((a0 + 147 <= 0 && !(a2 == 3)) && 3 <= a2) && 5 == a2) && 4453 <= a29) [2019-11-16 00:07:27,355 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a0 + 147 <= 0 && 3 <= a2) && 5 == a2) && 4453 <= a29) || ((a0 + 242851 <= 0 && a2 == 1) && 0 <= a29 + 127)) || (((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (5 == a2 && a0 + 242851 <= 0 && 0 < a29 + 144)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || ((((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2) || (((a4 + 86 <= 0 && 0 < a29 + 16) && 2 == a2) && !(6 == input))) && a0 <= 599976)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127)) || ((((0 < a4 + 42 || !(1 == input)) && 0 < a29 + 16) && a0 + 147 <= 0 && 3 <= a2) && 4 == a2)) || ((a2 <= 3 && 3 <= a2) && a0 + 98 <= 0)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((((a4 + 86 <= 0 && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) || a0 + 61 <= 0)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((a2 == 1 && a0 + 147 <= 0) && 0 < a29 + 16)) || ((((((2 <= a2 && a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && a2 <= 3) && 0 <= a29 + 127) || ((a29 + 144 <= 0 && a4 + 86 <= 0) && 2 == a2)) && a0 <= 599976)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 4 == a2) || (((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2)) && a0 <= 599976)) || (a0 <= 599976 && 0 < a29 + 16 && (a4 + 86 <= 0 && a2 <= 3) && 3 <= a2)) || (((((a4 + 86 <= 0 && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) || a0 + 61 <= 0)) && 5 == a2) && 0 < a29 + 16) && a0 <= 599976)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 2)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((a29 + 144 <= 0 || (a0 + 242851 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144)) && 4 == a2) && (\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999)) [2019-11-16 00:07:27,515 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6937aeb3-0a9d-49d3-b64a-5ad516454cab/bin/uautomizer/witness.graphml [2019-11-16 00:07:27,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:07:27,516 INFO L168 Benchmark]: Toolchain (without parser) took 325338.04 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 946.2 MB in the beginning and 1.6 GB in the end (delta: -635.8 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:07:27,517 INFO L168 Benchmark]: CDTParser took 0.24 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:07:27,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1182.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -120.3 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:07:27,517 INFO L168 Benchmark]: Boogie Procedure Inliner took 199.65 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:07:27,518 INFO L168 Benchmark]: Boogie Preprocessor took 237.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:07:27,518 INFO L168 Benchmark]: RCFGBuilder took 3493.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 937.2 MB in the end (delta: 70.2 MB). Peak memory consumption was 154.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:07:27,518 INFO L168 Benchmark]: TraceAbstraction took 319975.84 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 937.2 MB in the beginning and 1.7 GB in the end (delta: -749.0 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-16 00:07:27,519 INFO L168 Benchmark]: Witness Printer took 244.92 ms. Allocated memory is still 4.9 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:07:27,521 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1182.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -120.3 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 199.65 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 237.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3493.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 937.2 MB in the end (delta: 70.2 MB). Peak memory consumption was 154.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 319975.84 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 937.2 MB in the beginning and 1.7 GB in the end (delta: -749.0 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 244.92 ms. Allocated memory is still 4.9 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 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_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 169]: 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: 1766]: Loop Invariant [2019-11-16 00:07:27,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,540 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((5 == a2 && a4 + 86 <= 0 && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16) && a0 <= 599976) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2) || (((0 < a29 + 16 && a29 <= 42) && 4 == a2) && a4 + 86 <= 0)) && a0 <= 599976)) || (((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999) && (a29 + 144 <= 0 || (a0 + 242851 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144)) && 4 == a2)) || (0 < a29 + 16 && a2 == 1 && a0 + 147 <= 0)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((((a4 + 86 <= 0 && 0 <= a29 + 127) && 2 == a2) && !(6 == input)) || ((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2)) && a0 <= 599976)) || ((((a0 + 147 <= 0 && !(a2 == 3)) && 3 <= a2) && 0 < a29 + 16) && 4 == a2)) || ((a0 + 242851 <= 0 && a2 == 1) && 0 <= a29 + 127)) || ((a0 + 242851 <= 0 && 0 < a29 + 16) && 5 == a2)) || (a0 + 98 <= 0 && a2 <= 3 && 3 <= a2)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || ((a0 + 242851 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || (a0 <= 599976 && ((a4 + 86 <= 0 && a2 <= 3) && 3 <= a2) && 0 < a29 + 16)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || (5 == a2 && (a0 + 98 <= 0 && 0 <= a0 + 146) && 0 <= a29 + 127)) || ((((((2 <= a2 && a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && a2 <= 3) && 0 <= a29 + 127) || ((a29 + 144 <= 0 && a4 + 86 <= 0) && 2 == a2)) && a0 <= 599976)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 2)) || ((((a0 + 147 <= 0 && !(a2 == 3)) && 3 <= a2) && 5 == a2) && 4453 <= a29) - InvariantResult [Line: 23]: Loop Invariant [2019-11-16 00:07:27,543 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,551 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((5 == a2 && a4 + 86 <= 0 && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16) && a0 <= 599976) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2) || (((0 < a29 + 16 && a29 <= 42) && 4 == a2) && a4 + 86 <= 0)) && a0 <= 599976)) || (((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999) && (a29 + 144 <= 0 || (a0 + 242851 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144)) && 4 == a2)) || (0 < a29 + 16 && a2 == 1 && a0 + 147 <= 0)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || (((((a4 + 86 <= 0 && 0 <= a29 + 127) && 2 == a2) && !(6 == input)) || ((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2)) && a0 <= 599976)) || ((((a0 + 147 <= 0 && !(a2 == 3)) && 3 <= a2) && 0 < a29 + 16) && 4 == a2)) || ((a0 + 242851 <= 0 && a2 == 1) && 0 <= a29 + 127)) || ((a0 + 242851 <= 0 && 0 < a29 + 16) && 5 == a2)) || (a0 + 98 <= 0 && a2 <= 3 && 3 <= a2)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || ((a0 + 242851 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || (a0 <= 599976 && ((a4 + 86 <= 0 && a2 <= 3) && 3 <= a2) && 0 < a29 + 16)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || (a0 <= 599976 && (((((2 <= a2 && a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && a2 <= 3) && 0 <= a29 + 127) || ((a29 + 144 <= 0 && a4 + 86 <= 0) && 2 == a2)))) || (5 == a2 && (a0 + 98 <= 0 && 0 <= a0 + 146) && 0 <= a29 + 127)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 2)) || ((((a0 + 147 <= 0 && !(a2 == 3)) && 3 <= a2) && 5 == a2) && 4453 <= a29) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-16 00:07:27,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-16 00:07:27,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-11-16 00:07:27,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a0 + 147 <= 0 && 3 <= a2) && 5 == a2) && 4453 <= a29) || ((a0 + 242851 <= 0 && a2 == 1) && 0 <= a29 + 127)) || (((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144) && 5 == a2)) || (5 == a2 && a0 + 242851 <= 0 && 0 < a29 + 144)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a29 + 127 <= 0) && a0 + 44 <= 0)) || ((((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2) || (((a4 + 86 <= 0 && 0 < a29 + 16) && 2 == a2) && !(6 == input))) && a0 <= 599976)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127)) || ((((0 < a4 + 42 || !(1 == input)) && 0 < a29 + 16) && a0 + 147 <= 0 && 3 <= a2) && 4 == a2)) || ((a2 <= 3 && 3 <= a2) && a0 + 98 <= 0)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((((a4 + 86 <= 0 && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) || a0 + 61 <= 0)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((a2 == 1 && a0 + 147 <= 0) && 0 < a29 + 16)) || ((((((2 <= a2 && a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && !(a2 == 3)) && a2 <= 3) && 0 <= a29 + 127) || ((a29 + 144 <= 0 && a4 + 86 <= 0) && 2 == a2)) && a0 <= 599976)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 4 == a2) || (((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2)) && a0 <= 599976)) || (a0 <= 599976 && 0 < a29 + 16 && (a4 + 86 <= 0 && a2 <= 3) && 3 <= a2)) || (((((a4 + 86 <= 0 && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) || a0 + 61 <= 0)) && 5 == a2) && 0 < a29 + 16) && a0 <= 599976)) || ((2 <= a2 && a0 + 147 <= 0) && a2 <= 2)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((a29 + 144 <= 0 || (a0 + 242851 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144)) && 4 == a2) && (\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999)) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 319.8s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 91.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 97.0s, HoareTripleCheckerStatistics: 4520 SDtfs, 31347 SDslu, 2090 SDs, 0 SdLazy, 79293 SolverSat, 6013 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 72.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11437 GetRequests, 11163 SyntacticMatches, 45 SemanticMatches, 229 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 82.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22827occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 55926 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 231 NumberOfFragments, 1826 HoareAnnotationTreeSize, 4 FomulaSimplifications, 4130457 FormulaSimplificationTreeSizeReduction, 4.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 4528090 FormulaSimplificationTreeSizeReductionInter, 92.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 106.0s InterpolantComputationTime, 26968 NumberOfCodeBlocks, 26968 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 26931 ConstructedInterpolants, 1186 QuantifiedInterpolants, 151633322 SizeOfPredicates, 30 NumberOfNonLiveVariables, 12841 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 37 InterpolantComputations, 20 PerfectInterpolantSequences, 37467/40395 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...