java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:47:06,808 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:47:06,810 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:47:06,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:47:06,824 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:47:06,825 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:47:06,826 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:47:06,828 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:47:06,830 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:47:06,831 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:47:06,832 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:47:06,832 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:47:06,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:47:06,834 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:47:06,835 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:47:06,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:47:06,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:47:06,839 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:47:06,841 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:47:06,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:47:06,844 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:47:06,846 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:47:06,848 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:47:06,849 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:47:06,849 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:47:06,850 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:47:06,851 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:47:06,852 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:47:06,853 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:47:06,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:47:06,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:47:06,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:47:06,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:47:06,859 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:47:06,861 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:47:06,864 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:47:06,865 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:47:06,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:47:06,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:47:06,897 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:47:06,898 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:47:06,898 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:47:06,898 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:47:06,900 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:47:06,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:47:06,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:47:06,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:47:06,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:47:06,901 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:47:06,901 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:47:06,901 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:47:06,901 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:47:06,902 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:47:06,903 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:47:06,903 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:47:06,903 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:47:06,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:47:06,904 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:47:06,904 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:47:06,904 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:47:06,905 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:47:06,905 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:47:06,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:47:06,905 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:47:06,905 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:47:06,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:47:06,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:47:06,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:47:06,997 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:47:06,998 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:47:06,998 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c [2018-10-23 18:47:07,063 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8031325f8/627e99ad44d84a69a8bbbc92a905f0e2/FLAGfe6083265 [2018-10-23 18:47:07,638 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:47:07,639 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c [2018-10-23 18:47:07,654 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8031325f8/627e99ad44d84a69a8bbbc92a905f0e2/FLAGfe6083265 [2018-10-23 18:47:07,670 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8031325f8/627e99ad44d84a69a8bbbc92a905f0e2 [2018-10-23 18:47:07,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:47:07,685 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:47:07,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:47:07,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:47:07,695 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:47:07,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:47:07" (1/1) ... [2018-10-23 18:47:07,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51be25fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:07, skipping insertion in model container [2018-10-23 18:47:07,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:47:07" (1/1) ... [2018-10-23 18:47:07,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:47:07,795 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:47:08,207 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:47:08,212 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:47:08,326 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:47:08,349 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:47:08,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08 WrapperNode [2018-10-23 18:47:08,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:47:08,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:47:08,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:47:08,352 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:47:08,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08" (1/1) ... [2018-10-23 18:47:08,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08" (1/1) ... [2018-10-23 18:47:08,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:47:08,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:47:08,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:47:08,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:47:08,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08" (1/1) ... [2018-10-23 18:47:08,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08" (1/1) ... [2018-10-23 18:47:08,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08" (1/1) ... [2018-10-23 18:47:08,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08" (1/1) ... [2018-10-23 18:47:08,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08" (1/1) ... [2018-10-23 18:47:08,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08" (1/1) ... [2018-10-23 18:47:08,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08" (1/1) ... [2018-10-23 18:47:08,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:47:08,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:47:08,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:47:08,667 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:47:08,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/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 [2018-10-23 18:47:08,753 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:47:08,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:47:08,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:47:12,081 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:47:12,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:47:12 BoogieIcfgContainer [2018-10-23 18:47:12,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:47:12,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:47:12,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:47:12,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:47:12,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:47:07" (1/3) ... [2018-10-23 18:47:12,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae214d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:47:12, skipping insertion in model container [2018-10-23 18:47:12,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:47:08" (2/3) ... [2018-10-23 18:47:12,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae214d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:47:12, skipping insertion in model container [2018-10-23 18:47:12,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:47:12" (3/3) ... [2018-10-23 18:47:12,091 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label27_true-unreach-call_false-termination.c [2018-10-23 18:47:12,103 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:47:12,113 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:47:12,128 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:47:12,163 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:47:12,164 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:47:12,164 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:47:12,165 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:47:12,165 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:47:12,165 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:47:12,165 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:47:12,166 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:47:12,166 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:47:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-23 18:47:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-23 18:47:12,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:12,202 INFO L375 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] [2018-10-23 18:47:12,205 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:12,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash 648417167, now seen corresponding path program 1 times [2018-10-23 18:47:12,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:12,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:12,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:47:12,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:12,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:47:12,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:47:12,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:47:12,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:47:12,741 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 3 states. [2018-10-23 18:47:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:14,322 INFO L93 Difference]: Finished difference Result 531 states and 918 transitions. [2018-10-23 18:47:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:47:14,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-10-23 18:47:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:14,343 INFO L225 Difference]: With dead ends: 531 [2018-10-23 18:47:14,344 INFO L226 Difference]: Without dead ends: 328 [2018-10-23 18:47:14,348 INFO L605 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 [2018-10-23 18:47:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-23 18:47:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-10-23 18:47:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-23 18:47:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 533 transitions. [2018-10-23 18:47:14,417 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 533 transitions. Word has length 89 [2018-10-23 18:47:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:14,418 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 533 transitions. [2018-10-23 18:47:14,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:47:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 533 transitions. [2018-10-23 18:47:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-23 18:47:14,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:14,423 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 18:47:14,423 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:14,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash 329528502, now seen corresponding path program 1 times [2018-10-23 18:47:14,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:14,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:14,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:14,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:14,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:47:14,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:14,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:47:14,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:47:14,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:47:14,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:14,560 INFO L87 Difference]: Start difference. First operand 328 states and 533 transitions. Second operand 4 states. [2018-10-23 18:47:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:15,891 INFO L93 Difference]: Finished difference Result 918 states and 1534 transitions. [2018-10-23 18:47:15,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:47:15,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-10-23 18:47:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:15,898 INFO L225 Difference]: With dead ends: 918 [2018-10-23 18:47:15,899 INFO L226 Difference]: Without dead ends: 592 [2018-10-23 18:47:15,902 INFO L605 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 [2018-10-23 18:47:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-10-23 18:47:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2018-10-23 18:47:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-10-23 18:47:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 895 transitions. [2018-10-23 18:47:15,935 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 895 transitions. Word has length 95 [2018-10-23 18:47:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:15,936 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 895 transitions. [2018-10-23 18:47:15,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:47:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 895 transitions. [2018-10-23 18:47:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-23 18:47:15,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:15,941 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:47:15,941 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:15,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:15,942 INFO L82 PathProgramCache]: Analyzing trace with hash -621960128, now seen corresponding path program 1 times [2018-10-23 18:47:15,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:15,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:15,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:16,171 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:47:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:47:16,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:16,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:47:16,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:47:16,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:47:16,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:16,188 INFO L87 Difference]: Start difference. First operand 592 states and 895 transitions. Second operand 4 states. [2018-10-23 18:47:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:19,195 INFO L93 Difference]: Finished difference Result 2238 states and 3452 transitions. [2018-10-23 18:47:19,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:47:19,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-10-23 18:47:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:19,206 INFO L225 Difference]: With dead ends: 2238 [2018-10-23 18:47:19,206 INFO L226 Difference]: Without dead ends: 1648 [2018-10-23 18:47:19,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:19,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2018-10-23 18:47:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2018-10-23 18:47:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2018-10-23 18:47:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2339 transitions. [2018-10-23 18:47:19,257 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2339 transitions. Word has length 99 [2018-10-23 18:47:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:19,257 INFO L481 AbstractCegarLoop]: Abstraction has 1648 states and 2339 transitions. [2018-10-23 18:47:19,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:47:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2339 transitions. [2018-10-23 18:47:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-23 18:47:19,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:19,274 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-10-23 18:47:19,274 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:19,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:19,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1407172958, now seen corresponding path program 1 times [2018-10-23 18:47:19,275 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:19,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:19,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:19,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-23 18:47:19,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:19,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:47:19,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:47:19,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:47:19,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:47:19,403 INFO L87 Difference]: Start difference. First operand 1648 states and 2339 transitions. Second operand 3 states. [2018-10-23 18:47:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:20,783 INFO L93 Difference]: Finished difference Result 3822 states and 5535 transitions. [2018-10-23 18:47:20,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:47:20,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-10-23 18:47:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:20,795 INFO L225 Difference]: With dead ends: 3822 [2018-10-23 18:47:20,795 INFO L226 Difference]: Without dead ends: 2176 [2018-10-23 18:47:20,798 INFO L605 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 [2018-10-23 18:47:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2018-10-23 18:47:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2176. [2018-10-23 18:47:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2018-10-23 18:47:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3102 transitions. [2018-10-23 18:47:20,843 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3102 transitions. Word has length 103 [2018-10-23 18:47:20,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:20,843 INFO L481 AbstractCegarLoop]: Abstraction has 2176 states and 3102 transitions. [2018-10-23 18:47:20,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:47:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3102 transitions. [2018-10-23 18:47:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-23 18:47:20,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:20,847 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 18:47:20,847 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:20,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:20,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1146288527, now seen corresponding path program 1 times [2018-10-23 18:47:20,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:20,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:20,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:20,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:20,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:21,087 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-23 18:47:21,238 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-23 18:47:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:47:21,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:21,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:47:21,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:47:21,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:47:21,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:21,261 INFO L87 Difference]: Start difference. First operand 2176 states and 3102 transitions. Second operand 4 states. [2018-10-23 18:47:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:22,463 INFO L93 Difference]: Finished difference Result 4669 states and 6590 transitions. [2018-10-23 18:47:22,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:47:22,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-10-23 18:47:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:22,475 INFO L225 Difference]: With dead ends: 4669 [2018-10-23 18:47:22,476 INFO L226 Difference]: Without dead ends: 2495 [2018-10-23 18:47:22,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:47:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2018-10-23 18:47:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2435. [2018-10-23 18:47:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-23 18:47:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3389 transitions. [2018-10-23 18:47:22,524 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3389 transitions. Word has length 105 [2018-10-23 18:47:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:22,524 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 3389 transitions. [2018-10-23 18:47:22,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:47:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3389 transitions. [2018-10-23 18:47:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-23 18:47:22,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:22,529 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-10-23 18:47:22,529 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:22,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:22,529 INFO L82 PathProgramCache]: Analyzing trace with hash -214678217, now seen corresponding path program 1 times [2018-10-23 18:47:22,529 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:22,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:22,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:22,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:47:22,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:22,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:47:22,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:47:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:47:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:22,641 INFO L87 Difference]: Start difference. First operand 2435 states and 3389 transitions. Second operand 4 states. [2018-10-23 18:47:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:23,581 INFO L93 Difference]: Finished difference Result 4868 states and 6776 transitions. [2018-10-23 18:47:23,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:47:23,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-10-23 18:47:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:23,595 INFO L225 Difference]: With dead ends: 4868 [2018-10-23 18:47:23,595 INFO L226 Difference]: Without dead ends: 2435 [2018-10-23 18:47:23,599 INFO L605 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 [2018-10-23 18:47:23,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2018-10-23 18:47:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2435. [2018-10-23 18:47:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-23 18:47:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3365 transitions. [2018-10-23 18:47:23,643 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3365 transitions. Word has length 110 [2018-10-23 18:47:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:23,643 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 3365 transitions. [2018-10-23 18:47:23,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:47:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3365 transitions. [2018-10-23 18:47:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-23 18:47:23,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:23,647 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:47:23,647 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:23,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:23,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1790706102, now seen corresponding path program 1 times [2018-10-23 18:47:23,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:23,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:23,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:23,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:23,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:47:23,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:23,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:47:23,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:47:23,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:47:23,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:47:23,788 INFO L87 Difference]: Start difference. First operand 2435 states and 3365 transitions. Second operand 3 states. [2018-10-23 18:47:24,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:24,687 INFO L93 Difference]: Finished difference Result 4868 states and 6728 transitions. [2018-10-23 18:47:24,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:47:24,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-10-23 18:47:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:24,699 INFO L225 Difference]: With dead ends: 4868 [2018-10-23 18:47:24,699 INFO L226 Difference]: Without dead ends: 2435 [2018-10-23 18:47:24,703 INFO L605 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 [2018-10-23 18:47:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2018-10-23 18:47:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2435. [2018-10-23 18:47:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-23 18:47:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3341 transitions. [2018-10-23 18:47:24,742 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3341 transitions. Word has length 111 [2018-10-23 18:47:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:24,743 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 3341 transitions. [2018-10-23 18:47:24,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:47:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3341 transitions. [2018-10-23 18:47:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-23 18:47:24,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:24,747 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:47:24,747 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:24,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:24,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1091793797, now seen corresponding path program 1 times [2018-10-23 18:47:24,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:24,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:24,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:24,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:47:24,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:24,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:47:24,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:47:24,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:47:24,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:47:24,842 INFO L87 Difference]: Start difference. First operand 2435 states and 3341 transitions. Second operand 3 states. [2018-10-23 18:47:25,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:25,544 INFO L93 Difference]: Finished difference Result 6439 states and 8708 transitions. [2018-10-23 18:47:25,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:47:25,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-10-23 18:47:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:25,554 INFO L225 Difference]: With dead ends: 6439 [2018-10-23 18:47:25,555 INFO L226 Difference]: Without dead ends: 2946 [2018-10-23 18:47:25,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:47:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2018-10-23 18:47:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2946. [2018-10-23 18:47:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2018-10-23 18:47:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3387 transitions. [2018-10-23 18:47:25,613 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3387 transitions. Word has length 113 [2018-10-23 18:47:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:25,613 INFO L481 AbstractCegarLoop]: Abstraction has 2946 states and 3387 transitions. [2018-10-23 18:47:25,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:47:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3387 transitions. [2018-10-23 18:47:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-23 18:47:25,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:25,618 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:47:25,618 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:25,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1668509958, now seen corresponding path program 1 times [2018-10-23 18:47:25,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:25,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:25,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:25,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:25,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:47:25,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:25,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:47:25,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:47:25,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:47:25,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:25,860 INFO L87 Difference]: Start difference. First operand 2946 states and 3387 transitions. Second operand 4 states. [2018-10-23 18:47:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:28,850 INFO L93 Difference]: Finished difference Result 5758 states and 6637 transitions. [2018-10-23 18:47:28,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:47:28,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-10-23 18:47:28,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:28,860 INFO L225 Difference]: With dead ends: 5758 [2018-10-23 18:47:28,860 INFO L226 Difference]: Without dead ends: 2946 [2018-10-23 18:47:28,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2018-10-23 18:47:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2946. [2018-10-23 18:47:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2018-10-23 18:47:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3244 transitions. [2018-10-23 18:47:28,904 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3244 transitions. Word has length 127 [2018-10-23 18:47:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:28,905 INFO L481 AbstractCegarLoop]: Abstraction has 2946 states and 3244 transitions. [2018-10-23 18:47:28,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:47:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3244 transitions. [2018-10-23 18:47:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-23 18:47:28,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:28,909 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:47:28,909 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:28,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:28,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1006345560, now seen corresponding path program 1 times [2018-10-23 18:47:28,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:28,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:28,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:28,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:28,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:29,221 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:47:29,432 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-23 18:47:29,688 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-23 18:47:30,063 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-10-23 18:47:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:47:30,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:30,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-23 18:47:30,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-23 18:47:30,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-23 18:47:30,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2018-10-23 18:47:30,389 INFO L87 Difference]: Start difference. First operand 2946 states and 3244 transitions. Second operand 13 states. [2018-10-23 18:47:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:32,713 INFO L93 Difference]: Finished difference Result 6288 states and 6956 transitions. [2018-10-23 18:47:32,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-23 18:47:32,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 141 [2018-10-23 18:47:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:32,724 INFO L225 Difference]: With dead ends: 6288 [2018-10-23 18:47:32,724 INFO L226 Difference]: Without dead ends: 3476 [2018-10-23 18:47:32,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=193, Unknown=0, NotChecked=0, Total=342 [2018-10-23 18:47:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2018-10-23 18:47:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3275. [2018-10-23 18:47:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3275 states. [2018-10-23 18:47:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 3591 transitions. [2018-10-23 18:47:32,773 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 3591 transitions. Word has length 141 [2018-10-23 18:47:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:32,774 INFO L481 AbstractCegarLoop]: Abstraction has 3275 states and 3591 transitions. [2018-10-23 18:47:32,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-23 18:47:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3591 transitions. [2018-10-23 18:47:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-23 18:47:32,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:32,780 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:47:32,780 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:32,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:32,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2066764165, now seen corresponding path program 1 times [2018-10-23 18:47:32,781 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:32,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:32,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-23 18:47:33,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:33,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:47:33,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:47:33,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:47:33,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:33,065 INFO L87 Difference]: Start difference. First operand 3275 states and 3591 transitions. Second operand 4 states. [2018-10-23 18:47:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:34,439 INFO L93 Difference]: Finished difference Result 6686 states and 7357 transitions. [2018-10-23 18:47:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:47:34,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-10-23 18:47:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:34,450 INFO L225 Difference]: With dead ends: 6686 [2018-10-23 18:47:34,450 INFO L226 Difference]: Without dead ends: 3005 [2018-10-23 18:47:34,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2018-10-23 18:47:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 3005. [2018-10-23 18:47:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2018-10-23 18:47:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 3214 transitions. [2018-10-23 18:47:34,499 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 3214 transitions. Word has length 186 [2018-10-23 18:47:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:34,500 INFO L481 AbstractCegarLoop]: Abstraction has 3005 states and 3214 transitions. [2018-10-23 18:47:34,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:47:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 3214 transitions. [2018-10-23 18:47:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-23 18:47:34,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:34,507 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 18:47:34,508 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:34,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:34,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1694644432, now seen corresponding path program 1 times [2018-10-23 18:47:34,508 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:34,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:34,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:34,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-10-23 18:47:34,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:34,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:47:34,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:47:34,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:47:34,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:34,971 INFO L87 Difference]: Start difference. First operand 3005 states and 3214 transitions. Second operand 4 states. [2018-10-23 18:47:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:36,533 INFO L93 Difference]: Finished difference Result 8057 states and 8628 transitions. [2018-10-23 18:47:36,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:47:36,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2018-10-23 18:47:36,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:36,551 INFO L225 Difference]: With dead ends: 8057 [2018-10-23 18:47:36,551 INFO L226 Difference]: Without dead ends: 4652 [2018-10-23 18:47:36,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2018-10-23 18:47:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 3790. [2018-10-23 18:47:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3790 states. [2018-10-23 18:47:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 4013 transitions. [2018-10-23 18:47:36,605 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 4013 transitions. Word has length 236 [2018-10-23 18:47:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:36,606 INFO L481 AbstractCegarLoop]: Abstraction has 3790 states and 4013 transitions. [2018-10-23 18:47:36,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:47:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 4013 transitions. [2018-10-23 18:47:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-23 18:47:36,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:36,613 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:47:36,613 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:36,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:36,613 INFO L82 PathProgramCache]: Analyzing trace with hash 317934217, now seen corresponding path program 1 times [2018-10-23 18:47:36,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:36,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:36,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:36,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:36,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:36,848 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-10-23 18:47:36,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:36,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:47:36,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:47:36,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:47:36,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:47:36,850 INFO L87 Difference]: Start difference. First operand 3790 states and 4013 transitions. Second operand 4 states. [2018-10-23 18:47:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:37,686 INFO L93 Difference]: Finished difference Result 8364 states and 8874 transitions. [2018-10-23 18:47:37,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:47:37,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-10-23 18:47:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:37,688 INFO L225 Difference]: With dead ends: 8364 [2018-10-23 18:47:37,688 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 18:47:37,694 INFO L605 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 [2018-10-23 18:47:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 18:47:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 18:47:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 18:47:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 18:47:37,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 238 [2018-10-23 18:47:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:37,696 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 18:47:37,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:47:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 18:47:37,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 18:47:37,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 18:47:40,287 WARN L179 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2018-10-23 18:47:41,179 WARN L179 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2018-10-23 18:47:41,184 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-23 18:47:41,184 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-23 18:47:41,185 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-23 18:47:41,186 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-23 18:47:41,186 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-23 18:47:41,186 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-23 18:47:41,186 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-23 18:47:41,186 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,186 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,186 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,186 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,187 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,187 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,187 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-23 18:47:41,187 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-23 18:47:41,187 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-23 18:47:41,187 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-23 18:47:41,187 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-23 18:47:41,187 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-23 18:47:41,187 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-23 18:47:41,188 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-23 18:47:41,188 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-23 18:47:41,188 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-23 18:47:41,188 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-23 18:47:41,188 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-23 18:47:41,188 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-23 18:47:41,188 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-23 18:47:41,188 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-23 18:47:41,189 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,189 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,189 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,189 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,189 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,189 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-23 18:47:41,189 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-23 18:47:41,189 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-23 18:47:41,189 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-23 18:47:41,189 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-23 18:47:41,190 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-23 18:47:41,190 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-23 18:47:41,190 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-23 18:47:41,190 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-23 18:47:41,190 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse13 (= ~a8~0 15)) (.cse10 (= ~a20~0 1)) (.cse16 (= ~a16~0 6))) (let ((.cse1 (not .cse16)) (.cse3 (not (= 5 ~a16~0))) (.cse6 (= ~a16~0 4)) (.cse7 (<= ~a17~0 0)) (.cse8 (= ~a8~0 14)) (.cse12 (<= ~a20~0 0)) (.cse0 (not .cse10)) (.cse4 (not .cse13)) (.cse15 (not .cse9)) (.cse14 (= ~a16~0 5)) (.cse17 (not .cse5)) (.cse11 (= ~a12~0 8)) (.cse2 (= ~a21~0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4) (and .cse5 .cse6 .cse4 .cse7) (and .cse5 .cse8 .cse2) (and .cse4 .cse9 .cse2 .cse3) (and .cse10 .cse6 .cse11 .cse7 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse9 .cse11 .cse2 .cse3) (and .cse6 .cse11 .cse7 .cse2 .cse12) (and (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse13 .cse9 .cse11 .cse2 .cse14) (and .cse6 .cse4 .cse7 .cse2) (and .cse8 .cse2 .cse15 .cse12 .cse14) (and .cse0 .cse13 .cse11 .cse2 .cse14) (and .cse5 .cse4 .cse16) (and .cse5 .cse9 .cse2) (and .cse0 .cse13 .cse11 .cse2 .cse16) (and .cse5 .cse0 .cse2 .cse14) (and .cse5 .cse9 .cse4) (and .cse17 .cse13 .cse11 .cse2 .cse15 .cse14) (and .cse17 .cse13 .cse11 .cse2 .cse16)))) [2018-10-23 18:47:41,191 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,191 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,191 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,191 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,191 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,191 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-23 18:47:41,191 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-23 18:47:41,191 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-23 18:47:41,191 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-23 18:47:41,192 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-23 18:47:41,192 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-23 18:47:41,192 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-23 18:47:41,192 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-23 18:47:41,192 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-23 18:47:41,192 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-23 18:47:41,192 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-23 18:47:41,192 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-23 18:47:41,192 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-23 18:47:41,192 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 440) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-23 18:47:41,193 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-23 18:47:41,194 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-23 18:47:41,195 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-23 18:47:41,195 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-23 18:47:41,195 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-23 18:47:41,195 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-23 18:47:41,195 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-23 18:47:41,195 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-23 18:47:41,195 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-23 18:47:41,195 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-23 18:47:41,195 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,196 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,196 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,196 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse13 (= ~a8~0 15)) (.cse10 (= ~a20~0 1)) (.cse16 (= ~a16~0 6))) (let ((.cse1 (not .cse16)) (.cse3 (not (= 5 ~a16~0))) (.cse6 (= ~a16~0 4)) (.cse7 (<= ~a17~0 0)) (.cse8 (= ~a8~0 14)) (.cse15 (<= ~a20~0 0)) (.cse0 (not .cse10)) (.cse14 (= ~a16~0 5)) (.cse9 (= ~a17~0 1)) (.cse4 (not .cse13)) (.cse12 (not .cse5)) (.cse11 (= ~a12~0 8)) (.cse2 (= ~a21~0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4) (and .cse5 .cse6 .cse4 .cse7) (and .cse5 .cse8 .cse2) (and .cse4 .cse9 .cse2 .cse3) (and .cse10 .cse6 .cse11 .cse7 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse12 .cse13 .cse11 .cse2 .cse14) (and .cse0 .cse9 .cse11 .cse2 .cse3) (and .cse6 .cse11 .cse7 .cse2 .cse15) (and .cse6 .cse4 .cse7 .cse2) (and .cse8 .cse2 (not .cse9) .cse15 .cse14) (and .cse5 .cse4 .cse16) (and .cse5 .cse9 .cse2) (and .cse0 .cse13 .cse11 .cse2 .cse16) (and .cse5 .cse0 .cse2 .cse14) (and .cse5 .cse9 .cse4) (and .cse12 .cse13 .cse11 .cse2 .cse16)))) [2018-10-23 18:47:41,196 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,196 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,196 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-23 18:47:41,196 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-23 18:47:41,197 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-23 18:47:41,197 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-23 18:47:41,197 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-23 18:47:41,197 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-23 18:47:41,197 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-23 18:47:41,197 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-23 18:47:41,197 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,197 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,197 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,197 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,197 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-23 18:47:41,198 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-23 18:47:41,199 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-23 18:47:41,200 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-23 18:47:41,200 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-23 18:47:41,200 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-23 18:47:41,200 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-23 18:47:41,200 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-23 18:47:41,200 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,200 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,200 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,200 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,200 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,201 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,201 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-23 18:47:41,201 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-23 18:47:41,201 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-23 18:47:41,201 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-23 18:47:41,201 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-23 18:47:41,201 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-23 18:47:41,201 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-23 18:47:41,201 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-23 18:47:41,201 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-23 18:47:41,201 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-23 18:47:41,202 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-23 18:47:41,203 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-23 18:47:41,203 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-23 18:47:41,203 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-23 18:47:41,203 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-23 18:47:41,203 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-23 18:47:41,203 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-23 18:47:41,203 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-23 18:47:41,203 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-23 18:47:41,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:47:41 BoogieIcfgContainer [2018-10-23 18:47:41,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:47:41,234 INFO L168 Benchmark]: Toolchain (without parser) took 33551.49 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -441.4 MB). Peak memory consumption was 652.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:47:41,235 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:47:41,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 662.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-23 18:47:41,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 203.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-23 18:47:41,237 INFO L168 Benchmark]: Boogie Preprocessor took 107.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:47:41,238 INFO L168 Benchmark]: RCFGBuilder took 3415.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.0 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. [2018-10-23 18:47:41,239 INFO L168 Benchmark]: TraceAbstraction took 29149.55 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 360.2 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 228.2 MB). Peak memory consumption was 588.4 MB. Max. memory is 7.1 GB. [2018-10-23 18:47:41,244 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 662.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 203.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3415.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.0 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29149.55 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 360.2 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 228.2 MB). Peak memory consumption was 588.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: 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: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(a20 == 1) && !(a16 == 6)) && a21 == 1) && !(5 == a16)) && !(a8 == 15)) || (((a7 == 1 && a16 == 4) && !(a8 == 15)) && a17 <= 0)) || ((a7 == 1 && a8 == 14) && a21 == 1)) || (((!(a8 == 15) && a17 == 1) && a21 == 1) && !(5 == a16))) || ((((a20 == 1 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a7 == 1 && !(a16 == 6)) && a21 == 1) && !(5 == a16))) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 5)) || ((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && !(5 == a16))) || ((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((a16 == 4 && !(a8 == 15)) && a17 <= 0) && a21 == 1)) || ((((a8 == 14 && a21 == 1) && !(a17 == 1)) && a20 <= 0) && a16 == 5)) || ((a7 == 1 && !(a8 == 15)) && a16 == 6)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || ((((!(a20 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6)) || (((a7 == 1 && !(a20 == 1)) && a21 == 1) && a16 == 5)) || ((a7 == 1 && a17 == 1) && !(a8 == 15))) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(a20 == 1) && !(a16 == 6)) && a21 == 1) && !(5 == a16)) && !(a8 == 15)) || (((a7 == 1 && a16 == 4) && !(a8 == 15)) && a17 <= 0)) || ((a7 == 1 && a8 == 14) && a21 == 1)) || (((!(a8 == 15) && a17 == 1) && a21 == 1) && !(5 == a16))) || ((((a20 == 1 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a7 == 1 && !(a16 == 6)) && a21 == 1) && !(5 == a16))) || ((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && !(5 == a16))) || ((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((((!(1 == input) && a8 == 15) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || (((a16 == 4 && !(a8 == 15)) && a17 <= 0) && a21 == 1)) || ((((a8 == 14 && a21 == 1) && !(a17 == 1)) && a20 <= 0) && a16 == 5)) || ((((!(a20 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 5)) || ((a7 == 1 && !(a8 == 15)) && a16 == 6)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || ((((!(a20 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6)) || (((a7 == 1 && !(a20 == 1)) && a21 == 1) && a16 == 5)) || ((a7 == 1 && a17 == 1) && !(a8 == 15))) || (((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && !(a17 == 1)) && a16 == 5)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 29.0s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 20.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2196 SDtfs, 3986 SDslu, 832 SDs, 0 SdLazy, 8133 SolverSat, 1415 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3790occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 1123 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 107 NumberOfFragments, 550 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2583 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1144 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1753 NumberOfCodeBlocks, 1753 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1740 ConstructedInterpolants, 0 QuantifiedInterpolants, 965512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 999/999 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...