./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem16_label32.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_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem16_label32.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/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 7c969b2b0da4d126f61f6a2cc248b9cb3e53506e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:10:57,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:10:57,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:10:57,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:10:57,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:10:57,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:10:57,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:10:57,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:10:57,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:10:57,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:10:57,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:10:57,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:10:57,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:10:57,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:10:57,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:10:57,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:10:57,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:10:57,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:10:57,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:10:57,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:10:57,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:10:57,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:10:57,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:10:57,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:10:57,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:10:57,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:10:57,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:10:57,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:10:57,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:10:57,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:10:57,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:10:57,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:10:57,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:10:57,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:10:57,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:10:57,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:10:57,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:10:57,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:10:57,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:10:57,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:10:57,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:10:57,608 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:10:57,632 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:10:57,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:10:57,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:10:57,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:10:57,634 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:10:57,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:10:57,634 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:10:57,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:10:57,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:10:57,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:10:57,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:10:57,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:10:57,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:10:57,636 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:10:57,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:10:57,636 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:10:57,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:10:57,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:10:57,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:10:57,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:10:57,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:10:57,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:10:57,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:10:57,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:10:57,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:10:57,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:10:57,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:10:57,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:10:57,639 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_3cf710db-8acc-499a-b904-19dc7978b509/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 -> 7c969b2b0da4d126f61f6a2cc248b9cb3e53506e [2019-11-15 20:10:57,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:10:57,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:10:57,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:10:57,695 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:10:57,695 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:10:57,696 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem16_label32.c [2019-11-15 20:10:57,754 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/data/24d80f966/0f26b47aa55940ba83c4f9d9c2254284/FLAG5c03d4551 [2019-11-15 20:10:58,377 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:10:58,379 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/sv-benchmarks/c/eca-rers2012/Problem16_label32.c [2019-11-15 20:10:58,398 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/data/24d80f966/0f26b47aa55940ba83c4f9d9c2254284/FLAG5c03d4551 [2019-11-15 20:10:58,764 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/data/24d80f966/0f26b47aa55940ba83c4f9d9c2254284 [2019-11-15 20:10:58,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:10:58,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:10:58,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:10:58,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:10:58,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:10:58,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:10:58" (1/1) ... [2019-11-15 20:10:58,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c328f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:58, skipping insertion in model container [2019-11-15 20:10:58,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:10:58" (1/1) ... [2019-11-15 20:10:58,783 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:10:58,857 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:10:59,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:10:59,556 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:10:59,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:10:59,814 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:10:59,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59 WrapperNode [2019-11-15 20:10:59,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:10:59,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:10:59,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:10:59,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:10:59,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59" (1/1) ... [2019-11-15 20:10:59,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59" (1/1) ... [2019-11-15 20:10:59,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:10:59,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:10:59,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:10:59,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:10:59,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59" (1/1) ... [2019-11-15 20:10:59,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59" (1/1) ... [2019-11-15 20:10:59,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59" (1/1) ... [2019-11-15 20:10:59,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59" (1/1) ... [2019-11-15 20:11:00,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59" (1/1) ... [2019-11-15 20:11:00,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59" (1/1) ... [2019-11-15 20:11:00,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59" (1/1) ... [2019-11-15 20:11:00,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:11:00,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:11:00,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:11:00,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:11:00,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:11:00,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:11:00,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:11:02,542 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:11:02,542 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:11:02,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:11:02 BoogieIcfgContainer [2019-11-15 20:11:02,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:11:02,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:11:02,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:11:02,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:11:02,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:10:58" (1/3) ... [2019-11-15 20:11:02,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb57e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:11:02, skipping insertion in model container [2019-11-15 20:11:02,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:10:59" (2/3) ... [2019-11-15 20:11:02,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb57e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:11:02, skipping insertion in model container [2019-11-15 20:11:02,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:11:02" (3/3) ... [2019-11-15 20:11:02,555 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label32.c [2019-11-15 20:11:02,564 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:11:02,571 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:11:02,581 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:11:02,619 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:11:02,619 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:11:02,620 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:11:02,620 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:11:02,620 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:11:02,620 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:11:02,620 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:11:02,621 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:11:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-11-15 20:11:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 20:11:02,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:02,647 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] [2019-11-15 20:11:02,649 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:02,654 INFO L82 PathProgramCache]: Analyzing trace with hash 563919826, now seen corresponding path program 1 times [2019-11-15 20:11:02,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:02,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297234645] [2019-11-15 20:11:02,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:02,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:02,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:11:02,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297234645] [2019-11-15 20:11:02,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:11:02,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:11:02,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700033014] [2019-11-15 20:11:02,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:11:02,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:02,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:11:02,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:11:02,915 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 4 states. [2019-11-15 20:11:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:05,960 INFO L93 Difference]: Finished difference Result 1454 states and 2762 transitions. [2019-11-15 20:11:05,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:11:05,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-15 20:11:05,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:05,984 INFO L225 Difference]: With dead ends: 1454 [2019-11-15 20:11:05,984 INFO L226 Difference]: Without dead ends: 991 [2019-11-15 20:11:05,989 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-15 20:11:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-15 20:11:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-11-15 20:11:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-15 20:11:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1567 transitions. [2019-11-15 20:11:06,081 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1567 transitions. Word has length 48 [2019-11-15 20:11:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:06,081 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1567 transitions. [2019-11-15 20:11:06,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:11:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1567 transitions. [2019-11-15 20:11:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 20:11:06,092 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:06,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:06,092 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:06,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:06,093 INFO L82 PathProgramCache]: Analyzing trace with hash 524059219, now seen corresponding path program 1 times [2019-11-15 20:11:06,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:06,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950965979] [2019-11-15 20:11:06,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:06,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:06,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:11:06,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950965979] [2019-11-15 20:11:06,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:11:06,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:11:06,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638343660] [2019-11-15 20:11:06,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:11:06,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:06,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:11:06,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:11:06,768 INFO L87 Difference]: Start difference. First operand 991 states and 1567 transitions. Second operand 7 states. [2019-11-15 20:11:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:09,704 INFO L93 Difference]: Finished difference Result 2320 states and 3550 transitions. [2019-11-15 20:11:09,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:11:09,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 179 [2019-11-15 20:11:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:09,713 INFO L225 Difference]: With dead ends: 2320 [2019-11-15 20:11:09,713 INFO L226 Difference]: Without dead ends: 1331 [2019-11-15 20:11:09,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:11:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-11-15 20:11:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1320. [2019-11-15 20:11:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-11-15 20:11:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1902 transitions. [2019-11-15 20:11:09,764 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1902 transitions. Word has length 179 [2019-11-15 20:11:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:09,765 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 1902 transitions. [2019-11-15 20:11:09,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:11:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1902 transitions. [2019-11-15 20:11:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-11-15 20:11:09,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:09,773 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:09,773 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:09,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:09,774 INFO L82 PathProgramCache]: Analyzing trace with hash -535832572, now seen corresponding path program 1 times [2019-11-15 20:11:09,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:09,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588156253] [2019-11-15 20:11:09,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:09,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:09,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:11:10,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588156253] [2019-11-15 20:11:10,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:11:10,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:11:10,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079238675] [2019-11-15 20:11:10,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:11:10,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:10,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:10,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:11:10,024 INFO L87 Difference]: Start difference. First operand 1320 states and 1902 transitions. Second operand 3 states. [2019-11-15 20:11:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:11,626 INFO L93 Difference]: Finished difference Result 3296 states and 5031 transitions. [2019-11-15 20:11:11,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:11,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-11-15 20:11:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:11,640 INFO L225 Difference]: With dead ends: 3296 [2019-11-15 20:11:11,640 INFO L226 Difference]: Without dead ends: 2307 [2019-11-15 20:11:11,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:11:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-15 20:11:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-15 20:11:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-15 20:11:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3033 transitions. [2019-11-15 20:11:11,698 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3033 transitions. Word has length 266 [2019-11-15 20:11:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:11,700 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3033 transitions. [2019-11-15 20:11:11,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:11:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3033 transitions. [2019-11-15 20:11:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-15 20:11:11,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:11,705 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:11,705 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:11,705 INFO L82 PathProgramCache]: Analyzing trace with hash -379828481, now seen corresponding path program 1 times [2019-11-15 20:11:11,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:11,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249705783] [2019-11-15 20:11:11,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:11,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:11,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-15 20:11:11,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249705783] [2019-11-15 20:11:11,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:11:11,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:11:11,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994831094] [2019-11-15 20:11:11,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:11:11,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:11,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:11,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:11:11,928 INFO L87 Difference]: Start difference. First operand 2307 states and 3033 transitions. Second operand 3 states. [2019-11-15 20:11:13,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:13,373 INFO L93 Difference]: Finished difference Result 6257 states and 8424 transitions. [2019-11-15 20:11:13,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:13,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-11-15 20:11:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:13,393 INFO L225 Difference]: With dead ends: 6257 [2019-11-15 20:11:13,393 INFO L226 Difference]: Without dead ends: 3294 [2019-11-15 20:11:13,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:11:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-11-15 20:11:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3294. [2019-11-15 20:11:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3294 states. [2019-11-15 20:11:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 3630 transitions. [2019-11-15 20:11:13,460 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 3630 transitions. Word has length 308 [2019-11-15 20:11:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:13,460 INFO L462 AbstractCegarLoop]: Abstraction has 3294 states and 3630 transitions. [2019-11-15 20:11:13,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:11:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 3630 transitions. [2019-11-15 20:11:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-11-15 20:11:13,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:13,466 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-11-15 20:11:13,466 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:13,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1299025563, now seen corresponding path program 1 times [2019-11-15 20:11:13,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:13,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362133810] [2019-11-15 20:11:13,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:13,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:13,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 91 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:11:14,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362133810] [2019-11-15 20:11:14,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532792250] [2019-11-15 20:11:14,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:14,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:11:14,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 20:11:14,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:11:14,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2019-11-15 20:11:14,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999553344] [2019-11-15 20:11:14,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:11:14,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:14,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:14,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:11:14,873 INFO L87 Difference]: Start difference. First operand 3294 states and 3630 transitions. Second operand 3 states. [2019-11-15 20:11:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:15,949 INFO L93 Difference]: Finished difference Result 7244 states and 7990 transitions. [2019-11-15 20:11:15,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:15,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-11-15 20:11:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:15,971 INFO L225 Difference]: With dead ends: 7244 [2019-11-15 20:11:15,971 INFO L226 Difference]: Without dead ends: 4281 [2019-11-15 20:11:15,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:11:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2019-11-15 20:11:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2019-11-15 20:11:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4281 states. [2019-11-15 20:11:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 4605 transitions. [2019-11-15 20:11:16,056 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 4605 transitions. Word has length 348 [2019-11-15 20:11:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:16,056 INFO L462 AbstractCegarLoop]: Abstraction has 4281 states and 4605 transitions. [2019-11-15 20:11:16,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:11:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 4605 transitions. [2019-11-15 20:11:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-11-15 20:11:16,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:16,066 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 20:11:16,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:16,269 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash 461645349, now seen corresponding path program 1 times [2019-11-15 20:11:16,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:16,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061496486] [2019-11-15 20:11:16,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:16,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:16,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 220 proven. 6 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-11-15 20:11:16,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061496486] [2019-11-15 20:11:16,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675715302] [2019-11-15 20:11:16,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:16,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:11:16,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-11-15 20:11:16,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:11:16,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 20:11:16,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149788859] [2019-11-15 20:11:16,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:11:16,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:16,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:16,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:11:16,998 INFO L87 Difference]: Start difference. First operand 4281 states and 4605 transitions. Second operand 3 states. [2019-11-15 20:11:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:17,850 INFO L93 Difference]: Finished difference Result 8231 states and 8877 transitions. [2019-11-15 20:11:17,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:17,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 473 [2019-11-15 20:11:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:17,871 INFO L225 Difference]: With dead ends: 8231 [2019-11-15 20:11:17,871 INFO L226 Difference]: Without dead ends: 4281 [2019-11-15 20:11:17,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 473 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-15 20:11:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2019-11-15 20:11:17,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2019-11-15 20:11:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4281 states. [2019-11-15 20:11:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 4576 transitions. [2019-11-15 20:11:17,947 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 4576 transitions. Word has length 473 [2019-11-15 20:11:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:17,948 INFO L462 AbstractCegarLoop]: Abstraction has 4281 states and 4576 transitions. [2019-11-15 20:11:17,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:11:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 4576 transitions. [2019-11-15 20:11:17,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-11-15 20:11:17,957 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:17,958 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:11:18,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:18,169 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:18,170 INFO L82 PathProgramCache]: Analyzing trace with hash 913996250, now seen corresponding path program 1 times [2019-11-15 20:11:18,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:18,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762886009] [2019-11-15 20:11:18,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:18,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:18,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-15 20:11:19,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762886009] [2019-11-15 20:11:19,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210519720] [2019-11-15 20:11:19,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:19,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:11:19,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2019-11-15 20:11:19,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:11:19,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-15 20:11:19,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511249288] [2019-11-15 20:11:19,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:11:19,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:19,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:19,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:11:19,541 INFO L87 Difference]: Start difference. First operand 4281 states and 4576 transitions. Second operand 3 states. [2019-11-15 20:11:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:20,533 INFO L93 Difference]: Finished difference Result 5270 states and 5596 transitions. [2019-11-15 20:11:20,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:20,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2019-11-15 20:11:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:20,560 INFO L225 Difference]: With dead ends: 5270 [2019-11-15 20:11:20,560 INFO L226 Difference]: Without dead ends: 5268 [2019-11-15 20:11:20,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:11:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2019-11-15 20:11:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 4610. [2019-11-15 20:11:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4610 states. [2019-11-15 20:11:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4919 transitions. [2019-11-15 20:11:20,641 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4919 transitions. Word has length 502 [2019-11-15 20:11:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:20,643 INFO L462 AbstractCegarLoop]: Abstraction has 4610 states and 4919 transitions. [2019-11-15 20:11:20,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:11:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4919 transitions. [2019-11-15 20:11:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2019-11-15 20:11:20,675 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:20,675 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:20,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:20,879 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:20,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:20,880 INFO L82 PathProgramCache]: Analyzing trace with hash -572432818, now seen corresponding path program 1 times [2019-11-15 20:11:20,880 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:20,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193503308] [2019-11-15 20:11:20,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:20,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:20,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 1378 proven. 0 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2019-11-15 20:11:21,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193503308] [2019-11-15 20:11:21,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:11:21,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:11:21,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543132461] [2019-11-15 20:11:21,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:11:21,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:21,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:11:21,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:11:21,780 INFO L87 Difference]: Start difference. First operand 4610 states and 4919 transitions. Second operand 4 states. [2019-11-15 20:11:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:23,437 INFO L93 Difference]: Finished difference Result 11521 states and 12371 transitions. [2019-11-15 20:11:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:11:23,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 871 [2019-11-15 20:11:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:23,471 INFO L225 Difference]: With dead ends: 11521 [2019-11-15 20:11:23,471 INFO L226 Difference]: Without dead ends: 7242 [2019-11-15 20:11:23,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:11:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7242 states. [2019-11-15 20:11:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7242 to 6913. [2019-11-15 20:11:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2019-11-15 20:11:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7321 transitions. [2019-11-15 20:11:23,573 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7321 transitions. Word has length 871 [2019-11-15 20:11:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:23,574 INFO L462 AbstractCegarLoop]: Abstraction has 6913 states and 7321 transitions. [2019-11-15 20:11:23,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:11:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7321 transitions. [2019-11-15 20:11:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1007 [2019-11-15 20:11:23,590 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:23,591 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:11:23,591 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:23,592 INFO L82 PathProgramCache]: Analyzing trace with hash -593800378, now seen corresponding path program 1 times [2019-11-15 20:11:23,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:23,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437033127] [2019-11-15 20:11:23,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:23,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:23,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1909 backedges. 1281 proven. 130 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2019-11-15 20:11:25,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437033127] [2019-11-15 20:11:25,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785084933] [2019-11-15 20:11:25,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:25,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:11:25,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1909 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 1634 trivial. 0 not checked. [2019-11-15 20:11:26,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:11:26,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-15 20:11:26,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155342622] [2019-11-15 20:11:26,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:11:26,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:26,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:26,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:11:26,218 INFO L87 Difference]: Start difference. First operand 6913 states and 7321 transitions. Second operand 3 states. [2019-11-15 20:11:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:27,205 INFO L93 Difference]: Finished difference Result 15469 states and 16407 transitions. [2019-11-15 20:11:27,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:27,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1006 [2019-11-15 20:11:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:27,224 INFO L225 Difference]: With dead ends: 15469 [2019-11-15 20:11:27,224 INFO L226 Difference]: Without dead ends: 8887 [2019-11-15 20:11:27,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 1006 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:11:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2019-11-15 20:11:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 7571. [2019-11-15 20:11:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2019-11-15 20:11:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 8035 transitions. [2019-11-15 20:11:27,320 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 8035 transitions. Word has length 1006 [2019-11-15 20:11:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:27,322 INFO L462 AbstractCegarLoop]: Abstraction has 7571 states and 8035 transitions. [2019-11-15 20:11:27,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:11:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 8035 transitions. [2019-11-15 20:11:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2019-11-15 20:11:27,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:27,341 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:11:27,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:27,552 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:27,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:27,553 INFO L82 PathProgramCache]: Analyzing trace with hash -497350162, now seen corresponding path program 1 times [2019-11-15 20:11:27,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:27,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052116326] [2019-11-15 20:11:27,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:27,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:27,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 1602 proven. 130 refuted. 0 times theorem prover too weak. 920 trivial. 0 not checked. [2019-11-15 20:11:29,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052116326] [2019-11-15 20:11:29,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036352356] [2019-11-15 20:11:29,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:29,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:11:29,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 1586 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-11-15 20:11:30,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:11:30,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-15 20:11:30,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387204796] [2019-11-15 20:11:30,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:11:30,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:30,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:30,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:11:30,544 INFO L87 Difference]: Start difference. First operand 7571 states and 8035 transitions. Second operand 3 states. [2019-11-15 20:11:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:31,437 INFO L93 Difference]: Finished difference Result 14811 states and 15737 transitions. [2019-11-15 20:11:31,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:31,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1103 [2019-11-15 20:11:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:31,454 INFO L225 Difference]: With dead ends: 14811 [2019-11-15 20:11:31,454 INFO L226 Difference]: Without dead ends: 7571 [2019-11-15 20:11:31,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 1103 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:11:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2019-11-15 20:11:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2019-11-15 20:11:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2019-11-15 20:11:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7970 transitions. [2019-11-15 20:11:31,533 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7970 transitions. Word has length 1103 [2019-11-15 20:11:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:31,534 INFO L462 AbstractCegarLoop]: Abstraction has 7571 states and 7970 transitions. [2019-11-15 20:11:31,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:11:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7970 transitions. [2019-11-15 20:11:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1160 [2019-11-15 20:11:31,554 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:31,555 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:31,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:31,758 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:31,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2088480148, now seen corresponding path program 1 times [2019-11-15 20:11:31,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:31,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818140293] [2019-11-15 20:11:31,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:31,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:31,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2037 backedges. 1244 proven. 4 refuted. 0 times theorem prover too weak. 789 trivial. 0 not checked. [2019-11-15 20:11:33,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818140293] [2019-11-15 20:11:33,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22790190] [2019-11-15 20:11:33,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:33,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:11:33,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2037 backedges. 1048 proven. 0 refuted. 0 times theorem prover too weak. 989 trivial. 0 not checked. [2019-11-15 20:11:34,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:11:34,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 20:11:34,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809556900] [2019-11-15 20:11:34,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:11:34,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:34,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:34,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:11:34,488 INFO L87 Difference]: Start difference. First operand 7571 states and 7970 transitions. Second operand 3 states. [2019-11-15 20:11:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:35,435 INFO L93 Difference]: Finished difference Result 15798 states and 16615 transitions. [2019-11-15 20:11:35,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:35,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1159 [2019-11-15 20:11:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:35,447 INFO L225 Difference]: With dead ends: 15798 [2019-11-15 20:11:35,447 INFO L226 Difference]: Without dead ends: 7571 [2019-11-15 20:11:35,453 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1165 GetRequests, 1158 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:11:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2019-11-15 20:11:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2019-11-15 20:11:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2019-11-15 20:11:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 7875 transitions. [2019-11-15 20:11:35,524 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 7875 transitions. Word has length 1159 [2019-11-15 20:11:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:35,525 INFO L462 AbstractCegarLoop]: Abstraction has 7571 states and 7875 transitions. [2019-11-15 20:11:35,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:11:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 7875 transitions. [2019-11-15 20:11:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1222 [2019-11-15 20:11:35,543 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:35,544 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:35,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:35,748 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1631914977, now seen corresponding path program 1 times [2019-11-15 20:11:35,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:35,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477180880] [2019-11-15 20:11:35,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:35,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:35,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1679 proven. 130 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-11-15 20:11:37,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477180880] [2019-11-15 20:11:37,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877265452] [2019-11-15 20:11:37,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:37,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:11:37,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1513 proven. 0 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2019-11-15 20:11:38,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:11:38,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-15 20:11:38,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712286097] [2019-11-15 20:11:38,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:11:38,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:38,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:38,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:11:38,926 INFO L87 Difference]: Start difference. First operand 7571 states and 7875 transitions. Second operand 3 states. [2019-11-15 20:11:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:39,756 INFO L93 Difference]: Finished difference Result 16456 states and 17131 transitions. [2019-11-15 20:11:39,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:39,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1221 [2019-11-15 20:11:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:39,773 INFO L225 Difference]: With dead ends: 16456 [2019-11-15 20:11:39,773 INFO L226 Difference]: Without dead ends: 9216 [2019-11-15 20:11:39,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1230 GetRequests, 1221 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:11:39,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2019-11-15 20:11:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216. [2019-11-15 20:11:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9216 states. [2019-11-15 20:11:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9543 transitions. [2019-11-15 20:11:39,869 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9543 transitions. Word has length 1221 [2019-11-15 20:11:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:39,869 INFO L462 AbstractCegarLoop]: Abstraction has 9216 states and 9543 transitions. [2019-11-15 20:11:39,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:11:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9543 transitions. [2019-11-15 20:11:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1607 [2019-11-15 20:11:39,896 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:39,897 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 20:11:40,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:40,105 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash 447965945, now seen corresponding path program 1 times [2019-11-15 20:11:40,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:40,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826812132] [2019-11-15 20:11:40,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:40,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:40,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 3062 proven. 0 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2019-11-15 20:11:42,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826812132] [2019-11-15 20:11:42,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:11:42,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:11:42,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937666334] [2019-11-15 20:11:42,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:11:42,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:42,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:11:42,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:11:42,810 INFO L87 Difference]: Start difference. First operand 9216 states and 9543 transitions. Second operand 6 states. [2019-11-15 20:11:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:44,557 INFO L93 Difference]: Finished difference Result 18768 states and 19451 transitions. [2019-11-15 20:11:44,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:11:44,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1606 [2019-11-15 20:11:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:44,567 INFO L225 Difference]: With dead ends: 18768 [2019-11-15 20:11:44,567 INFO L226 Difference]: Without dead ends: 9883 [2019-11-15 20:11:44,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:11:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9883 states. [2019-11-15 20:11:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9883 to 9874. [2019-11-15 20:11:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2019-11-15 20:11:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10224 transitions. [2019-11-15 20:11:44,655 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10224 transitions. Word has length 1606 [2019-11-15 20:11:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:44,657 INFO L462 AbstractCegarLoop]: Abstraction has 9874 states and 10224 transitions. [2019-11-15 20:11:44,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:11:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10224 transitions. [2019-11-15 20:11:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1693 [2019-11-15 20:11:44,685 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:44,686 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:11:44,686 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash -127619151, now seen corresponding path program 1 times [2019-11-15 20:11:44,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:44,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264958174] [2019-11-15 20:11:44,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:44,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:44,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4762 backedges. 3487 proven. 385 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2019-11-15 20:11:47,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264958174] [2019-11-15 20:11:47,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290939272] [2019-11-15 20:11:47,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:47,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1942 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:11:47,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:11:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4762 backedges. 2664 proven. 0 refuted. 0 times theorem prover too weak. 2098 trivial. 0 not checked. [2019-11-15 20:11:49,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:11:49,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-15 20:11:49,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202535434] [2019-11-15 20:11:49,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:11:49,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:49,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:49,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:11:49,183 INFO L87 Difference]: Start difference. First operand 9874 states and 10224 transitions. Second operand 3 states. [2019-11-15 20:11:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:50,008 INFO L93 Difference]: Finished difference Result 19746 states and 20456 transitions. [2019-11-15 20:11:50,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:50,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1692 [2019-11-15 20:11:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:50,017 INFO L225 Difference]: With dead ends: 19746 [2019-11-15 20:11:50,018 INFO L226 Difference]: Without dead ends: 10203 [2019-11-15 20:11:50,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1699 GetRequests, 1692 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:11:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10203 states. [2019-11-15 20:11:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10203 to 9874. [2019-11-15 20:11:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2019-11-15 20:11:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10159 transitions. [2019-11-15 20:11:50,122 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10159 transitions. Word has length 1692 [2019-11-15 20:11:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:50,124 INFO L462 AbstractCegarLoop]: Abstraction has 9874 states and 10159 transitions. [2019-11-15 20:11:50,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:11:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10159 transitions. [2019-11-15 20:11:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1838 [2019-11-15 20:11:50,173 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:50,174 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 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] [2019-11-15 20:11:50,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:11:50,378 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2094496340, now seen corresponding path program 1 times [2019-11-15 20:11:50,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:50,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32651348] [2019-11-15 20:11:50,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:50,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:50,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6373 backedges. 1708 proven. 0 refuted. 0 times theorem prover too weak. 4665 trivial. 0 not checked. [2019-11-15 20:11:52,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32651348] [2019-11-15 20:11:52,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:11:52,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:11:52,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431827199] [2019-11-15 20:11:52,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:11:52,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:11:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:11:52,927 INFO L87 Difference]: Start difference. First operand 9874 states and 10159 transitions. Second operand 5 states. [2019-11-15 20:11:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:54,893 INFO L93 Difference]: Finished difference Result 29616 states and 30529 transitions. [2019-11-15 20:11:54,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:11:54,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1837 [2019-11-15 20:11:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:54,909 INFO L225 Difference]: With dead ends: 29616 [2019-11-15 20:11:54,909 INFO L226 Difference]: Without dead ends: 19744 [2019-11-15 20:11:54,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-15 20:11:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19744 states. [2019-11-15 20:11:55,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19744 to 15138. [2019-11-15 20:11:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15138 states. [2019-11-15 20:11:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15571 transitions. [2019-11-15 20:11:55,086 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15571 transitions. Word has length 1837 [2019-11-15 20:11:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:55,086 INFO L462 AbstractCegarLoop]: Abstraction has 15138 states and 15571 transitions. [2019-11-15 20:11:55,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:11:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15571 transitions. [2019-11-15 20:11:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1982 [2019-11-15 20:11:55,117 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:55,118 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:55,119 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash -890231504, now seen corresponding path program 1 times [2019-11-15 20:11:55,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:55,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325634165] [2019-11-15 20:11:55,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:55,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:11:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6954 backedges. 4153 proven. 0 refuted. 0 times theorem prover too weak. 2801 trivial. 0 not checked. [2019-11-15 20:11:57,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325634165] [2019-11-15 20:11:57,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:11:57,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:11:57,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074301888] [2019-11-15 20:11:57,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:11:57,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:11:57,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:11:57,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:11:57,205 INFO L87 Difference]: Start difference. First operand 15138 states and 15571 transitions. Second operand 3 states. [2019-11-15 20:11:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:11:58,107 INFO L93 Difference]: Finished difference Result 31590 states and 32492 transitions. [2019-11-15 20:11:58,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:11:58,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1981 [2019-11-15 20:11:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:11:58,119 INFO L225 Difference]: With dead ends: 31590 [2019-11-15 20:11:58,119 INFO L226 Difference]: Without dead ends: 16783 [2019-11-15 20:11:58,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:11:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2019-11-15 20:11:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 16454. [2019-11-15 20:11:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16454 states. [2019-11-15 20:11:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 16881 transitions. [2019-11-15 20:11:58,278 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 16881 transitions. Word has length 1981 [2019-11-15 20:11:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:11:58,279 INFO L462 AbstractCegarLoop]: Abstraction has 16454 states and 16881 transitions. [2019-11-15 20:11:58,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:11:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 16881 transitions. [2019-11-15 20:11:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2081 [2019-11-15 20:11:58,305 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:11:58,306 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:11:58,306 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:11:58,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:11:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1261936362, now seen corresponding path program 1 times [2019-11-15 20:11:58,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:11:58,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199194687] [2019-11-15 20:11:58,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:58,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:11:58,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:11:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7352 backedges. 3755 proven. 0 refuted. 0 times theorem prover too weak. 3597 trivial. 0 not checked. [2019-11-15 20:12:00,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199194687] [2019-11-15 20:12:00,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:00,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:12:00,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243781142] [2019-11-15 20:12:00,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:12:00,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:00,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:12:00,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:12:00,476 INFO L87 Difference]: Start difference. First operand 16454 states and 16881 transitions. Second operand 4 states. [2019-11-15 20:12:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:01,837 INFO L93 Difference]: Finished difference Result 32577 states and 33429 transitions. [2019-11-15 20:12:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:12:01,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2080 [2019-11-15 20:12:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:01,847 INFO L225 Difference]: With dead ends: 32577 [2019-11-15 20:12:01,848 INFO L226 Difference]: Without dead ends: 16454 [2019-11-15 20:12:01,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:12:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2019-11-15 20:12:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 15796. [2019-11-15 20:12:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15796 states. [2019-11-15 20:12:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16104 transitions. [2019-11-15 20:12:01,968 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16104 transitions. Word has length 2080 [2019-11-15 20:12:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:01,968 INFO L462 AbstractCegarLoop]: Abstraction has 15796 states and 16104 transitions. [2019-11-15 20:12:01,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:12:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16104 transitions. [2019-11-15 20:12:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2107 [2019-11-15 20:12:01,997 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:01,998 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:12:01,998 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:01,999 INFO L82 PathProgramCache]: Analyzing trace with hash 777095257, now seen corresponding path program 1 times [2019-11-15 20:12:01,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:01,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741188845] [2019-11-15 20:12:01,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:01,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:01,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7659 backedges. 2469 proven. 4286 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-11-15 20:12:10,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741188845] [2019-11-15 20:12:10,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410447405] [2019-11-15 20:12:10,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:12:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:11,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:12:11,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:12:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7659 backedges. 4795 proven. 0 refuted. 0 times theorem prover too weak. 2864 trivial. 0 not checked. [2019-11-15 20:12:13,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:12:13,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 17 [2019-11-15 20:12:13,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213559370] [2019-11-15 20:12:13,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:12:13,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:13,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:12:13,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:12:13,616 INFO L87 Difference]: Start difference. First operand 15796 states and 16104 transitions. Second operand 4 states. [2019-11-15 20:12:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:15,028 INFO L93 Difference]: Finished difference Result 31261 states and 31875 transitions. [2019-11-15 20:12:15,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:12:15,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2106 [2019-11-15 20:12:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:15,038 INFO L225 Difference]: With dead ends: 31261 [2019-11-15 20:12:15,038 INFO L226 Difference]: Without dead ends: 15796 [2019-11-15 20:12:15,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2128 GetRequests, 2107 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:12:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2019-11-15 20:12:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 15796. [2019-11-15 20:12:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15796 states. [2019-11-15 20:12:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16100 transitions. [2019-11-15 20:12:15,149 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16100 transitions. Word has length 2106 [2019-11-15 20:12:15,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:15,150 INFO L462 AbstractCegarLoop]: Abstraction has 15796 states and 16100 transitions. [2019-11-15 20:12:15,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:12:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16100 transitions. [2019-11-15 20:12:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2324 [2019-11-15 20:12:15,187 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:15,188 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:12:15,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:12:15,389 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:15,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:15,389 INFO L82 PathProgramCache]: Analyzing trace with hash -708607397, now seen corresponding path program 1 times [2019-11-15 20:12:15,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:15,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323374576] [2019-11-15 20:12:15,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:15,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:15,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9892 backedges. 4042 proven. 792 refuted. 0 times theorem prover too weak. 5058 trivial. 0 not checked. [2019-11-15 20:12:22,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323374576] [2019-11-15 20:12:22,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191169481] [2019-11-15 20:12:22,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:12:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:22,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 2664 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:12:22,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:12:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9892 backedges. 5735 proven. 0 refuted. 0 times theorem prover too weak. 4157 trivial. 0 not checked. [2019-11-15 20:12:25,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:12:25,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-15 20:12:25,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206276957] [2019-11-15 20:12:25,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:12:25,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:25,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:12:25,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:12:25,314 INFO L87 Difference]: Start difference. First operand 15796 states and 16100 transitions. Second operand 3 states. [2019-11-15 20:12:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:26,257 INFO L93 Difference]: Finished difference Result 31590 states and 32201 transitions. [2019-11-15 20:12:26,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:12:26,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2323 [2019-11-15 20:12:26,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:26,266 INFO L225 Difference]: With dead ends: 31590 [2019-11-15 20:12:26,266 INFO L226 Difference]: Without dead ends: 16125 [2019-11-15 20:12:26,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2341 GetRequests, 2324 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:12:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2019-11-15 20:12:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 16125. [2019-11-15 20:12:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2019-11-15 20:12:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16423 transitions. [2019-11-15 20:12:26,379 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16423 transitions. Word has length 2323 [2019-11-15 20:12:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:26,381 INFO L462 AbstractCegarLoop]: Abstraction has 16125 states and 16423 transitions. [2019-11-15 20:12:26,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:12:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16423 transitions. [2019-11-15 20:12:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2537 [2019-11-15 20:12:26,425 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:26,426 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2019-11-15 20:12:26,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:12:26,626 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:26,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:26,627 INFO L82 PathProgramCache]: Analyzing trace with hash -483904904, now seen corresponding path program 1 times [2019-11-15 20:12:26,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:26,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392427775] [2019-11-15 20:12:26,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:26,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:26,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 11340 backedges. 4420 proven. 792 refuted. 0 times theorem prover too weak. 6128 trivial. 0 not checked. [2019-11-15 20:12:34,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392427775] [2019-11-15 20:12:34,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364367513] [2019-11-15 20:12:34,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:12:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:34,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 2877 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:12:34,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:12:34,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:34,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:12:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11340 backedges. 5748 proven. 0 refuted. 0 times theorem prover too weak. 5592 trivial. 0 not checked. [2019-11-15 20:12:38,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:12:38,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-15 20:12:38,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122083653] [2019-11-15 20:12:38,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:12:38,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:38,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:12:38,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:12:38,592 INFO L87 Difference]: Start difference. First operand 16125 states and 16423 transitions. Second operand 3 states. [2019-11-15 20:12:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:39,923 INFO L93 Difference]: Finished difference Result 34222 states and 34863 transitions. [2019-11-15 20:12:39,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:12:39,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2536 [2019-11-15 20:12:39,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:39,933 INFO L225 Difference]: With dead ends: 34222 [2019-11-15 20:12:39,934 INFO L226 Difference]: Without dead ends: 18428 [2019-11-15 20:12:39,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2554 GetRequests, 2537 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:12:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-11-15 20:12:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18099. [2019-11-15 20:12:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18099 states. [2019-11-15 20:12:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18422 transitions. [2019-11-15 20:12:40,064 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18422 transitions. Word has length 2536 [2019-11-15 20:12:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:40,065 INFO L462 AbstractCegarLoop]: Abstraction has 18099 states and 18422 transitions. [2019-11-15 20:12:40,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:12:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18422 transitions. [2019-11-15 20:12:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2577 [2019-11-15 20:12:40,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:40,101 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 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, 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] [2019-11-15 20:12:40,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:12:40,301 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:40,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:40,302 INFO L82 PathProgramCache]: Analyzing trace with hash -25506658, now seen corresponding path program 1 times [2019-11-15 20:12:40,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:40,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760684485] [2019-11-15 20:12:40,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:40,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:40,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 11375 backedges. 7059 proven. 825 refuted. 0 times theorem prover too weak. 3491 trivial. 0 not checked. [2019-11-15 20:12:45,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760684485] [2019-11-15 20:12:45,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807882228] [2019-11-15 20:12:45,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:12:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:46,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 2888 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:12:46,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:12:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 11375 backedges. 3882 proven. 0 refuted. 0 times theorem prover too weak. 7493 trivial. 0 not checked. [2019-11-15 20:12:50,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:12:50,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2019-11-15 20:12:50,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628085246] [2019-11-15 20:12:50,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:12:50,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:50,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:12:50,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:12:50,370 INFO L87 Difference]: Start difference. First operand 18099 states and 18422 transitions. Second operand 3 states. [2019-11-15 20:12:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:51,161 INFO L93 Difference]: Finished difference Result 35867 states and 36511 transitions. [2019-11-15 20:12:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:12:51,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2576 [2019-11-15 20:12:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:51,173 INFO L225 Difference]: With dead ends: 35867 [2019-11-15 20:12:51,173 INFO L226 Difference]: Without dead ends: 18099 [2019-11-15 20:12:51,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2585 GetRequests, 2576 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:12:51,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18099 states. [2019-11-15 20:12:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18099 to 18099. [2019-11-15 20:12:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18099 states. [2019-11-15 20:12:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18421 transitions. [2019-11-15 20:12:51,316 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18421 transitions. Word has length 2576 [2019-11-15 20:12:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:51,317 INFO L462 AbstractCegarLoop]: Abstraction has 18099 states and 18421 transitions. [2019-11-15 20:12:51,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:12:51,318 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18421 transitions. [2019-11-15 20:12:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2630 [2019-11-15 20:12:51,367 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:51,368 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2019-11-15 20:12:51,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:12:51,571 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:51,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1654722324, now seen corresponding path program 1 times [2019-11-15 20:12:51,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:51,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541448876] [2019-11-15 20:12:51,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:51,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:51,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12187 backedges. 5411 proven. 1640 refuted. 0 times theorem prover too weak. 5136 trivial. 0 not checked. [2019-11-15 20:13:00,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541448876] [2019-11-15 20:13:00,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686378186] [2019-11-15 20:13:00,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:13:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:00,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 2970 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:13:00,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:13:01,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:13:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12187 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 11635 trivial. 0 not checked. [2019-11-15 20:13:03,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:13:03,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-11-15 20:13:03,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956022582] [2019-11-15 20:13:03,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:13:03,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:03,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:13:03,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:13:03,799 INFO L87 Difference]: Start difference. First operand 18099 states and 18421 transitions. Second operand 3 states. [2019-11-15 20:13:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:04,635 INFO L93 Difference]: Finished difference Result 36852 states and 37508 transitions. [2019-11-15 20:13:04,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:13:04,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2629 [2019-11-15 20:13:04,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:04,637 INFO L225 Difference]: With dead ends: 36852 [2019-11-15 20:13:04,637 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:13:04,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2654 GetRequests, 2634 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:13:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:13:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:13:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:13:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:13:04,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2629 [2019-11-15 20:13:04,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:04,646 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:13:04,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:13:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:13:04,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:13:04,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:13:04,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:13:05,031 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 180 [2019-11-15 20:13:05,150 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 172 [2019-11-15 20:13:05,286 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 179 [2019-11-15 20:13:06,307 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 167 DAG size of output: 92 [2019-11-15 20:13:07,230 WARN L191 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 95 [2019-11-15 20:13:08,148 WARN L191 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 89 [2019-11-15 20:13:08,150 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,150 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,150 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,150 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,150 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,150 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,150 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,150 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,150 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,151 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,151 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,151 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,151 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,151 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,151 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,151 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 20:13:08,151 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,151 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 20:13:08,151 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L439 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse12 (= ~a12~0 8))) (let ((.cse3 (<= ~a16~0 11)) (.cse0 (= 3 ~a15~0)) (.cse1 (not .cse12)) (.cse19 (+ ~a18~0 79))) (let ((.cse7 (<= 10 ~a16~0)) (.cse11 (<= 0 (+ ~a18~0 155))) (.cse6 (exists ((v_~a18~0_901 Int)) (let ((.cse21 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse20 (* 5 .cse21))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse20) (<= (div (* .cse21 5) 5) ~a18~0) (<= 0 .cse20)))))) (.cse14 (= ~a12~0 7)) (.cse8 (<= ~a16~0 9)) (.cse2 (< 0 .cse19)) (.cse4 (<= 4 ~a15~0)) (.cse10 (<= .cse19 0)) (.cse17 (and .cse3 .cse0 .cse1)) (.cse18 (= ~a12~0 6)) (.cse5 (= 5 ~a12~0)) (.cse15 (= ~a16~0 8)) (.cse16 (<= (+ ~a18~0 156) 0)) (.cse9 (not (= 7 ~a12~0)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse8 .cse9 .cse1 .cse10) (and .cse11 .cse4 .cse8 .cse12) (and .cse0 (<= 28 ~a18~0)) (and .cse0 .cse12 .cse7) (let ((.cse13 (+ ~a18~0 87))) (and (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse5 (<= .cse13 0) (<= 0 .cse13) (= ~a16~0 11) .cse0)) (and .cse14 .cse11 .cse0) (and .cse15 .cse4 .cse6) (and .cse16 .cse4 .cse8 .cse1) (and .cse15 .cse4 .cse12) (and .cse17 .cse8) (and (and .cse14 .cse4 .cse2) .cse8) (and .cse15 .cse4 (or (<= ~a18~0 134) (and (= ~a15~0 4) (= ~a12~0 5))) .cse2) (and .cse3 .cse4 .cse18) (and .cse3 .cse4 .cse5 .cse10) (and .cse17 .cse18) (and (<= 12 ~a16~0) .cse5 .cse0) (and .cse15 .cse0) (and .cse16 .cse0 .cse9))))) [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 20:13:08,152 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,153 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,154 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 20:13:08,155 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 20:13:08,155 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,155 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 20:13:08,155 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,155 INFO L439 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse12 (= ~a12~0 8))) (let ((.cse5 (<= ~a16~0 11)) (.cse0 (= 3 ~a15~0)) (.cse1 (not .cse12)) (.cse20 (+ ~a18~0 79))) (let ((.cse8 (exists ((v_~a18~0_901 Int)) (let ((.cse22 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse21 (* 5 .cse22))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse21) (<= (div (* .cse22 5) 5) ~a18~0) (<= 0 .cse21)))))) (.cse9 (<= 10 ~a16~0)) (.cse3 (<= ~a16~0 9)) (.cse2 (< 0 .cse20)) (.cse17 (= ~a12~0 7)) (.cse11 (<= 0 (+ ~a18~0 155))) (.cse15 (<= .cse20 0)) (.cse4 (and .cse5 .cse0 .cse1)) (.cse18 (= ~a12~0 6)) (.cse7 (= 5 ~a12~0)) (.cse6 (<= 4 ~a15~0)) (.cse16 (<= (+ ~a18~0 156) 0)) (.cse14 (not (= 7 ~a12~0))) (.cse10 (= ~a16~0 8))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse6 .cse8) (and .cse0 (<= 28 ~a18~0)) (and .cse11 .cse6 .cse3 .cse12) (and .cse0 .cse12 .cse9) (let ((.cse13 (+ ~a18~0 87))) (and (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse7 (<= .cse13 0) (<= 0 .cse13) (= ~a16~0 11) .cse0)) (and .cse6 .cse3 .cse14 .cse15 .cse1) (and .cse16 .cse6 .cse3 .cse1) (and .cse3 (and .cse17 .cse6 .cse2)) (and .cse5 .cse6 .cse18) (and .cse17 .cse11 .cse0) (and .cse5 .cse6 .cse7 .cse15) (and .cse4 .cse18) (and (<= 12 ~a16~0) .cse7 .cse0) (and (let ((.cse19 (<= ~a18~0 134))) (and .cse10 .cse6 (or .cse19 (and (= ~a15~0 4) (= ~a12~0 5))) (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse19))) .cse14) (and .cse16 .cse0 .cse14) (and .cse10 .cse0))))) [2019-11-15 20:13:08,155 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,155 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2019-11-15 20:13:08,155 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,155 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,155 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,156 INFO L446 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-11-15 20:13:08,156 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 20:13:08,157 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 20:13:08,158 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 20:13:08,159 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 20:13:08,159 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse12 (= ~a12~0 8))) (let ((.cse3 (<= ~a16~0 11)) (.cse0 (= 3 ~a15~0)) (.cse1 (not .cse12)) (.cse19 (+ ~a18~0 79))) (let ((.cse7 (<= 10 ~a16~0)) (.cse11 (<= 0 (+ ~a18~0 155))) (.cse6 (exists ((v_~a18~0_901 Int)) (let ((.cse21 (div (* v_~a18~0_901 10) (- 5)))) (let ((.cse20 (* 5 .cse21))) (and (<= (+ v_~a18~0_901 79) 0) (<= 5 .cse20) (<= (div (* .cse21 5) 5) ~a18~0) (<= 0 .cse20)))))) (.cse13 (= ~a12~0 7)) (.cse8 (<= ~a16~0 9)) (.cse2 (< 0 .cse19)) (.cse4 (<= 4 ~a15~0)) (.cse10 (<= .cse19 0)) (.cse17 (and .cse3 .cse0 .cse1)) (.cse18 (= ~a12~0 6)) (.cse5 (= 5 ~a12~0)) (.cse15 (= ~a16~0 8)) (.cse16 (<= (+ ~a18~0 156) 0)) (.cse9 (not (= 7 ~a12~0)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse8 .cse9 .cse1 .cse10) (and .cse11 .cse4 .cse8 .cse12) (and .cse0 (<= 28 ~a18~0)) (and .cse0 .cse12 .cse7) (and .cse13 .cse11 .cse0) (let ((.cse14 (+ ~a18~0 87))) (and .cse5 (<= .cse14 0) (<= 0 .cse14) (= ~a16~0 11) .cse0)) (and .cse15 .cse4 .cse6) (and .cse16 .cse4 .cse8 .cse1) (and .cse15 .cse4 .cse12) (and .cse17 .cse8) (and (and .cse13 .cse4 .cse2) .cse8) (and .cse15 .cse4 (or (<= ~a18~0 134) (and (= ~a15~0 4) (= ~a12~0 5))) .cse2) (and .cse3 .cse4 .cse18) (and .cse3 .cse4 .cse5 .cse10) (and .cse17 .cse18) (and (<= 12 ~a16~0) .cse5 .cse0) (and .cse15 .cse0) (and .cse16 .cse0 .cse9))))) [2019-11-15 20:13:08,159 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,159 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,159 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,159 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,159 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,159 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,159 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,159 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,159 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,159 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,160 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,161 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,162 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,163 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,164 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 20:13:08,165 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 20:13:08,165 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,165 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,165 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,165 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,165 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,165 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,165 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,166 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,166 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,166 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,166 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,166 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,166 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,166 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,166 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-15 20:13:08,167 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 20:13:08,167 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 20:13:08,167 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,167 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,167 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,167 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,167 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,168 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,168 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,168 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,168 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,168 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,168 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,168 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,169 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,169 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,169 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,169 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 20:13:08,169 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 20:13:08,169 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,169 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,170 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,170 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,170 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,170 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,170 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,170 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,170 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,170 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,171 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,171 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,171 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 20:13:08,171 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 20:13:08,171 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,171 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,171 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,171 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,172 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,172 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,172 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,172 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,172 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,172 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,172 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,172 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,173 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,174 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-15 20:13:08,175 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,176 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,177 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,177 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,177 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,177 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,177 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 20:13:08,177 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 20:13:08,177 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:13:08,177 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 20:13:08,177 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,178 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,179 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,179 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,179 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 20:13:08,179 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 20:13:08,179 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 20:13:08,179 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,179 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,179 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,179 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,179 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,180 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,180 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,180 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,180 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-11-15 20:13:08,180 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,180 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 20:13:08,180 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 20:13:08,181 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 20:13:08,181 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,181 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-11-15 20:13:08,181 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,181 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-11-15 20:13:08,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:13:08 BoogieIcfgContainer [2019-11-15 20:13:08,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:13:08,230 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:13:08,230 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:13:08,230 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:13:08,231 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:11:02" (3/4) ... [2019-11-15 20:13:08,234 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:13:08,267 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 20:13:08,271 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:13:08,300 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((3 == a15 && !(a12 == 8)) && 0 < a18 + 79) || ((((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 10 <= a16)) || ((((4 <= a15 && a16 <= 9) && !(7 == a12)) && !(a12 == 8)) && a18 + 79 <= 0)) || (((0 <= a18 + 155 && 4 <= a15) && a16 <= 9) && a12 == 8)) || (3 == a15 && 28 <= a18)) || ((3 == a15 && a12 == 8) && 10 <= a16)) || ((a12 == 7 && 0 <= a18 + 155) && 3 == a15)) || ((((5 == a12 && a18 + 87 <= 0) && 0 <= a18 + 87) && a16 == 11) && 3 == a15)) || ((a16 == 8 && 4 <= a15) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || (((a18 + 156 <= 0 && 4 <= a15) && a16 <= 9) && !(a12 == 8))) || ((a16 == 8 && 4 <= a15) && a12 == 8)) || (((a16 <= 11 && 3 == a15) && !(a12 == 8)) && a16 <= 9)) || (((a12 == 7 && 4 <= a15) && 0 < a18 + 79) && a16 <= 9)) || (((a16 == 8 && 4 <= a15) && (a18 <= 134 || (a15 == 4 && a12 == 5))) && 0 < a18 + 79)) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || (((a16 <= 11 && 3 == a15) && !(a12 == 8)) && a12 == 6)) || ((12 <= a16 && 5 == a12) && 3 == a15)) || (a16 == 8 && 3 == a15)) || ((a18 + 156 <= 0 && 3 == a15) && !(7 == a12)) [2019-11-15 20:13:08,303 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((3 == a15 && !(a12 == 8)) && 0 < a18 + 79) || ((((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 10 <= a16)) || ((((4 <= a15 && a16 <= 9) && !(7 == a12)) && !(a12 == 8)) && a18 + 79 <= 0)) || (((0 <= a18 + 155 && 4 <= a15) && a16 <= 9) && a12 == 8)) || (3 == a15 && 28 <= a18)) || ((3 == a15 && a12 == 8) && 10 <= a16)) || (((((!(6 == input) && 5 == a12) && a18 + 87 <= 0) && 0 <= a18 + 87) && a16 == 11) && 3 == a15)) || ((a12 == 7 && 0 <= a18 + 155) && 3 == a15)) || ((a16 == 8 && 4 <= a15) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || (((a18 + 156 <= 0 && 4 <= a15) && a16 <= 9) && !(a12 == 8))) || ((a16 == 8 && 4 <= a15) && a12 == 8)) || (((a16 <= 11 && 3 == a15) && !(a12 == 8)) && a16 <= 9)) || (((a12 == 7 && 4 <= a15) && 0 < a18 + 79) && a16 <= 9)) || (((a16 == 8 && 4 <= a15) && (a18 <= 134 || (a15 == 4 && a12 == 5))) && 0 < a18 + 79)) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || (((a16 <= 11 && 3 == a15) && !(a12 == 8)) && a12 == 6)) || ((12 <= a16 && 5 == a12) && 3 == a15)) || (a16 == 8 && 3 == a15)) || ((a18 + 156 <= 0 && 3 == a15) && !(7 == a12)) [2019-11-15 20:13:08,312 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((3 == a15 && !(a12 == 8)) && 0 < a18 + 79) || (a16 <= 9 && (a16 <= 11 && 3 == a15) && !(a12 == 8))) || ((((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 10 <= a16)) || ((a16 == 8 && 4 <= a15) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || (3 == a15 && 28 <= a18)) || (((0 <= a18 + 155 && 4 <= a15) && a16 <= 9) && a12 == 8)) || ((3 == a15 && a12 == 8) && 10 <= a16)) || (((((!(6 == input) && 5 == a12) && a18 + 87 <= 0) && 0 <= a18 + 87) && a16 == 11) && 3 == a15)) || ((((4 <= a15 && a16 <= 9) && !(7 == a12)) && a18 + 79 <= 0) && !(a12 == 8))) || (((a18 + 156 <= 0 && 4 <= a15) && a16 <= 9) && !(a12 == 8))) || (a16 <= 9 && (a12 == 7 && 4 <= a15) && 0 < a18 + 79)) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || ((a12 == 7 && 0 <= a18 + 155) && 3 == a15)) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || (((a16 <= 11 && 3 == a15) && !(a12 == 8)) && a12 == 6)) || ((12 <= a16 && 5 == a12) && 3 == a15)) || ((((a16 == 8 && 4 <= a15) && (a18 <= 134 || (a15 == 4 && a12 == 5))) && (!(3 == input) || a18 <= 134)) && !(7 == a12))) || ((a18 + 156 <= 0 && 3 == a15) && !(7 == a12))) || (a16 == 8 && 3 == a15) [2019-11-15 20:13:08,480 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3cf710db-8acc-499a-b904-19dc7978b509/bin/uautomizer/witness.graphml [2019-11-15 20:13:08,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:13:08,482 INFO L168 Benchmark]: Toolchain (without parser) took 129713.28 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 938.0 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-15 20:13:08,482 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:13:08,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1045.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -99.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:08,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:08,483 INFO L168 Benchmark]: Boogie Preprocessor took 154.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:08,484 INFO L168 Benchmark]: RCFGBuilder took 2418.10 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 133.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -177.1 MB). Peak memory consumption was 262.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:08,484 INFO L168 Benchmark]: TraceAbstraction took 125685.70 ms. Allocated memory was 1.3 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-15 20:13:08,484 INFO L168 Benchmark]: Witness Printer took 250.61 ms. Allocated memory is still 4.9 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:08,486 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.45 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1045.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -99.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 154.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 154.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2418.10 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 133.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -177.1 MB). Peak memory consumption was 262.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 125685.70 ms. Allocated memory was 1.3 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 250.61 ms. Allocated memory is still 4.9 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 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_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 151]: 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: 23]: Loop Invariant [2019-11-15 20:13:08,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((3 == a15 && !(a12 == 8)) && 0 < a18 + 79) || ((((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 10 <= a16)) || ((((4 <= a15 && a16 <= 9) && !(7 == a12)) && !(a12 == 8)) && a18 + 79 <= 0)) || (((0 <= a18 + 155 && 4 <= a15) && a16 <= 9) && a12 == 8)) || (3 == a15 && 28 <= a18)) || ((3 == a15 && a12 == 8) && 10 <= a16)) || (((((!(6 == input) && 5 == a12) && a18 + 87 <= 0) && 0 <= a18 + 87) && a16 == 11) && 3 == a15)) || ((a12 == 7 && 0 <= a18 + 155) && 3 == a15)) || ((a16 == 8 && 4 <= a15) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || (((a18 + 156 <= 0 && 4 <= a15) && a16 <= 9) && !(a12 == 8))) || ((a16 == 8 && 4 <= a15) && a12 == 8)) || (((a16 <= 11 && 3 == a15) && !(a12 == 8)) && a16 <= 9)) || (((a12 == 7 && 4 <= a15) && 0 < a18 + 79) && a16 <= 9)) || (((a16 == 8 && 4 <= a15) && (a18 <= 134 || (a15 == 4 && a12 == 5))) && 0 < a18 + 79)) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || (((a16 <= 11 && 3 == a15) && !(a12 == 8)) && a12 == 6)) || ((12 <= a16 && 5 == a12) && 3 == a15)) || (a16 == 8 && 3 == a15)) || ((a18 + 156 <= 0 && 3 == a15) && !(7 == a12)) - InvariantResult [Line: 1494]: Loop Invariant [2019-11-15 20:13:08,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] Derived loop invariant: (((((((((((((((((((3 == a15 && !(a12 == 8)) && 0 < a18 + 79) || (a16 <= 9 && (a16 <= 11 && 3 == a15) && !(a12 == 8))) || ((((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 10 <= a16)) || ((a16 == 8 && 4 <= a15) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || (3 == a15 && 28 <= a18)) || (((0 <= a18 + 155 && 4 <= a15) && a16 <= 9) && a12 == 8)) || ((3 == a15 && a12 == 8) && 10 <= a16)) || (((((!(6 == input) && 5 == a12) && a18 + 87 <= 0) && 0 <= a18 + 87) && a16 == 11) && 3 == a15)) || ((((4 <= a15 && a16 <= 9) && !(7 == a12)) && a18 + 79 <= 0) && !(a12 == 8))) || (((a18 + 156 <= 0 && 4 <= a15) && a16 <= 9) && !(a12 == 8))) || (a16 <= 9 && (a12 == 7 && 4 <= a15) && 0 < a18 + 79)) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || ((a12 == 7 && 0 <= a18 + 155) && 3 == a15)) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || (((a16 <= 11 && 3 == a15) && !(a12 == 8)) && a12 == 6)) || ((12 <= a16 && 5 == a12) && 3 == a15)) || ((((a16 == 8 && 4 <= a15) && (a18 <= 134 || (a15 == 4 && a12 == 5))) && (!(3 == input) || a18 <= 134)) && !(7 == a12))) || ((a18 + 156 <= 0 && 3 == a15) && !(7 == a12))) || (a16 == 8 && 3 == a15) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2019-11-15 20:13:08,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] [2019-11-15 20:13:08,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_901,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((3 == a15 && !(a12 == 8)) && 0 < a18 + 79) || ((((a16 <= 11 && 4 <= a15) && 5 == a12) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5))) && 10 <= a16)) || ((((4 <= a15 && a16 <= 9) && !(7 == a12)) && !(a12 == 8)) && a18 + 79 <= 0)) || (((0 <= a18 + 155 && 4 <= a15) && a16 <= 9) && a12 == 8)) || (3 == a15 && 28 <= a18)) || ((3 == a15 && a12 == 8) && 10 <= a16)) || ((a12 == 7 && 0 <= a18 + 155) && 3 == a15)) || ((((5 == a12 && a18 + 87 <= 0) && 0 <= a18 + 87) && a16 == 11) && 3 == a15)) || ((a16 == 8 && 4 <= a15) && (\exists v_~a18~0_901 : int :: ((v_~a18~0_901 + 79 <= 0 && 5 <= 5 * (v_~a18~0_901 * 10 / -5)) && v_~a18~0_901 * 10 / -5 * 5 / 5 <= a18) && 0 <= 5 * (v_~a18~0_901 * 10 / -5)))) || (((a18 + 156 <= 0 && 4 <= a15) && a16 <= 9) && !(a12 == 8))) || ((a16 == 8 && 4 <= a15) && a12 == 8)) || (((a16 <= 11 && 3 == a15) && !(a12 == 8)) && a16 <= 9)) || (((a12 == 7 && 4 <= a15) && 0 < a18 + 79) && a16 <= 9)) || (((a16 == 8 && 4 <= a15) && (a18 <= 134 || (a15 == 4 && a12 == 5))) && 0 < a18 + 79)) || ((a16 <= 11 && 4 <= a15) && a12 == 6)) || (((a16 <= 11 && 4 <= a15) && 5 == a12) && a18 + 79 <= 0)) || (((a16 <= 11 && 3 == a15) && !(a12 == 8)) && a12 == 6)) || ((12 <= a16 && 5 == a12) && 3 == a15)) || (a16 == 8 && 3 == a15)) || ((a18 + 156 <= 0 && 3 == a15) && !(7 == a12)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Result: SAFE, OverallTime: 125.5s, OverallIterations: 22, TraceHistogramMax: 13, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, HoareTripleCheckerStatistics: 5145 SDtfs, 7204 SDslu, 191 SDs, 0 SdLazy, 25031 SolverSat, 3113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19873 GetRequests, 19700 SyntacticMatches, 44 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18099occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 8574 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 202 NumberOfFragments, 1027 HoareAnnotationTreeSize, 4 FomulaSimplifications, 9986 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 6461 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 48524 NumberOfCodeBlocks, 48524 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 48489 ConstructedInterpolants, 111 QuantifiedInterpolants, 255472801 SizeOfPredicates, 6 NumberOfNonLiveVariables, 22605 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 35 InterpolantComputations, 22 PerfectInterpolantSequences, 153259/162453 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...