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_label18_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:50:25,661 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:50:25,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:50:25,674 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:50:25,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:50:25,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:50:25,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:50:25,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:50:25,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:50:25,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:50:25,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:50:25,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:50:25,686 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:50:25,687 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:50:25,690 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:50:25,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:50:25,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:50:25,702 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:50:25,709 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:50:25,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:50:25,712 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:50:25,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:50:25,717 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:50:25,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:50:25,719 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:50:25,720 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:50:25,721 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:50:25,721 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:50:25,722 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:50:25,727 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:50:25,727 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:50:25,728 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:50:25,729 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:50:25,729 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:50:25,730 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:50:25,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:50:25,731 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-24 14:50:25,751 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:50:25,752 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:50:25,753 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:50:25,753 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:50:25,754 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:50:25,754 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:50:25,754 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:50:25,754 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:50:25,754 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:50:25,755 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:50:25,755 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:50:25,755 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:50:25,755 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:50:25,755 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:50:25,756 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:50:25,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:50:25,756 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:50:25,756 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:50:25,756 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:50:25,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:50:25,757 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:50:25,757 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:50:25,757 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:50:25,757 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:50:25,758 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:50:25,758 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:50:25,758 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:50:25,758 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:50:25,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:50:25,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:50:25,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:50:25,822 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:50:25,822 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:50:25,823 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label18_true-unreach-call_false-termination.c [2018-10-24 14:50:25,878 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9e94717fe/7c3541541fb5432683833be002b19e45/FLAGb003a0365 [2018-10-24 14:50:26,436 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:50:26,437 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label18_true-unreach-call_false-termination.c [2018-10-24 14:50:26,453 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9e94717fe/7c3541541fb5432683833be002b19e45/FLAGb003a0365 [2018-10-24 14:50:26,472 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9e94717fe/7c3541541fb5432683833be002b19e45 [2018-10-24 14:50:26,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:50:26,485 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:50:26,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:26,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:50:26,491 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:50:26,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:26" (1/1) ... [2018-10-24 14:50:26,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb9bc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:26, skipping insertion in model container [2018-10-24 14:50:26,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:26" (1/1) ... [2018-10-24 14:50:26,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:50:26,585 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:50:27,015 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:27,020 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:50:27,138 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:27,160 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:50:27,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27 WrapperNode [2018-10-24 14:50:27,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:27,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:27,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:50:27,162 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:50:27,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27" (1/1) ... [2018-10-24 14:50:27,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27" (1/1) ... [2018-10-24 14:50:27,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:27,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:50:27,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:50:27,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:50:27,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27" (1/1) ... [2018-10-24 14:50:27,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27" (1/1) ... [2018-10-24 14:50:27,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27" (1/1) ... [2018-10-24 14:50:27,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27" (1/1) ... [2018-10-24 14:50:27,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27" (1/1) ... [2018-10-24 14:50:27,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27" (1/1) ... [2018-10-24 14:50:27,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27" (1/1) ... [2018-10-24 14:50:27,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:50:27,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:50:27,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:50:27,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:50:27,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27" (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-24 14:50:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:50:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:50:27,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:50:30,886 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:50:30,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:30 BoogieIcfgContainer [2018-10-24 14:50:30,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:50:30,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:50:30,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:50:30,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:50:30,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:50:26" (1/3) ... [2018-10-24 14:50:30,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3916679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:30, skipping insertion in model container [2018-10-24 14:50:30,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:27" (2/3) ... [2018-10-24 14:50:30,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3916679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:30, skipping insertion in model container [2018-10-24 14:50:30,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:30" (3/3) ... [2018-10-24 14:50:30,902 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label18_true-unreach-call_false-termination.c [2018-10-24 14:50:30,910 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:50:30,919 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:50:30,936 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:50:30,972 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:50:30,972 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:50:30,973 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:50:30,973 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:50:30,973 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:50:30,973 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:50:30,973 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:50:30,974 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:50:30,974 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:50:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:50:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-24 14:50:31,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:31,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:31,012 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:31,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash 816741823, now seen corresponding path program 1 times [2018-10-24 14:50:31,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:31,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:31,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:31,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:31,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:31,663 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-24 14:50:31,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:31,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:31,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:31,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:31,694 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-10-24 14:50:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:34,019 INFO L93 Difference]: Finished difference Result 691 states and 1207 transitions. [2018-10-24 14:50:34,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:34,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-10-24 14:50:34,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:34,045 INFO L225 Difference]: With dead ends: 691 [2018-10-24 14:50:34,045 INFO L226 Difference]: Without dead ends: 485 [2018-10-24 14:50:34,050 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-24 14:50:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-10-24 14:50:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 328. [2018-10-24 14:50:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-24 14:50:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 527 transitions. [2018-10-24 14:50:34,139 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 527 transitions. Word has length 101 [2018-10-24 14:50:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:34,140 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 527 transitions. [2018-10-24 14:50:34,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 527 transitions. [2018-10-24 14:50:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-24 14:50:34,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:34,146 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:34,146 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:34,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:34,147 INFO L82 PathProgramCache]: Analyzing trace with hash 79214284, now seen corresponding path program 1 times [2018-10-24 14:50:34,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:34,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:34,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:34,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:34,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:50:34,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:34,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:34,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:34,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:34,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:34,324 INFO L87 Difference]: Start difference. First operand 328 states and 527 transitions. Second operand 4 states. [2018-10-24 14:50:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:35,698 INFO L93 Difference]: Finished difference Result 1182 states and 1980 transitions. [2018-10-24 14:50:35,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:35,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-10-24 14:50:35,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:35,705 INFO L225 Difference]: With dead ends: 1182 [2018-10-24 14:50:35,706 INFO L226 Difference]: Without dead ends: 856 [2018-10-24 14:50:35,709 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-24 14:50:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-24 14:50:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-10-24 14:50:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-24 14:50:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1303 transitions. [2018-10-24 14:50:35,752 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1303 transitions. Word has length 108 [2018-10-24 14:50:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:35,753 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1303 transitions. [2018-10-24 14:50:35,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1303 transitions. [2018-10-24 14:50:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-24 14:50:35,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:35,759 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:35,759 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:35,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:35,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1484678827, now seen corresponding path program 1 times [2018-10-24 14:50:35,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:35,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:35,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:35,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:35,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:50:35,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:35,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:35,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:35,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:35,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:35,983 INFO L87 Difference]: Start difference. First operand 856 states and 1303 transitions. Second operand 3 states. [2018-10-24 14:50:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:38,812 INFO L93 Difference]: Finished difference Result 2364 states and 3579 transitions. [2018-10-24 14:50:38,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:38,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-10-24 14:50:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:38,823 INFO L225 Difference]: With dead ends: 2364 [2018-10-24 14:50:38,823 INFO L226 Difference]: Without dead ends: 1510 [2018-10-24 14:50:38,825 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-24 14:50:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-24 14:50:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2018-10-24 14:50:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2018-10-24 14:50:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2086 transitions. [2018-10-24 14:50:38,870 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2086 transitions. Word has length 109 [2018-10-24 14:50:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:38,870 INFO L481 AbstractCegarLoop]: Abstraction has 1510 states and 2086 transitions. [2018-10-24 14:50:38,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2086 transitions. [2018-10-24 14:50:38,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-24 14:50:38,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:38,881 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:38,882 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:38,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:38,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2116639143, now seen corresponding path program 1 times [2018-10-24 14:50:38,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:38,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:38,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:38,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:38,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:50:39,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:39,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:39,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:39,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:39,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:39,011 INFO L87 Difference]: Start difference. First operand 1510 states and 2086 transitions. Second operand 3 states. [2018-10-24 14:50:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:40,203 INFO L93 Difference]: Finished difference Result 3546 states and 4969 transitions. [2018-10-24 14:50:40,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:40,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-10-24 14:50:40,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:40,215 INFO L225 Difference]: With dead ends: 3546 [2018-10-24 14:50:40,215 INFO L226 Difference]: Without dead ends: 2038 [2018-10-24 14:50:40,217 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-24 14:50:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2018-10-24 14:50:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 2038. [2018-10-24 14:50:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2038 states. [2018-10-24 14:50:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2807 transitions. [2018-10-24 14:50:40,260 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2807 transitions. Word has length 126 [2018-10-24 14:50:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:40,261 INFO L481 AbstractCegarLoop]: Abstraction has 2038 states and 2807 transitions. [2018-10-24 14:50:40,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2807 transitions. [2018-10-24 14:50:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-24 14:50:40,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:40,266 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:50:40,266 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:40,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:40,266 INFO L82 PathProgramCache]: Analyzing trace with hash 972661155, now seen corresponding path program 1 times [2018-10-24 14:50:40,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:40,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:40,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:40,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:40,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 14:50:40,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:40,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:40,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:40,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:40,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:40,404 INFO L87 Difference]: Start difference. First operand 2038 states and 2807 transitions. Second operand 3 states. [2018-10-24 14:50:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:41,107 INFO L93 Difference]: Finished difference Result 5526 states and 7563 transitions. [2018-10-24 14:50:41,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:41,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-10-24 14:50:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:41,123 INFO L225 Difference]: With dead ends: 5526 [2018-10-24 14:50:41,124 INFO L226 Difference]: Without dead ends: 3490 [2018-10-24 14:50:41,127 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-24 14:50:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2018-10-24 14:50:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 3490. [2018-10-24 14:50:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2018-10-24 14:50:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4530 transitions. [2018-10-24 14:50:41,190 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4530 transitions. Word has length 138 [2018-10-24 14:50:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:41,190 INFO L481 AbstractCegarLoop]: Abstraction has 3490 states and 4530 transitions. [2018-10-24 14:50:41,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4530 transitions. [2018-10-24 14:50:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-24 14:50:41,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:41,197 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:50:41,197 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:41,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash -686511857, now seen corresponding path program 1 times [2018-10-24 14:50:41,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:41,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:41,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:41,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:41,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:41,431 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-24 14:50:41,659 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-24 14:50:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-24 14:50:41,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:41,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:41,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:41,686 INFO L87 Difference]: Start difference. First operand 3490 states and 4530 transitions. Second operand 4 states. [2018-10-24 14:50:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:42,878 INFO L93 Difference]: Finished difference Result 7434 states and 9567 transitions. [2018-10-24 14:50:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:50:42,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-10-24 14:50:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:42,894 INFO L225 Difference]: With dead ends: 7434 [2018-10-24 14:50:42,895 INFO L226 Difference]: Without dead ends: 3946 [2018-10-24 14:50:42,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:50:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2018-10-24 14:50:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3754. [2018-10-24 14:50:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2018-10-24 14:50:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 4807 transitions. [2018-10-24 14:50:42,967 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 4807 transitions. Word has length 146 [2018-10-24 14:50:42,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:42,967 INFO L481 AbstractCegarLoop]: Abstraction has 3754 states and 4807 transitions. [2018-10-24 14:50:42,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 4807 transitions. [2018-10-24 14:50:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-24 14:50:42,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:42,973 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:50:42,974 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:42,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash 441358951, now seen corresponding path program 1 times [2018-10-24 14:50:42,974 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:42,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:42,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:42,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:42,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-24 14:50:43,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:43,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:43,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:43,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:43,136 INFO L87 Difference]: Start difference. First operand 3754 states and 4807 transitions. Second operand 4 states. [2018-10-24 14:50:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:44,179 INFO L93 Difference]: Finished difference Result 7506 states and 9669 transitions. [2018-10-24 14:50:44,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:50:44,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-10-24 14:50:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:44,195 INFO L225 Difference]: With dead ends: 7506 [2018-10-24 14:50:44,195 INFO L226 Difference]: Without dead ends: 3886 [2018-10-24 14:50:44,201 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-24 14:50:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2018-10-24 14:50:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3886. [2018-10-24 14:50:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states. [2018-10-24 14:50:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 4907 transitions. [2018-10-24 14:50:44,280 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 4907 transitions. Word has length 151 [2018-10-24 14:50:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:44,280 INFO L481 AbstractCegarLoop]: Abstraction has 3886 states and 4907 transitions. [2018-10-24 14:50:44,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:50:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 4907 transitions. [2018-10-24 14:50:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-24 14:50:44,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:44,287 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:50:44,288 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:44,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash -432779357, now seen corresponding path program 1 times [2018-10-24 14:50:44,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:44,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:44,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:44,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:44,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-24 14:50:44,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:44,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:44,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:44,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:44,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:44,412 INFO L87 Difference]: Start difference. First operand 3886 states and 4907 transitions. Second operand 3 states. [2018-10-24 14:50:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:44,986 INFO L93 Difference]: Finished difference Result 7638 states and 9674 transitions. [2018-10-24 14:50:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:44,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-10-24 14:50:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:44,995 INFO L225 Difference]: With dead ends: 7638 [2018-10-24 14:50:44,996 INFO L226 Difference]: Without dead ends: 3214 [2018-10-24 14:50:45,000 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-24 14:50:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2018-10-24 14:50:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3214. [2018-10-24 14:50:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3214 states. [2018-10-24 14:50:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 3648 transitions. [2018-10-24 14:50:45,048 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 3648 transitions. Word has length 154 [2018-10-24 14:50:45,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:45,048 INFO L481 AbstractCegarLoop]: Abstraction has 3214 states and 3648 transitions. [2018-10-24 14:50:45,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 3648 transitions. [2018-10-24 14:50:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-24 14:50:45,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:45,054 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:50:45,054 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:45,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:45,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1213086856, now seen corresponding path program 1 times [2018-10-24 14:50:45,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:45,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:45,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:45,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:45,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 14:50:45,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:45,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:45,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:45,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:45,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:45,235 INFO L87 Difference]: Start difference. First operand 3214 states and 3648 transitions. Second operand 3 states. [2018-10-24 14:50:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:46,548 INFO L93 Difference]: Finished difference Result 6294 states and 7159 transitions. [2018-10-24 14:50:46,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:46,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-10-24 14:50:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:46,562 INFO L225 Difference]: With dead ends: 6294 [2018-10-24 14:50:46,562 INFO L226 Difference]: Without dead ends: 2944 [2018-10-24 14:50:46,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2018-10-24 14:50:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2680. [2018-10-24 14:50:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2680 states. [2018-10-24 14:50:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3027 transitions. [2018-10-24 14:50:46,606 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3027 transitions. Word has length 168 [2018-10-24 14:50:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:46,607 INFO L481 AbstractCegarLoop]: Abstraction has 2680 states and 3027 transitions. [2018-10-24 14:50:46,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3027 transitions. [2018-10-24 14:50:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-24 14:50:46,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:46,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:46,614 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:46,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2093448885, now seen corresponding path program 1 times [2018-10-24 14:50:46,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:46,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:46,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:46,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:46,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:47,014 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 14:50:47,272 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 14:50:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 27 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-24 14:50:47,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:50:47,654 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:50:47,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:47,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:50:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-24 14:50:48,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:50:48,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 14:50:48,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:50:48,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:50:48,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:50:48,032 INFO L87 Difference]: Start difference. First operand 2680 states and 3027 transitions. Second operand 8 states. [2018-10-24 14:50:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:51,950 INFO L93 Difference]: Finished difference Result 6684 states and 7545 transitions. [2018-10-24 14:50:51,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:50:51,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2018-10-24 14:50:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:51,971 INFO L225 Difference]: With dead ends: 6684 [2018-10-24 14:50:51,972 INFO L226 Difference]: Without dead ends: 3338 [2018-10-24 14:50:51,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:50:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-10-24 14:50:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3194. [2018-10-24 14:50:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2018-10-24 14:50:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 3459 transitions. [2018-10-24 14:50:52,044 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 3459 transitions. Word has length 198 [2018-10-24 14:50:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:52,044 INFO L481 AbstractCegarLoop]: Abstraction has 3194 states and 3459 transitions. [2018-10-24 14:50:52,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:50:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 3459 transitions. [2018-10-24 14:50:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-24 14:50:52,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:52,054 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:50:52,054 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:52,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1875667848, now seen corresponding path program 1 times [2018-10-24 14:50:52,056 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:52,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:52,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:52,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:52,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:52,473 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:50:52,752 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:50:53,003 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-24 14:50:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-24 14:50:53,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:53,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:50:53,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:50:53,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:50:53,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:50:53,220 INFO L87 Difference]: Start difference. First operand 3194 states and 3459 transitions. Second operand 6 states. [2018-10-24 14:50:54,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:54,434 INFO L93 Difference]: Finished difference Result 6659 states and 7221 transitions. [2018-10-24 14:50:54,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:50:54,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2018-10-24 14:50:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:54,449 INFO L225 Difference]: With dead ends: 6659 [2018-10-24 14:50:54,450 INFO L226 Difference]: Without dead ends: 3599 [2018-10-24 14:50:54,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:50:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2018-10-24 14:50:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3194. [2018-10-24 14:50:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2018-10-24 14:50:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 3440 transitions. [2018-10-24 14:50:54,502 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 3440 transitions. Word has length 255 [2018-10-24 14:50:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:54,502 INFO L481 AbstractCegarLoop]: Abstraction has 3194 states and 3440 transitions. [2018-10-24 14:50:54,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:50:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 3440 transitions. [2018-10-24 14:50:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-24 14:50:54,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:54,510 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-24 14:50:54,510 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:54,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1578803217, now seen corresponding path program 1 times [2018-10-24 14:50:54,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:54,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:54,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:54,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:54,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:54,965 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 14:50:55,373 WARN L179 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-10-24 14:50:55,587 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-10-24 14:50:55,711 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-24 14:50:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 283 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-24 14:50:56,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:50:56,322 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:50:56,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:56,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:50:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-24 14:50:56,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:50:56,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-10-24 14:50:56,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 14:50:56,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 14:50:56,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-24 14:50:56,561 INFO L87 Difference]: Start difference. First operand 3194 states and 3440 transitions. Second operand 14 states. [2018-10-24 14:50:59,096 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2018-10-24 14:50:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:59,726 INFO L93 Difference]: Finished difference Result 6311 states and 6812 transitions. [2018-10-24 14:50:59,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:50:59,727 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 277 [2018-10-24 14:50:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:59,747 INFO L225 Difference]: With dead ends: 6311 [2018-10-24 14:50:59,747 INFO L226 Difference]: Without dead ends: 3251 [2018-10-24 14:50:59,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 280 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-10-24 14:50:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2018-10-24 14:50:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 3111. [2018-10-24 14:50:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3111 states. [2018-10-24 14:50:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 3339 transitions. [2018-10-24 14:50:59,815 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 3339 transitions. Word has length 277 [2018-10-24 14:50:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:59,815 INFO L481 AbstractCegarLoop]: Abstraction has 3111 states and 3339 transitions. [2018-10-24 14:50:59,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 14:50:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 3339 transitions. [2018-10-24 14:50:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-24 14:50:59,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:59,824 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:50:59,824 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:59,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:59,824 INFO L82 PathProgramCache]: Analyzing trace with hash 473686453, now seen corresponding path program 1 times [2018-10-24 14:50:59,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:59,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:59,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:59,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:59,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-24 14:51:00,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:00,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:51:00,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:00,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:00,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:00,306 INFO L87 Difference]: Start difference. First operand 3111 states and 3339 transitions. Second operand 4 states. [2018-10-24 14:51:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:01,100 INFO L93 Difference]: Finished difference Result 5683 states and 6130 transitions. [2018-10-24 14:51:01,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:01,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 289 [2018-10-24 14:51:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:01,102 INFO L225 Difference]: With dead ends: 5683 [2018-10-24 14:51:01,102 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:51:01,106 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-24 14:51:01,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:51:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:51:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:51:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:51:01,107 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 289 [2018-10-24 14:51:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:01,108 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:51:01,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:51:01,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:51:01,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:51:01,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:01,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:02,757 WARN L179 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-10-24 14:51:03,081 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-10-24 14:51:03,091 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:51:03,091 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:51:03,091 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,091 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,091 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,091 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,091 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,092 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,092 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:51:03,092 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:51:03,092 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:51:03,092 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:51:03,092 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:51:03,092 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:51:03,092 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:51:03,092 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:51:03,092 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:51:03,092 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:51:03,093 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,093 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,093 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,093 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,093 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,093 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,093 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:51:03,093 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:51:03,093 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:51:03,094 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:51:03,094 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:51:03,094 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:51:03,094 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:51:03,094 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:51:03,094 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:51:03,094 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:51:03,094 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:51:03,094 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:51:03,095 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:51:03,095 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:51:03,095 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:51:03,095 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,095 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,095 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,095 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,095 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,095 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:51:03,095 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:51:03,096 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:51:03,096 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:51:03,096 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:51:03,096 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:51:03,096 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:51:03,096 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:51:03,096 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:51:03,097 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1))) (let ((.cse7 (= ~a20~0 1)) (.cse3 (= ~a16~0 5)) (.cse4 (<= 15 ~a8~0)) (.cse11 (not .cse9)) (.cse1 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 6)) (.cse10 (<= ~a21~0 0)) (.cse5 (= ~a16~0 4)) (.cse6 (= ~a17~0 1)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse6 .cse0 .cse2 .cse3) (and .cse0 .cse6 .cse2 .cse7 .cse8) (and .cse9 .cse5 .cse2) (and .cse9 .cse2 .cse7) (and .cse9 .cse10 .cse0 .cse7) (and .cse5 .cse0 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2 .cse7) (and .cse9 .cse4 .cse2 .cse3) (and .cse4 .cse11 .cse6 .cse0 .cse2 .cse8) (and .cse4 .cse11 .cse0 .cse1 .cse2 .cse8) (and .cse9 .cse10 .cse5 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) (= ~a8~0 13) .cse6 .cse0 (<= ~a20~0 0))))) [2018-10-24 14:51:03,097 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,097 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,097 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,098 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,098 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,098 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:51:03,098 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:51:03,098 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:51:03,098 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:51:03,098 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:51:03,098 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:51:03,098 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:51:03,099 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:51:03,099 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:51:03,099 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:51:03,099 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:51:03,099 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:51:03,099 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:51:03,099 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:51:03,099 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,099 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,100 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,100 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,100 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,100 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:51:03,100 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:51:03,100 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:51:03,100 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:51:03,100 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:51:03,100 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:51:03,100 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:51:03,101 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:51:03,101 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:51:03,101 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,101 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,101 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,101 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,101 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,101 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:51:03,101 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:51:03,102 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:51:03,103 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,103 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,103 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,103 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1))) (let ((.cse7 (= ~a20~0 1)) (.cse3 (= ~a16~0 5)) (.cse4 (<= 15 ~a8~0)) (.cse11 (not .cse9)) (.cse1 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 6)) (.cse10 (<= ~a21~0 0)) (.cse5 (= ~a16~0 4)) (.cse6 (= ~a17~0 1)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse6 .cse0 .cse2 .cse3) (and .cse0 .cse6 .cse2 .cse7 .cse8) (and .cse9 .cse5 .cse2) (and .cse9 .cse2 .cse7) (and .cse9 .cse10 .cse0 .cse7) (and .cse5 .cse0 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2 .cse7) (and .cse9 .cse4 .cse2 .cse3) (and .cse4 .cse11 .cse6 .cse0 .cse2 .cse8) (and .cse4 .cse11 .cse0 .cse1 .cse2 .cse8) (and .cse9 .cse10 .cse5 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) (= ~a8~0 13) .cse6 .cse0 (<= ~a20~0 0))))) [2018-10-24 14:51:03,103 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,103 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,103 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:51:03,103 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:51:03,103 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:51:03,103 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:51:03,103 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:51:03,104 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,105 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 476) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:51:03,106 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:51:03,107 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,108 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,109 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,109 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,109 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:03,109 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:51:03,109 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:51:03,109 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:51:03,109 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:51:03,109 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:51:03,109 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:51:03,110 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:51:03,110 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:51:03,110 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:51:03,110 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:51:03,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:51:03 BoogieIcfgContainer [2018-10-24 14:51:03,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:51:03,153 INFO L168 Benchmark]: Toolchain (without parser) took 36669.03 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -868.3 MB). Peak memory consumption was 319.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:03,160 INFO L168 Benchmark]: CDTParser took 0.23 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-24 14:51:03,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.50 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-24 14:51:03,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 199.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:03,162 INFO L168 Benchmark]: Boogie Preprocessor took 64.23 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:51:03,162 INFO L168 Benchmark]: RCFGBuilder took 3462.19 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: 117.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:03,163 INFO L168 Benchmark]: TraceAbstraction took 32263.28 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 432.5 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -186.6 MB). Peak memory consumption was 245.9 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:03,171 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.23 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 674.50 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 199.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.23 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3462.19 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: 117.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32263.28 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 432.5 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -186.6 MB). Peak memory consumption was 245.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 476]: 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: ((((((((((((((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5) || ((((15 <= a8 && a16 == 4) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((15 <= a8 && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || ((((a12 == 8 && a17 == 1) && a21 == 1) && a20 == 1) && a16 == 6)) || ((a7 == 1 && a16 == 4) && a21 == 1)) || ((a7 == 1 && a21 == 1) && a20 == 1)) || (((a7 == 1 && a21 <= 0) && a12 == 8) && a20 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((((a16 == 4 && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((a7 == 1 && 15 <= a8) && a21 == 1) && a16 == 5)) || (((((15 <= a8 && !(a7 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || (((((15 <= a8 && !(a7 == 1)) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5) || ((((15 <= a8 && a16 == 4) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((15 <= a8 && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || ((((a12 == 8 && a17 == 1) && a21 == 1) && a20 == 1) && a16 == 6)) || ((a7 == 1 && a16 == 4) && a21 == 1)) || ((a7 == 1 && a21 == 1) && a20 == 1)) || (((a7 == 1 && a21 <= 0) && a12 == 8) && a20 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((((a16 == 4 && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((a7 == 1 && 15 <= a8) && a21 == 1) && a16 == 5)) || (((((15 <= a8 && !(a7 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || (((((15 <= a8 && !(a7 == 1)) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0) - 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, 32.1s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 21.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1789 SDtfs, 4045 SDslu, 837 SDs, 0 SdLazy, 9257 SolverSat, 1540 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 494 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3886occurred in iteration=7, 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.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 1302 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 74 NumberOfFragments, 425 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4790 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 178 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2695 NumberOfCodeBlocks, 2695 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2680 ConstructedInterpolants, 0 QuantifiedInterpolants, 1821835 SizeOfPredicates, 2 NumberOfNonLiveVariables, 856 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 2352/2384 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...