./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label23.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_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label23.c -s /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/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 32be2810d9c37c4b52439355c8a9e3577edf70e1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:04:12,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:04:12,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:04:12,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:04:12,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:04:12,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:04:12,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:04:12,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:04:12,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:04:12,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:04:12,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:04:12,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:04:12,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:04:12,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:04:12,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:04:12,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:04:12,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:04:12,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:04:12,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:04:12,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:04:12,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:04:12,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:04:12,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:04:12,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:04:12,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:04:12,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:04:12,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:04:12,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:04:12,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:04:12,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:04:12,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:04:12,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:04:12,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:04:12,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:04:12,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:04:12,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:04:12,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:04:12,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:04:12,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:04:12,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:04:12,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:04:12,754 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:04:12,767 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:04:12,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:04:12,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:04:12,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:04:12,772 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:04:12,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:04:12,772 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:04:12,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:04:12,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:04:12,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:04:12,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:04:12,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:04:12,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:04:12,775 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:04:12,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:04:12,775 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:04:12,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:04:12,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:04:12,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:04:12,776 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:04:12,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:04:12,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:04:12,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:04:12,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:04:12,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:04:12,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:04:12,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:04:12,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:04:12,778 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_edfd147b-4d06-4add-bb0d-980f8746f8ef/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 -> 32be2810d9c37c4b52439355c8a9e3577edf70e1 [2019-11-15 23:04:12,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:04:12,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:04:12,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:04:12,819 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:04:12,820 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:04:12,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label23.c [2019-11-15 23:04:12,889 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/data/65f40f9b8/5c25fd436a6649e19a9e6a64a9e6bcbc/FLAG025c9df72 [2019-11-15 23:04:13,359 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:04:13,359 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/sv-benchmarks/c/eca-rers2012/Problem01_label23.c [2019-11-15 23:04:13,375 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/data/65f40f9b8/5c25fd436a6649e19a9e6a64a9e6bcbc/FLAG025c9df72 [2019-11-15 23:04:13,590 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/data/65f40f9b8/5c25fd436a6649e19a9e6a64a9e6bcbc [2019-11-15 23:04:13,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:04:13,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:04:13,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:04:13,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:04:13,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:04:13,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:04:13" (1/1) ... [2019-11-15 23:04:13,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30af59e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:13, skipping insertion in model container [2019-11-15 23:04:13,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:04:13" (1/1) ... [2019-11-15 23:04:13,611 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:04:13,672 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:04:14,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:04:14,171 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:04:14,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:04:14,291 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:04:14,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14 WrapperNode [2019-11-15 23:04:14,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:04:14,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:04:14,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:04:14,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:04:14,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14" (1/1) ... [2019-11-15 23:04:14,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14" (1/1) ... [2019-11-15 23:04:14,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:04:14,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:04:14,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:04:14,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:04:14,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14" (1/1) ... [2019-11-15 23:04:14,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14" (1/1) ... [2019-11-15 23:04:14,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14" (1/1) ... [2019-11-15 23:04:14,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14" (1/1) ... [2019-11-15 23:04:14,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14" (1/1) ... [2019-11-15 23:04:14,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14" (1/1) ... [2019-11-15 23:04:14,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14" (1/1) ... [2019-11-15 23:04:14,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:04:14,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:04:14,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:04:14,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:04:14,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:04:14,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:04:14,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:04:15,657 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:04:15,657 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:04:15,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:04:15 BoogieIcfgContainer [2019-11-15 23:04:15,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:04:15,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:04:15,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:04:15,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:04:15,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:04:13" (1/3) ... [2019-11-15 23:04:15,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ad12a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:04:15, skipping insertion in model container [2019-11-15 23:04:15,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:14" (2/3) ... [2019-11-15 23:04:15,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ad12a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:04:15, skipping insertion in model container [2019-11-15 23:04:15,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:04:15" (3/3) ... [2019-11-15 23:04:15,668 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label23.c [2019-11-15 23:04:15,677 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:04:15,685 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:04:15,695 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:04:15,733 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:04:15,734 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:04:15,734 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:04:15,734 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:04:15,734 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:04:15,734 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:04:15,734 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:04:15,736 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:04:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-15 23:04:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:04:15,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:04:15,767 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:04:15,769 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:04:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1911993682, now seen corresponding path program 1 times [2019-11-15 23:04:15,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:15,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755084077] [2019-11-15 23:04:15,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:15,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:15,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:04:16,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755084077] [2019-11-15 23:04:16,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:16,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:04:16,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908881982] [2019-11-15 23:04:16,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:04:16,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:16,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:04:16,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:04:16,173 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-15 23:04:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:17,466 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-15 23:04:17,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:04:17,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 23:04:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:04:17,494 INFO L225 Difference]: With dead ends: 662 [2019-11-15 23:04:17,494 INFO L226 Difference]: Without dead ends: 397 [2019-11-15 23:04:17,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:04:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-15 23:04:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-15 23:04:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-15 23:04:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-11-15 23:04:17,581 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 95 [2019-11-15 23:04:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:04:17,587 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-11-15 23:04:17,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:04:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-11-15 23:04:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 23:04:17,598 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:04:17,598 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:04:17,599 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:04:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:17,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1528488005, now seen corresponding path program 1 times [2019-11-15 23:04:17,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:17,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447189580] [2019-11-15 23:04:17,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:17,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:17,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:04:17,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447189580] [2019-11-15 23:04:17,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:17,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:04:17,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369939608] [2019-11-15 23:04:17,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:04:17,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:17,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:04:17,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:04:17,775 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-11-15 23:04:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:18,567 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-11-15 23:04:18,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:04:18,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 23:04:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:04:18,575 INFO L225 Difference]: With dead ends: 1447 [2019-11-15 23:04:18,575 INFO L226 Difference]: Without dead ends: 1052 [2019-11-15 23:04:18,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:04:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-15 23:04:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-11-15 23:04:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-15 23:04:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-11-15 23:04:18,610 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 102 [2019-11-15 23:04:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:04:18,611 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-11-15 23:04:18,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:04:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-11-15 23:04:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-15 23:04:18,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:04:18,613 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:04:18,614 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:04:18,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:18,614 INFO L82 PathProgramCache]: Analyzing trace with hash 196968702, now seen corresponding path program 1 times [2019-11-15 23:04:18,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:18,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558960020] [2019-11-15 23:04:18,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:18,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:18,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:04:18,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558960020] [2019-11-15 23:04:18,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:18,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:04:18,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174542794] [2019-11-15 23:04:18,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:04:18,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:18,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:04:18,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:04:18,752 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-11-15 23:04:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:19,447 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-11-15 23:04:19,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:04:19,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-15 23:04:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:04:19,452 INFO L225 Difference]: With dead ends: 1578 [2019-11-15 23:04:19,452 INFO L226 Difference]: Without dead ends: 790 [2019-11-15 23:04:19,454 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 23:04:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-15 23:04:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-15 23:04:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-15 23:04:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-11-15 23:04:19,474 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 116 [2019-11-15 23:04:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:04:19,474 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-11-15 23:04:19,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:04:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-11-15 23:04:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 23:04:19,476 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:04:19,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:04:19,477 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:04:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash -415435549, now seen corresponding path program 1 times [2019-11-15 23:04:19,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:19,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077605812] [2019-11-15 23:04:19,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:19,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:19,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:04:19,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077605812] [2019-11-15 23:04:19,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:19,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:04:19,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554748466] [2019-11-15 23:04:19,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:04:19,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:19,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:04:19,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:04:19,559 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-11-15 23:04:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:20,070 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-11-15 23:04:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:04:20,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-15 23:04:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:04:20,078 INFO L225 Difference]: With dead ends: 2233 [2019-11-15 23:04:20,078 INFO L226 Difference]: Without dead ends: 1445 [2019-11-15 23:04:20,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:04:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-15 23:04:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-15 23:04:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-15 23:04:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1374 transitions. [2019-11-15 23:04:20,111 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1374 transitions. Word has length 117 [2019-11-15 23:04:20,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:04:20,112 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1374 transitions. [2019-11-15 23:04:20,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:04:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1374 transitions. [2019-11-15 23:04:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 23:04:20,115 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:04:20,115 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:04:20,115 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:04:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash -566505045, now seen corresponding path program 1 times [2019-11-15 23:04:20,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:20,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179647402] [2019-11-15 23:04:20,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:20,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:20,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:04:20,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179647402] [2019-11-15 23:04:20,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:20,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:04:20,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656366583] [2019-11-15 23:04:20,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:04:20,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:20,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:04:20,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:04:20,166 INFO L87 Difference]: Start difference. First operand 1183 states and 1374 transitions. Second operand 3 states. [2019-11-15 23:04:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:20,751 INFO L93 Difference]: Finished difference Result 3150 states and 3674 transitions. [2019-11-15 23:04:20,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:04:20,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 23:04:20,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:04:20,763 INFO L225 Difference]: With dead ends: 3150 [2019-11-15 23:04:20,763 INFO L226 Difference]: Without dead ends: 1969 [2019-11-15 23:04:20,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:04:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-15 23:04:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-15 23:04:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-15 23:04:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1842 transitions. [2019-11-15 23:04:20,810 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1842 transitions. Word has length 121 [2019-11-15 23:04:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:04:20,812 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1842 transitions. [2019-11-15 23:04:20,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:04:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1842 transitions. [2019-11-15 23:04:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 23:04:20,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:04:20,815 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-15 23:04:20,816 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:04:20,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:20,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1960003089, now seen corresponding path program 1 times [2019-11-15 23:04:20,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:20,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343214935] [2019-11-15 23:04:20,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:20,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:20,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:04:20,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343214935] [2019-11-15 23:04:20,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:20,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:04:20,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702821589] [2019-11-15 23:04:20,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:04:20,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:20,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:04:20,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:04:20,873 INFO L87 Difference]: Start difference. First operand 1576 states and 1842 transitions. Second operand 3 states. [2019-11-15 23:04:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:21,301 INFO L93 Difference]: Finished difference Result 3281 states and 3834 transitions. [2019-11-15 23:04:21,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:04:21,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-15 23:04:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:04:21,310 INFO L225 Difference]: With dead ends: 3281 [2019-11-15 23:04:21,310 INFO L226 Difference]: Without dead ends: 1707 [2019-11-15 23:04:21,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:04:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-15 23:04:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-11-15 23:04:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-15 23:04:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1842 transitions. [2019-11-15 23:04:21,348 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1842 transitions. Word has length 123 [2019-11-15 23:04:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:04:21,348 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1842 transitions. [2019-11-15 23:04:21,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:04:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1842 transitions. [2019-11-15 23:04:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-15 23:04:21,352 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:04:21,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:04:21,352 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:04:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:21,353 INFO L82 PathProgramCache]: Analyzing trace with hash -233111406, now seen corresponding path program 1 times [2019-11-15 23:04:21,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:21,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155350489] [2019-11-15 23:04:21,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:21,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:21,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:04:21,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155350489] [2019-11-15 23:04:21,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:21,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:04:21,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64373465] [2019-11-15 23:04:21,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:04:21,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:21,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:04:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:04:21,405 INFO L87 Difference]: Start difference. First operand 1576 states and 1842 transitions. Second operand 3 states. [2019-11-15 23:04:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:21,848 INFO L93 Difference]: Finished difference Result 3543 states and 4112 transitions. [2019-11-15 23:04:21,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:04:21,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-15 23:04:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:04:21,858 INFO L225 Difference]: With dead ends: 3543 [2019-11-15 23:04:21,858 INFO L226 Difference]: Without dead ends: 1969 [2019-11-15 23:04:21,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:04:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-15 23:04:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-15 23:04:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-15 23:04:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2125 transitions. [2019-11-15 23:04:21,898 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2125 transitions. Word has length 124 [2019-11-15 23:04:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:04:21,898 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2125 transitions. [2019-11-15 23:04:21,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:04:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2125 transitions. [2019-11-15 23:04:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-15 23:04:21,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:04:21,902 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:04:21,903 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:04:21,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:21,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1809298122, now seen corresponding path program 1 times [2019-11-15 23:04:21,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:21,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689072256] [2019-11-15 23:04:21,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:21,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:21,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:04:22,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689072256] [2019-11-15 23:04:22,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:22,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:04:22,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940723472] [2019-11-15 23:04:22,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:04:22,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:22,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:04:22,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:04:22,085 INFO L87 Difference]: Start difference. First operand 1838 states and 2125 transitions. Second operand 8 states. [2019-11-15 23:04:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:23,025 INFO L93 Difference]: Finished difference Result 3847 states and 4440 transitions. [2019-11-15 23:04:23,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:04:23,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-11-15 23:04:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:04:23,037 INFO L225 Difference]: With dead ends: 3847 [2019-11-15 23:04:23,037 INFO L226 Difference]: Without dead ends: 2142 [2019-11-15 23:04:23,040 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:04:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-15 23:04:23,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1838. [2019-11-15 23:04:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-15 23:04:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2113 transitions. [2019-11-15 23:04:23,083 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2113 transitions. Word has length 128 [2019-11-15 23:04:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:04:23,083 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2113 transitions. [2019-11-15 23:04:23,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:04:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2113 transitions. [2019-11-15 23:04:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 23:04:23,087 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:04:23,088 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-15 23:04:23,088 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:04:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1337337613, now seen corresponding path program 1 times [2019-11-15 23:04:23,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:23,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953299993] [2019-11-15 23:04:23,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:23,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:23,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 23:04:23,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953299993] [2019-11-15 23:04:23,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:23,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:04:23,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114020613] [2019-11-15 23:04:23,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:04:23,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:04:23,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:04:23,158 INFO L87 Difference]: Start difference. First operand 1838 states and 2113 transitions. Second operand 3 states. [2019-11-15 23:04:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:23,561 INFO L93 Difference]: Finished difference Result 3674 states and 4222 transitions. [2019-11-15 23:04:23,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:04:23,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-15 23:04:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:04:23,568 INFO L225 Difference]: With dead ends: 3674 [2019-11-15 23:04:23,568 INFO L226 Difference]: Without dead ends: 1838 [2019-11-15 23:04:23,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:04:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-15 23:04:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-15 23:04:23,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-15 23:04:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1848 transitions. [2019-11-15 23:04:23,605 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1848 transitions. Word has length 151 [2019-11-15 23:04:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:04:23,605 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1848 transitions. [2019-11-15 23:04:23,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:04:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1848 transitions. [2019-11-15 23:04:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 23:04:23,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:04:23,609 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:04:23,609 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:04:23,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:23,610 INFO L82 PathProgramCache]: Analyzing trace with hash -628114179, now seen corresponding path program 1 times [2019-11-15 23:04:23,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:23,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072644463] [2019-11-15 23:04:23,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:23,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:23,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:04:23,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072644463] [2019-11-15 23:04:23,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:23,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:04:23,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915803428] [2019-11-15 23:04:23,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:04:23,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:04:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:04:23,773 INFO L87 Difference]: Start difference. First operand 1707 states and 1848 transitions. Second operand 4 states. [2019-11-15 23:04:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:24,294 INFO L93 Difference]: Finished difference Result 3412 states and 3707 transitions. [2019-11-15 23:04:24,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:04:24,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-15 23:04:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:04:24,301 INFO L225 Difference]: With dead ends: 3412 [2019-11-15 23:04:24,301 INFO L226 Difference]: Without dead ends: 1838 [2019-11-15 23:04:24,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:04:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-15 23:04:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-15 23:04:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-15 23:04:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1960 transitions. [2019-11-15 23:04:24,339 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1960 transitions. Word has length 154 [2019-11-15 23:04:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:04:24,339 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1960 transitions. [2019-11-15 23:04:24,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:04:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1960 transitions. [2019-11-15 23:04:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 23:04:24,343 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:04:24,343 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-15 23:04:24,343 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:04:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:24,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1620802140, now seen corresponding path program 1 times [2019-11-15 23:04:24,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:24,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243787103] [2019-11-15 23:04:24,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:24,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:24,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:04:24,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243787103] [2019-11-15 23:04:24,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:24,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 23:04:24,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258620243] [2019-11-15 23:04:24,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:04:24,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:24,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:04:24,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:04:24,962 INFO L87 Difference]: Start difference. First operand 1838 states and 1960 transitions. Second operand 13 states. [2019-11-15 23:04:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:26,325 INFO L93 Difference]: Finished difference Result 3727 states and 3988 transitions. [2019-11-15 23:04:26,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:04:26,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2019-11-15 23:04:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:04:26,325 INFO L225 Difference]: With dead ends: 3727 [2019-11-15 23:04:26,326 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:04:26,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:04:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:04:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:04:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:04:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:04:26,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 167 [2019-11-15 23:04:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:04:26,329 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:04:26,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:04:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:04:26,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:04:26,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:04:26,554 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-11-15 23:04:26,657 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-15 23:04:26,657 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-15 23:04:26,657 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-15 23:04:26,658 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-15 23:04:26,659 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,660 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,661 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-15 23:04:26,661 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-15 23:04:26,661 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-15 23:04:26,665 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-15 23:04:26,665 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-15 23:04:26,665 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-15 23:04:26,665 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-15 23:04:26,665 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-15 23:04:26,666 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-15 23:04:26,666 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (not (= ~a20~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse2 (= ~a17~0 1)) (.cse3 (= ~a12~0 8)) (.cse4 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and .cse0 .cse1 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse2 .cse3 .cse4) (and .cse3 (<= ~a17~0 0) .cse4) (and .cse0 .cse1 .cse3 .cse2 .cse4 (not (= ~a16~0 4))) (and .cse0 .cse2 .cse3 .cse4 (= ~a16~0 5)))) [2019-11-15 23:04:26,667 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,667 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,667 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,667 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,667 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,667 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-15 23:04:26,667 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-15 23:04:26,668 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-15 23:04:26,668 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-15 23:04:26,668 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-15 23:04:26,668 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-15 23:04:26,669 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-15 23:04:26,669 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-15 23:04:26,669 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-15 23:04:26,669 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-15 23:04:26,669 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-15 23:04:26,669 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-15 23:04:26,669 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-15 23:04:26,670 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 461) no Hoare annotation was computed. [2019-11-15 23:04:26,670 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-15 23:04:26,670 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,670 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,670 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,670 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,670 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,670 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-15 23:04:26,671 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-15 23:04:26,671 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-15 23:04:26,671 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-15 23:04:26,671 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-15 23:04:26,671 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-15 23:04:26,671 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-15 23:04:26,671 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-15 23:04:26,672 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-15 23:04:26,672 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,672 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,672 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,672 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,672 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-15 23:04:26,672 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,673 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-15 23:04:26,673 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-15 23:04:26,673 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-15 23:04:26,673 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-15 23:04:26,673 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-15 23:04:26,673 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-15 23:04:26,673 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-15 23:04:26,673 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:04:26,674 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-15 23:04:26,674 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-15 23:04:26,674 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-15 23:04:26,674 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-15 23:04:26,674 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-15 23:04:26,674 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-15 23:04:26,674 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,675 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (not (= ~a20~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse2 (= ~a17~0 1)) (.cse3 (= ~a12~0 8)) (.cse4 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and .cse0 .cse1 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse2 .cse3 .cse4) (and .cse3 (<= ~a17~0 0) .cse4) (and .cse0 .cse1 .cse3 .cse2 .cse4 (not (= ~a16~0 4))) (and .cse0 .cse2 .cse3 .cse4 (= ~a16~0 5)))) [2019-11-15 23:04:26,676 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,676 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,676 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,676 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,676 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-15 23:04:26,676 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-15 23:04:26,676 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-15 23:04:26,677 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-15 23:04:26,677 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-15 23:04:26,677 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-15 23:04:26,677 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-15 23:04:26,677 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-15 23:04:26,677 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,678 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,678 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,678 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,678 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,678 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-15 23:04:26,678 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:04:26,678 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-15 23:04:26,678 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-15 23:04:26,679 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-15 23:04:26,679 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-15 23:04:26,679 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-15 23:04:26,679 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-15 23:04:26,679 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-15 23:04:26,679 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-15 23:04:26,679 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-15 23:04:26,679 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-15 23:04:26,680 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-15 23:04:26,680 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,680 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,680 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,680 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,680 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-15 23:04:26,680 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,681 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,681 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-15 23:04:26,681 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-15 23:04:26,681 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:04:26,681 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-15 23:04:26,681 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-15 23:04:26,681 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-15 23:04:26,681 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-15 23:04:26,682 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-15 23:04:26,682 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-15 23:04:26,682 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-15 23:04:26,682 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-15 23:04:26,682 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-15 23:04:26,682 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-15 23:04:26,682 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,682 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,683 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,683 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,683 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,683 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-15 23:04:26,683 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,683 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-15 23:04:26,683 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-15 23:04:26,684 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-15 23:04:26,684 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-15 23:04:26,684 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-15 23:04:26,684 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-15 23:04:26,684 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-15 23:04:26,684 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-15 23:04:26,684 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-15 23:04:26,684 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-15 23:04:26,685 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-15 23:04:26,685 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:04:26,685 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-15 23:04:26,685 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-15 23:04:26,685 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-15 23:04:26,685 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,685 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,685 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,686 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,686 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,686 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 23:04:26,686 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-15 23:04:26,686 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-15 23:04:26,686 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-15 23:04:26,686 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-15 23:04:26,687 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-15 23:04:26,687 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-15 23:04:26,687 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-15 23:04:26,687 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-15 23:04:26,687 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-15 23:04:26,687 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-15 23:04:26,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:04:26 BoogieIcfgContainer [2019-11-15 23:04:26,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:04:26,724 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:04:26,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:04:26,724 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:04:26,725 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:04:15" (3/4) ... [2019-11-15 23:04:26,728 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:04:26,753 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:04:26,755 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:04:26,926 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_edfd147b-4d06-4add-bb0d-980f8746f8ef/bin/uautomizer/witness.graphml [2019-11-15 23:04:26,926 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:04:26,928 INFO L168 Benchmark]: Toolchain (without parser) took 13334.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 352.8 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -224.9 MB). Peak memory consumption was 127.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:04:26,929 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:04:26,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:04:26,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:04:26,930 INFO L168 Benchmark]: Boogie Preprocessor took 105.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:04:26,930 INFO L168 Benchmark]: RCFGBuilder took 1180.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 970.9 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:04:26,931 INFO L168 Benchmark]: TraceAbstraction took 11063.87 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 970.9 MB in the beginning and 1.2 GB in the end (delta: -207.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:04:26,931 INFO L168 Benchmark]: Witness Printer took 202.45 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:04:26,933 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.43 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 697.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1180.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 970.9 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11063.87 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 970.9 MB in the beginning and 1.2 GB in the end (delta: -207.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Witness Printer took 202.45 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: 30]: Loop Invariant Derived loop invariant: (((!(15 == a8) || (((((!(a7 == 1) && !(a20 == 1)) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && a17 == 1) && a12 == 8) && a21 == 1)) || ((a12 == 8 && a17 <= 0) && a21 == 1)) || (((((!(a7 == 1) && !(a20 == 1)) && a12 == 8) && a17 == 1) && a21 == 1) && !(a16 == 4))) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((!(15 == a8) || (((((!(a7 == 1) && !(a20 == 1)) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && a17 == 1) && a12 == 8) && a21 == 1)) || ((a12 == 8 && a17 <= 0) && a21 == 1)) || (((((!(a7 == 1) && !(a20 == 1)) && a12 == 8) && a17 == 1) && a21 == 1) && !(a16 == 4))) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 10.9s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 708 SDtfs, 2582 SDslu, 139 SDs, 0 SdLazy, 6495 SolverSat, 877 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1745 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 171 HoareAnnotationTreeSize, 3 FomulaSimplifications, 9104 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1398 NumberOfCodeBlocks, 1398 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1387 ConstructedInterpolants, 0 QuantifiedInterpolants, 879772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 439/439 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...