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/psyco/psyco_security_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 17:13:09,520 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 17:13:09,525 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 17:13:09,542 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 17:13:09,542 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 17:13:09,544 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 17:13:09,546 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 17:13:09,549 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 17:13:09,552 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 17:13:09,553 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 17:13:09,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 17:13:09,556 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 17:13:09,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 17:13:09,558 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 17:13:09,567 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 17:13:09,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 17:13:09,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 17:13:09,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 17:13:09,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 17:13:09,581 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 17:13:09,585 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 17:13:09,586 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 17:13:09,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 17:13:09,590 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 17:13:09,590 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 17:13:09,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 17:13:09,594 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 17:13:09,595 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 17:13:09,595 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 17:13:09,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 17:13:09,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 17:13:09,600 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 17:13:09,601 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 17:13:09,601 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 17:13:09,603 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 17:13:09,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 17:13:09,605 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 17:13:09,635 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 17:13:09,636 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 17:13:09,637 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 17:13:09,637 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 17:13:09,638 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 17:13:09,638 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 17:13:09,639 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 17:13:09,639 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 17:13:09,639 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 17:13:09,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 17:13:09,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 17:13:09,641 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 17:13:09,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 17:13:09,641 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 17:13:09,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 17:13:09,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 17:13:09,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 17:13:09,642 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 17:13:09,642 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 17:13:09,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 17:13:09,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 17:13:09,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 17:13:09,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 17:13:09,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 17:13:09,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 17:13:09,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 17:13:09,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 17:13:09,645 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 17:13:09,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 17:13:09,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 17:13:09,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 17:13:09,734 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 17:13:09,735 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 17:13:09,736 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_security_true-unreach-call_false-termination.c [2018-10-24 17:13:09,809 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fc9a394cf/be906da0cb87463ba05737d26417170e/FLAGc6bc290ad [2018-10-24 17:13:10,322 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 17:13:10,323 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security_true-unreach-call_false-termination.c [2018-10-24 17:13:10,334 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fc9a394cf/be906da0cb87463ba05737d26417170e/FLAGc6bc290ad [2018-10-24 17:13:10,348 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fc9a394cf/be906da0cb87463ba05737d26417170e [2018-10-24 17:13:10,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 17:13:10,360 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 17:13:10,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 17:13:10,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 17:13:10,365 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 17:13:10,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:13:10" (1/1) ... [2018-10-24 17:13:10,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e22e728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10, skipping insertion in model container [2018-10-24 17:13:10,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:13:10" (1/1) ... [2018-10-24 17:13:10,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 17:13:10,423 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 17:13:10,625 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 17:13:10,630 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 17:13:10,669 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 17:13:10,687 INFO L193 MainTranslator]: Completed translation [2018-10-24 17:13:10,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10 WrapperNode [2018-10-24 17:13:10,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 17:13:10,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 17:13:10,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 17:13:10,689 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 17:13:10,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10" (1/1) ... [2018-10-24 17:13:10,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10" (1/1) ... [2018-10-24 17:13:10,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 17:13:10,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 17:13:10,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 17:13:10,760 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 17:13:10,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10" (1/1) ... [2018-10-24 17:13:10,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10" (1/1) ... [2018-10-24 17:13:10,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10" (1/1) ... [2018-10-24 17:13:10,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10" (1/1) ... [2018-10-24 17:13:10,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10" (1/1) ... [2018-10-24 17:13:10,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10" (1/1) ... [2018-10-24 17:13:10,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10" (1/1) ... [2018-10-24 17:13:10,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 17:13:10,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 17:13:10,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 17:13:10,794 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 17:13:10,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10" (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 17:13:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 17:13:10,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 17:13:11,754 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 17:13:11,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:13:11 BoogieIcfgContainer [2018-10-24 17:13:11,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 17:13:11,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 17:13:11,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 17:13:11,760 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 17:13:11,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:13:10" (1/3) ... [2018-10-24 17:13:11,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9b980c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:13:11, skipping insertion in model container [2018-10-24 17:13:11,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:13:10" (2/3) ... [2018-10-24 17:13:11,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9b980c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:13:11, skipping insertion in model container [2018-10-24 17:13:11,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:13:11" (3/3) ... [2018-10-24 17:13:11,764 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_security_true-unreach-call_false-termination.c [2018-10-24 17:13:11,774 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 17:13:11,783 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 17:13:11,801 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 17:13:11,835 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 17:13:11,836 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 17:13:11,836 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 17:13:11,837 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 17:13:11,837 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 17:13:11,837 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 17:13:11,837 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 17:13:11,838 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 17:13:11,838 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 17:13:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-10-24 17:13:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-24 17:13:11,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:11,865 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:13:11,867 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:11,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:11,873 INFO L82 PathProgramCache]: Analyzing trace with hash 382154820, now seen corresponding path program 1 times [2018-10-24 17:13:11,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:11,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:11,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:11,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:11,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:11,987 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 17:13:11,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:11,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 17:13:11,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 17:13:12,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 17:13:12,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 17:13:12,014 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-10-24 17:13:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:12,043 INFO L93 Difference]: Finished difference Result 154 states and 292 transitions. [2018-10-24 17:13:12,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 17:13:12,045 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-10-24 17:13:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:12,063 INFO L225 Difference]: With dead ends: 154 [2018-10-24 17:13:12,063 INFO L226 Difference]: Without dead ends: 74 [2018-10-24 17:13:12,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 17:13:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-24 17:13:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-24 17:13:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-24 17:13:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2018-10-24 17:13:12,112 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 9 [2018-10-24 17:13:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:12,112 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2018-10-24 17:13:12,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 17:13:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2018-10-24 17:13:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-24 17:13:12,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:12,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:13:12,114 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:12,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:12,114 INFO L82 PathProgramCache]: Analyzing trace with hash -505610571, now seen corresponding path program 1 times [2018-10-24 17:13:12,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:12,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:12,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:12,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:12,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:12,147 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 17:13:12,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:12,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:12,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:12,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:12,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:12,154 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 3 states. [2018-10-24 17:13:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:12,406 INFO L93 Difference]: Finished difference Result 149 states and 220 transitions. [2018-10-24 17:13:12,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:12,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-24 17:13:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:12,409 INFO L225 Difference]: With dead ends: 149 [2018-10-24 17:13:12,409 INFO L226 Difference]: Without dead ends: 77 [2018-10-24 17:13:12,410 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 17:13:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-24 17:13:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-24 17:13:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-24 17:13:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2018-10-24 17:13:12,420 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 10 [2018-10-24 17:13:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:12,420 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2018-10-24 17:13:12,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2018-10-24 17:13:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-24 17:13:12,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:12,422 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:13:12,422 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:12,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:12,423 INFO L82 PathProgramCache]: Analyzing trace with hash -353906553, now seen corresponding path program 1 times [2018-10-24 17:13:12,423 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:12,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:12,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:12,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:12,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:13:12,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:12,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:12,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:12,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:12,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:12,478 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand 3 states. [2018-10-24 17:13:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:12,566 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2018-10-24 17:13:12,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:12,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-24 17:13:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:12,569 INFO L225 Difference]: With dead ends: 142 [2018-10-24 17:13:12,569 INFO L226 Difference]: Without dead ends: 68 [2018-10-24 17:13:12,572 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 17:13:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-24 17:13:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-24 17:13:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-24 17:13:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2018-10-24 17:13:12,587 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2018-10-24 17:13:12,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:12,587 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2018-10-24 17:13:12,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2018-10-24 17:13:12,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 17:13:12,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:12,589 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:13:12,589 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:12,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:12,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1763140240, now seen corresponding path program 1 times [2018-10-24 17:13:12,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:12,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:12,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:12,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:12,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:13:12,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:12,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:12,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:12,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:12,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:12,700 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 3 states. [2018-10-24 17:13:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:12,978 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2018-10-24 17:13:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:12,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-24 17:13:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:12,982 INFO L225 Difference]: With dead ends: 188 [2018-10-24 17:13:12,982 INFO L226 Difference]: Without dead ends: 118 [2018-10-24 17:13:12,983 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 17:13:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-24 17:13:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2018-10-24 17:13:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-24 17:13:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2018-10-24 17:13:12,994 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 18 [2018-10-24 17:13:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:12,995 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2018-10-24 17:13:12,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2018-10-24 17:13:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 17:13:12,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:12,996 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:13:12,997 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:12,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:12,997 INFO L82 PathProgramCache]: Analyzing trace with hash -523556731, now seen corresponding path program 1 times [2018-10-24 17:13:12,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:12,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:12,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:12,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:12,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:13:13,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:13,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:13,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:13,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:13,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:13,040 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand 3 states. [2018-10-24 17:13:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:13,115 INFO L93 Difference]: Finished difference Result 179 states and 256 transitions. [2018-10-24 17:13:13,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:13,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-24 17:13:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:13,116 INFO L225 Difference]: With dead ends: 179 [2018-10-24 17:13:13,117 INFO L226 Difference]: Without dead ends: 83 [2018-10-24 17:13:13,117 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 17:13:13,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-24 17:13:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-10-24 17:13:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-24 17:13:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2018-10-24 17:13:13,126 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 19 [2018-10-24 17:13:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:13,127 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2018-10-24 17:13:13,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2018-10-24 17:13:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-24 17:13:13,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:13,129 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:13:13,129 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:13,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:13,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1840910796, now seen corresponding path program 1 times [2018-10-24 17:13:13,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:13,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:13,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:13,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:13,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 17:13:13,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:13,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:13,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:13,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:13,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:13,185 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand 3 states. [2018-10-24 17:13:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:13,284 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2018-10-24 17:13:13,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:13,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-24 17:13:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:13,286 INFO L225 Difference]: With dead ends: 130 [2018-10-24 17:13:13,286 INFO L226 Difference]: Without dead ends: 66 [2018-10-24 17:13:13,287 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 17:13:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-24 17:13:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-24 17:13:13,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-24 17:13:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2018-10-24 17:13:13,293 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 25 [2018-10-24 17:13:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:13,294 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2018-10-24 17:13:13,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:13,294 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2018-10-24 17:13:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-24 17:13:13,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:13,295 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:13:13,296 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:13,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:13,296 INFO L82 PathProgramCache]: Analyzing trace with hash -579989151, now seen corresponding path program 1 times [2018-10-24 17:13:13,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:13,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:13,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:13,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:13,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 17:13:13,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:13,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:13,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:13,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:13,378 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand 3 states. [2018-10-24 17:13:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:13,742 INFO L93 Difference]: Finished difference Result 154 states and 224 transitions. [2018-10-24 17:13:13,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:13,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-24 17:13:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:13,745 INFO L225 Difference]: With dead ends: 154 [2018-10-24 17:13:13,746 INFO L226 Difference]: Without dead ends: 107 [2018-10-24 17:13:13,746 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 17:13:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-24 17:13:13,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2018-10-24 17:13:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-24 17:13:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2018-10-24 17:13:13,755 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 26 [2018-10-24 17:13:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:13,755 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2018-10-24 17:13:13,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2018-10-24 17:13:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 17:13:13,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:13,757 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:13:13,757 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:13,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash 351038789, now seen corresponding path program 1 times [2018-10-24 17:13:13,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:13,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:13,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:13,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:13,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 17:13:13,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:13,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:13,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:13,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:13,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:13,798 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand 3 states. [2018-10-24 17:13:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:13,920 INFO L93 Difference]: Finished difference Result 162 states and 228 transitions. [2018-10-24 17:13:13,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:13,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-24 17:13:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:13,922 INFO L225 Difference]: With dead ends: 162 [2018-10-24 17:13:13,923 INFO L226 Difference]: Without dead ends: 88 [2018-10-24 17:13:13,923 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 17:13:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-24 17:13:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-10-24 17:13:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-24 17:13:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2018-10-24 17:13:13,930 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 27 [2018-10-24 17:13:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:13,931 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2018-10-24 17:13:13,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2018-10-24 17:13:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 17:13:13,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:13,932 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:13:13,933 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:13,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:13,933 INFO L82 PathProgramCache]: Analyzing trace with hash 487392944, now seen corresponding path program 1 times [2018-10-24 17:13:13,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:13,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:13,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:13,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:13,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 17:13:13,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:13,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:13,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:13,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:13,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:13,971 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand 3 states. [2018-10-24 17:13:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:14,041 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2018-10-24 17:13:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:14,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-24 17:13:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:14,043 INFO L225 Difference]: With dead ends: 135 [2018-10-24 17:13:14,043 INFO L226 Difference]: Without dead ends: 68 [2018-10-24 17:13:14,043 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 17:13:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-24 17:13:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-24 17:13:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-24 17:13:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2018-10-24 17:13:14,049 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 27 [2018-10-24 17:13:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:14,049 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-10-24 17:13:14,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2018-10-24 17:13:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-24 17:13:14,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:14,051 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:13:14,052 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:14,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:14,052 INFO L82 PathProgramCache]: Analyzing trace with hash -715511988, now seen corresponding path program 1 times [2018-10-24 17:13:14,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:14,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:14,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:14,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:14,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 17:13:14,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:14,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:14,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:14,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:14,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:14,128 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand 3 states. [2018-10-24 17:13:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:14,278 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2018-10-24 17:13:14,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:14,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-24 17:13:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:14,279 INFO L225 Difference]: With dead ends: 70 [2018-10-24 17:13:14,280 INFO L226 Difference]: Without dead ends: 66 [2018-10-24 17:13:14,281 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 17:13:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-24 17:13:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-24 17:13:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-24 17:13:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2018-10-24 17:13:14,286 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 28 [2018-10-24 17:13:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:14,287 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2018-10-24 17:13:14,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2018-10-24 17:13:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-24 17:13:14,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:14,289 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 17:13:14,289 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:14,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:14,289 INFO L82 PathProgramCache]: Analyzing trace with hash -694584958, now seen corresponding path program 1 times [2018-10-24 17:13:14,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:14,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:14,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:14,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:14,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 17:13:14,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:14,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:14,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:14,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:14,331 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2018-10-24 17:13:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:14,421 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2018-10-24 17:13:14,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:14,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-24 17:13:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:14,422 INFO L225 Difference]: With dead ends: 107 [2018-10-24 17:13:14,422 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 17:13:14,423 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 17:13:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 17:13:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 17:13:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 17:13:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 17:13:14,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-10-24 17:13:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:14,425 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 17:13:14,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 17:13:14,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 17:13:14,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 17:13:14,784 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-24 17:13:14,813 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2018-10-24 17:13:14,814 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2018-10-24 17:13:14,814 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2018-10-24 17:13:14,814 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2018-10-24 17:13:14,814 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2018-10-24 17:13:14,814 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2018-10-24 17:13:14,814 INFO L425 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2018-10-24 17:13:14,814 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2018-10-24 17:13:14,814 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2018-10-24 17:13:14,814 INFO L425 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2018-10-24 17:13:14,814 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 17:13:14,815 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2018-10-24 17:13:14,815 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2018-10-24 17:13:14,815 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-10-24 17:13:14,815 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2018-10-24 17:13:14,815 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2018-10-24 17:13:14,815 INFO L425 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2018-10-24 17:13:14,815 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2018-10-24 17:13:14,815 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2018-10-24 17:13:14,815 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2018-10-24 17:13:14,816 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2018-10-24 17:13:14,816 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2018-10-24 17:13:14,816 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2018-10-24 17:13:14,816 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2018-10-24 17:13:14,816 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 385) the Hoare annotation is: (or (and (<= 4 ULTIMATE.start_main_~q~0) (= ULTIMATE.start_main_~this_state~0 3)) (and (<= ULTIMATE.start_main_~this_state~0 0) (= ULTIMATE.start_main_~q~0 0))) [2018-10-24 17:13:14,816 INFO L425 ceAbstractionStarter]: For program point L22-4(lines 22 385) no Hoare annotation was computed. [2018-10-24 17:13:14,817 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-10-24 17:13:14,817 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2018-10-24 17:13:14,817 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-10-24 17:13:14,817 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2018-10-24 17:13:14,817 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2018-10-24 17:13:14,817 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2018-10-24 17:13:14,817 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2018-10-24 17:13:14,817 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2018-10-24 17:13:14,818 INFO L425 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2018-10-24 17:13:14,818 INFO L421 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2018-10-24 17:13:14,818 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2018-10-24 17:13:14,818 INFO L425 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2018-10-24 17:13:14,818 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2018-10-24 17:13:14,818 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 17:13:14,818 INFO L425 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2018-10-24 17:13:14,818 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2018-10-24 17:13:14,818 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-10-24 17:13:14,819 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2018-10-24 17:13:14,819 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 17:13:14,819 INFO L425 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2018-10-24 17:13:14,819 INFO L428 ceAbstractionStarter]: At program point L13(lines 13 390) the Hoare annotation is: true [2018-10-24 17:13:14,819 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2018-10-24 17:13:14,819 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2018-10-24 17:13:14,819 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2018-10-24 17:13:14,819 INFO L425 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2018-10-24 17:13:14,819 INFO L425 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2018-10-24 17:13:14,820 INFO L425 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2018-10-24 17:13:14,820 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 17:13:14,820 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2018-10-24 17:13:14,820 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2018-10-24 17:13:14,820 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2018-10-24 17:13:14,820 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2018-10-24 17:13:14,820 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2018-10-24 17:13:14,821 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2018-10-24 17:13:14,821 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2018-10-24 17:13:14,821 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2018-10-24 17:13:14,821 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2018-10-24 17:13:14,821 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2018-10-24 17:13:14,821 INFO L425 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2018-10-24 17:13:14,821 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2018-10-24 17:13:14,821 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2018-10-24 17:13:14,822 INFO L425 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2018-10-24 17:13:14,822 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-10-24 17:13:14,822 INFO L421 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~this_state~0 0))) (or (and (<= 4 ULTIMATE.start_main_~q~0) (= ULTIMATE.start_main_~this_state~0 3)) (and (= ULTIMATE.start_main_~q~0 3) (= ULTIMATE.start_main_~this_state~0 2)) (and .cse0 (= ULTIMATE.start_main_~q~0 2)) (and .cse0 (= ULTIMATE.start_main_~q~0 0)))) [2018-10-24 17:13:14,822 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2018-10-24 17:13:14,822 INFO L425 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2018-10-24 17:13:14,823 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2018-10-24 17:13:14,823 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2018-10-24 17:13:14,823 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2018-10-24 17:13:14,823 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2018-10-24 17:13:14,823 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2018-10-24 17:13:14,823 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2018-10-24 17:13:14,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:13:14 BoogieIcfgContainer [2018-10-24 17:13:14,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 17:13:14,838 INFO L168 Benchmark]: Toolchain (without parser) took 4479.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -634.0 MB). Peak memory consumption was 123.6 MB. Max. memory is 7.1 GB. [2018-10-24 17:13:14,840 INFO L168 Benchmark]: CDTParser took 0.26 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 17:13:14,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.46 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 17:13:14,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 17:13:14,842 INFO L168 Benchmark]: Boogie Preprocessor took 34.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 17:13:14,842 INFO L168 Benchmark]: RCFGBuilder took 960.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.4 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-10-24 17:13:14,843 INFO L168 Benchmark]: TraceAbstraction took 3081.75 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: 145.8 MB). Peak memory consumption was 145.8 MB. Max. memory is 7.1 GB. [2018-10-24 17:13:14,848 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.26 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 327.46 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 960.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.4 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3081.75 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: 145.8 MB). Peak memory consumption was 145.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: 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: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((4 <= q && this_state == 3) || (q == 3 && this_state == 2)) || (this_state <= 0 && q == 2)) || (this_state <= 0 && q == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (4 <= q && this_state == 3) || (this_state <= 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 963 SDtfs, 337 SDslu, 415 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=4, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 46 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 8086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...