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_net_1_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 17:11:51,945 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 17:11:51,947 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 17:11:51,963 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 17:11:51,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 17:11:51,965 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 17:11:51,966 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 17:11:51,968 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 17:11:51,969 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 17:11:51,970 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 17:11:51,971 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 17:11:51,971 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 17:11:51,972 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 17:11:51,973 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 17:11:51,975 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 17:11:51,975 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 17:11:51,976 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 17:11:51,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 17:11:51,980 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 17:11:51,982 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 17:11:51,983 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 17:11:51,984 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 17:11:51,987 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 17:11:51,987 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 17:11:51,988 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 17:11:51,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 17:11:51,989 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 17:11:51,990 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 17:11:51,991 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 17:11:51,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 17:11:51,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 17:11:51,994 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 17:11:51,994 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 17:11:51,994 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 17:11:51,995 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 17:11:51,996 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 17:11:51,996 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:11:52,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 17:11:52,015 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 17:11:52,016 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 17:11:52,016 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 17:11:52,017 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 17:11:52,017 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 17:11:52,017 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 17:11:52,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 17:11:52,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 17:11:52,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 17:11:52,018 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 17:11:52,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 17:11:52,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 17:11:52,019 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 17:11:52,019 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 17:11:52,019 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 17:11:52,019 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 17:11:52,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 17:11:52,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 17:11:52,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 17:11:52,020 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 17:11:52,020 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 17:11:52,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 17:11:52,021 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 17:11:52,021 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 17:11:52,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 17:11:52,021 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 17:11:52,022 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 17:11:52,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 17:11:52,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 17:11:52,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 17:11:52,090 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 17:11:52,091 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 17:11:52,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_net_1_false-unreach-call_false-termination.c [2018-10-24 17:11:52,157 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/876a7ab83/708f499a941642508352476e1fe903ec/FLAGe925f54af [2018-10-24 17:11:53,351 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 17:11:53,352 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_net_1_false-unreach-call_false-termination.c [2018-10-24 17:11:53,502 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/876a7ab83/708f499a941642508352476e1fe903ec/FLAGe925f54af [2018-10-24 17:11:53,518 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/876a7ab83/708f499a941642508352476e1fe903ec [2018-10-24 17:11:53,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 17:11:53,531 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 17:11:53,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 17:11:53,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 17:11:53,536 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 17:11:53,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:11:53" (1/1) ... [2018-10-24 17:11:53,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b326c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:11:53, skipping insertion in model container [2018-10-24 17:11:53,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:11:53" (1/1) ... [2018-10-24 17:11:53,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 17:11:54,122 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 17:11:55,954 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 17:11:55,961 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 17:11:57,260 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 17:11:57,278 INFO L193 MainTranslator]: Completed translation [2018-10-24 17:11:57,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:11:57 WrapperNode [2018-10-24 17:11:57,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 17:11:57,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 17:11:57,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 17:11:57,280 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 17:11:57,292 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:11:57" (1/1) ... [2018-10-24 17:11:57,457 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:11:57" (1/1) ... [2018-10-24 17:11:58,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 17:11:58,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 17:11:58,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 17:11:58,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 17:11:58,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:11:57" (1/1) ... [2018-10-24 17:11:58,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:11:57" (1/1) ... [2018-10-24 17:11:58,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:11:57" (1/1) ... [2018-10-24 17:11:58,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:11:57" (1/1) ... [2018-10-24 17:11:59,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:11:57" (1/1) ... [2018-10-24 17:11:59,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:11:57" (1/1) ... [2018-10-24 17:11:59,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:11:57" (1/1) ... [2018-10-24 17:11:59,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 17:11:59,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 17:11:59,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 17:11:59,788 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 17:11:59,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:11:57" (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:11:59,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 17:11:59,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 17:12:24,717 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 17:12:24,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:12:24 BoogieIcfgContainer [2018-10-24 17:12:24,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 17:12:24,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 17:12:24,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 17:12:24,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 17:12:24,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:11:53" (1/3) ... [2018-10-24 17:12:24,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628eca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:12:24, skipping insertion in model container [2018-10-24 17:12:24,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:11:57" (2/3) ... [2018-10-24 17:12:24,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628eca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:12:24, skipping insertion in model container [2018-10-24 17:12:24,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:12:24" (3/3) ... [2018-10-24 17:12:24,727 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_net_1_false-unreach-call_false-termination.c [2018-10-24 17:12:24,737 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 17:12:24,749 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 17:12:24,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 17:12:24,834 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 17:12:24,835 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 17:12:24,835 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 17:12:24,835 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 17:12:24,835 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 17:12:24,836 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 17:12:24,836 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 17:12:24,836 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 17:12:24,836 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 17:12:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states. [2018-10-24 17:12:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-24 17:12:24,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:24,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:24,971 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:24,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:24,978 INFO L82 PathProgramCache]: Analyzing trace with hash 382202501, now seen corresponding path program 1 times [2018-10-24 17:12:24,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:24,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:25,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:25,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:25,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:25,237 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:12:25,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:25,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 17:12:25,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 17:12:25,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 17:12:25,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 17:12:25,264 INFO L87 Difference]: Start difference. First operand 9211 states. Second operand 2 states. [2018-10-24 17:12:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:25,540 INFO L93 Difference]: Finished difference Result 17698 states and 35380 transitions. [2018-10-24 17:12:25,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 17:12:25,541 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-10-24 17:12:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:25,627 INFO L225 Difference]: With dead ends: 17698 [2018-10-24 17:12:25,628 INFO L226 Difference]: Without dead ends: 8280 [2018-10-24 17:12:25,655 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:12:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2018-10-24 17:12:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 8280. [2018-10-24 17:12:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8280 states. [2018-10-24 17:12:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8280 states to 8280 states and 12997 transitions. [2018-10-24 17:12:25,954 INFO L78 Accepts]: Start accepts. Automaton has 8280 states and 12997 transitions. Word has length 9 [2018-10-24 17:12:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:25,954 INFO L481 AbstractCegarLoop]: Abstraction has 8280 states and 12997 transitions. [2018-10-24 17:12:25,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 17:12:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 8280 states and 12997 transitions. [2018-10-24 17:12:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-24 17:12:25,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:25,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:25,956 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:25,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash -505562890, now seen corresponding path program 1 times [2018-10-24 17:12:25,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:25,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:25,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:25,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:25,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:26,165 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:12:26,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:26,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:26,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:26,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:26,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:26,168 INFO L87 Difference]: Start difference. First operand 8280 states and 12997 transitions. Second operand 3 states. [2018-10-24 17:12:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:30,993 INFO L93 Difference]: Finished difference Result 16561 states and 25996 transitions. [2018-10-24 17:12:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:30,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-24 17:12:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:31,039 INFO L225 Difference]: With dead ends: 16561 [2018-10-24 17:12:31,039 INFO L226 Difference]: Without dead ends: 8283 [2018-10-24 17:12:31,052 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:12:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2018-10-24 17:12:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 8283. [2018-10-24 17:12:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8283 states. [2018-10-24 17:12:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 13000 transitions. [2018-10-24 17:12:31,217 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 13000 transitions. Word has length 10 [2018-10-24 17:12:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:31,217 INFO L481 AbstractCegarLoop]: Abstraction has 8283 states and 13000 transitions. [2018-10-24 17:12:31,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 13000 transitions. [2018-10-24 17:12:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-24 17:12:31,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:31,219 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:12:31,219 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:31,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash -353858872, now seen corresponding path program 1 times [2018-10-24 17:12:31,220 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:31,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:31,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:31,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:31,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:31,343 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:12:31,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:31,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:31,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:31,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:31,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:31,345 INFO L87 Difference]: Start difference. First operand 8283 states and 13000 transitions. Second operand 3 states. [2018-10-24 17:12:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:34,683 INFO L93 Difference]: Finished difference Result 16456 states and 25845 transitions. [2018-10-24 17:12:34,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:34,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-24 17:12:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:34,728 INFO L225 Difference]: With dead ends: 16456 [2018-10-24 17:12:34,728 INFO L226 Difference]: Without dead ends: 8176 [2018-10-24 17:12:34,740 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:12:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2018-10-24 17:12:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8176. [2018-10-24 17:12:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8176 states. [2018-10-24 17:12:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8176 states to 8176 states and 12846 transitions. [2018-10-24 17:12:34,880 INFO L78 Accepts]: Start accepts. Automaton has 8176 states and 12846 transitions. Word has length 15 [2018-10-24 17:12:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:34,881 INFO L481 AbstractCegarLoop]: Abstraction has 8176 states and 12846 transitions. [2018-10-24 17:12:34,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 8176 states and 12846 transitions. [2018-10-24 17:12:34,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 17:12:34,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:34,883 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:12:34,883 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:34,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:34,883 INFO L82 PathProgramCache]: Analyzing trace with hash -308800459, now seen corresponding path program 1 times [2018-10-24 17:12:34,883 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:34,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:34,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:34,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:34,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:35,001 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:12:35,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:35,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:35,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:35,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:35,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:35,003 INFO L87 Difference]: Start difference. First operand 8176 states and 12846 transitions. Second operand 3 states. [2018-10-24 17:12:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:40,263 INFO L93 Difference]: Finished difference Result 16264 states and 25563 transitions. [2018-10-24 17:12:40,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:40,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-24 17:12:40,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:40,282 INFO L225 Difference]: With dead ends: 16264 [2018-10-24 17:12:40,283 INFO L226 Difference]: Without dead ends: 8056 [2018-10-24 17:12:40,294 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:12:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2018-10-24 17:12:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 8056. [2018-10-24 17:12:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2018-10-24 17:12:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 12226 transitions. [2018-10-24 17:12:40,438 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 12226 transitions. Word has length 19 [2018-10-24 17:12:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:40,439 INFO L481 AbstractCegarLoop]: Abstraction has 8056 states and 12226 transitions. [2018-10-24 17:12:40,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 12226 transitions. [2018-10-24 17:12:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-24 17:12:40,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:40,442 INFO L375 BasicCegarLoop]: trace histogram [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:12:40,442 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:40,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:40,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2047414700, now seen corresponding path program 1 times [2018-10-24 17:12:40,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:40,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:40,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:40,582 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:12:40,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:40,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:40,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:40,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:40,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:40,584 INFO L87 Difference]: Start difference. First operand 8056 states and 12226 transitions. Second operand 3 states. [2018-10-24 17:12:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:43,110 INFO L93 Difference]: Finished difference Result 16110 states and 24449 transitions. [2018-10-24 17:12:43,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:43,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-24 17:12:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:43,128 INFO L225 Difference]: With dead ends: 16110 [2018-10-24 17:12:43,128 INFO L226 Difference]: Without dead ends: 8062 [2018-10-24 17:12:43,139 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:12:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2018-10-24 17:12:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 8060. [2018-10-24 17:12:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8060 states. [2018-10-24 17:12:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8060 states to 8060 states and 12230 transitions. [2018-10-24 17:12:43,256 INFO L78 Accepts]: Start accepts. Automaton has 8060 states and 12230 transitions. Word has length 22 [2018-10-24 17:12:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:43,256 INFO L481 AbstractCegarLoop]: Abstraction has 8060 states and 12230 transitions. [2018-10-24 17:12:43,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 8060 states and 12230 transitions. [2018-10-24 17:12:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 17:12:43,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:43,257 INFO L375 BasicCegarLoop]: trace histogram [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:12:43,258 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:43,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:43,258 INFO L82 PathProgramCache]: Analyzing trace with hash 986032085, now seen corresponding path program 1 times [2018-10-24 17:12:43,258 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:43,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:43,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:43,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:43,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:43,367 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:12:43,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:43,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:43,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:43,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:43,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:43,369 INFO L87 Difference]: Start difference. First operand 8060 states and 12230 transitions. Second operand 3 states. [2018-10-24 17:12:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:47,658 INFO L93 Difference]: Finished difference Result 24164 states and 36672 transitions. [2018-10-24 17:12:47,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:47,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-24 17:12:47,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:47,692 INFO L225 Difference]: With dead ends: 24164 [2018-10-24 17:12:47,693 INFO L226 Difference]: Without dead ends: 16064 [2018-10-24 17:12:47,706 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:12:47,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16064 states. [2018-10-24 17:12:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16064 to 14806. [2018-10-24 17:12:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14806 states. [2018-10-24 17:12:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14806 states to 14806 states and 23042 transitions. [2018-10-24 17:12:47,986 INFO L78 Accepts]: Start accepts. Automaton has 14806 states and 23042 transitions. Word has length 23 [2018-10-24 17:12:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:47,987 INFO L481 AbstractCegarLoop]: Abstraction has 14806 states and 23042 transitions. [2018-10-24 17:12:47,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14806 states and 23042 transitions. [2018-10-24 17:12:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-24 17:12:47,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:47,988 INFO L375 BasicCegarLoop]: trace histogram [2, 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 17:12:47,988 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:47,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:47,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1288932026, now seen corresponding path program 1 times [2018-10-24 17:12:47,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:47,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:47,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:47,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:47,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:48,163 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:12:48,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:48,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:48,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:48,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:48,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:48,165 INFO L87 Difference]: Start difference. First operand 14806 states and 23042 transitions. Second operand 3 states. [2018-10-24 17:12:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:12:56,222 INFO L93 Difference]: Finished difference Result 37336 states and 57904 transitions. [2018-10-24 17:12:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:12:56,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-24 17:12:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:12:56,269 INFO L225 Difference]: With dead ends: 37336 [2018-10-24 17:12:56,269 INFO L226 Difference]: Without dead ends: 22266 [2018-10-24 17:12:56,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 17:12:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22266 states. [2018-10-24 17:12:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22266 to 21072. [2018-10-24 17:12:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21072 states. [2018-10-24 17:12:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21072 states to 21072 states and 32684 transitions. [2018-10-24 17:12:56,606 INFO L78 Accepts]: Start accepts. Automaton has 21072 states and 32684 transitions. Word has length 25 [2018-10-24 17:12:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:12:56,606 INFO L481 AbstractCegarLoop]: Abstraction has 21072 states and 32684 transitions. [2018-10-24 17:12:56,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:12:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 21072 states and 32684 transitions. [2018-10-24 17:12:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-24 17:12:56,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:12:56,607 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 17:12:56,611 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:12:56,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:12:56,612 INFO L82 PathProgramCache]: Analyzing trace with hash -850520380, now seen corresponding path program 1 times [2018-10-24 17:12:56,612 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:12:56,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:12:56,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:56,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:12:56,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:12:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:12:56,782 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:12:56,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:12:56,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:12:56,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:12:56,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:12:56,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:12:56,784 INFO L87 Difference]: Start difference. First operand 21072 states and 32684 transitions. Second operand 3 states. [2018-10-24 17:13:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:04,731 INFO L93 Difference]: Finished difference Result 63170 states and 97974 transitions. [2018-10-24 17:13:04,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:04,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-24 17:13:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:04,835 INFO L225 Difference]: With dead ends: 63170 [2018-10-24 17:13:04,835 INFO L226 Difference]: Without dead ends: 42106 [2018-10-24 17:13:04,866 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:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42106 states. [2018-10-24 17:13:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42106 to 40080. [2018-10-24 17:13:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40080 states. [2018-10-24 17:13:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40080 states to 40080 states and 63058 transitions. [2018-10-24 17:13:06,210 INFO L78 Accepts]: Start accepts. Automaton has 40080 states and 63058 transitions. Word has length 30 [2018-10-24 17:13:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:06,210 INFO L481 AbstractCegarLoop]: Abstraction has 40080 states and 63058 transitions. [2018-10-24 17:13:06,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 40080 states and 63058 transitions. [2018-10-24 17:13:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-24 17:13:06,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:06,214 INFO L375 BasicCegarLoop]: trace histogram [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 17:13:06,214 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:06,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:06,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1737047031, now seen corresponding path program 1 times [2018-10-24 17:13:06,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:06,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:06,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:06,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:06,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:06,334 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:06,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:06,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:06,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:06,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:06,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:06,336 INFO L87 Difference]: Start difference. First operand 40080 states and 63058 transitions. Second operand 3 states. [2018-10-24 17:13:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:11,153 INFO L93 Difference]: Finished difference Result 107942 states and 170044 transitions. [2018-10-24 17:13:11,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:11,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-24 17:13:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:11,286 INFO L225 Difference]: With dead ends: 107942 [2018-10-24 17:13:11,286 INFO L226 Difference]: Without dead ends: 67822 [2018-10-24 17:13:11,334 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:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67822 states. [2018-10-24 17:13:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67822 to 66148. [2018-10-24 17:13:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66148 states. [2018-10-24 17:13:12,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66148 states to 66148 states and 104778 transitions. [2018-10-24 17:13:12,196 INFO L78 Accepts]: Start accepts. Automaton has 66148 states and 104778 transitions. Word has length 39 [2018-10-24 17:13:12,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:12,196 INFO L481 AbstractCegarLoop]: Abstraction has 66148 states and 104778 transitions. [2018-10-24 17:13:12,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 66148 states and 104778 transitions. [2018-10-24 17:13:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-24 17:13:12,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:12,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:13:12,198 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:12,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:12,198 INFO L82 PathProgramCache]: Analyzing trace with hash -751694899, now seen corresponding path program 1 times [2018-10-24 17:13:12,199 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:12,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:12,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:12,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:12,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:12,316 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:12,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:12,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:12,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:12,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:12,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:12,318 INFO L87 Difference]: Start difference. First operand 66148 states and 104778 transitions. Second operand 3 states. [2018-10-24 17:13:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:15,005 INFO L93 Difference]: Finished difference Result 132340 states and 209618 transitions. [2018-10-24 17:13:15,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:15,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-24 17:13:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:15,092 INFO L225 Difference]: With dead ends: 132340 [2018-10-24 17:13:15,092 INFO L226 Difference]: Without dead ends: 66200 [2018-10-24 17:13:15,147 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:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66200 states. [2018-10-24 17:13:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66200 to 66198. [2018-10-24 17:13:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66198 states. [2018-10-24 17:13:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66198 states to 66198 states and 104828 transitions. [2018-10-24 17:13:16,683 INFO L78 Accepts]: Start accepts. Automaton has 66198 states and 104828 transitions. Word has length 43 [2018-10-24 17:13:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:16,684 INFO L481 AbstractCegarLoop]: Abstraction has 66198 states and 104828 transitions. [2018-10-24 17:13:16,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 66198 states and 104828 transitions. [2018-10-24 17:13:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 17:13:16,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:16,685 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, 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 17:13:16,686 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:16,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:16,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1571673310, now seen corresponding path program 1 times [2018-10-24 17:13:16,686 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:16,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:16,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:16,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:16,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:13:16,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:16,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 17:13:16,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 17:13:16,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 17:13:16,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 17:13:16,941 INFO L87 Difference]: Start difference. First operand 66198 states and 104828 transitions. Second operand 4 states. [2018-10-24 17:13:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:25,262 INFO L93 Difference]: Finished difference Result 126785 states and 200685 transitions. [2018-10-24 17:13:25,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 17:13:25,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-10-24 17:13:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:25,346 INFO L225 Difference]: With dead ends: 126785 [2018-10-24 17:13:25,346 INFO L226 Difference]: Without dead ends: 66492 [2018-10-24 17:13:25,395 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 17:13:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66492 states. [2018-10-24 17:13:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66492 to 63918. [2018-10-24 17:13:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63918 states. [2018-10-24 17:13:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63918 states to 63918 states and 99848 transitions. [2018-10-24 17:13:27,347 INFO L78 Accepts]: Start accepts. Automaton has 63918 states and 99848 transitions. Word has length 52 [2018-10-24 17:13:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:27,347 INFO L481 AbstractCegarLoop]: Abstraction has 63918 states and 99848 transitions. [2018-10-24 17:13:27,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 17:13:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 63918 states and 99848 transitions. [2018-10-24 17:13:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-24 17:13:27,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:27,349 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, 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 17:13:27,349 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:27,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:27,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1501422595, now seen corresponding path program 1 times [2018-10-24 17:13:27,350 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:27,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:27,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:27,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:27,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:27,481 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:27,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:27,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:27,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:27,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:27,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:27,483 INFO L87 Difference]: Start difference. First operand 63918 states and 99848 transitions. Second operand 3 states. [2018-10-24 17:13:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:29,543 INFO L93 Difference]: Finished difference Result 127890 states and 199778 transitions. [2018-10-24 17:13:29,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:29,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-10-24 17:13:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:29,622 INFO L225 Difference]: With dead ends: 127890 [2018-10-24 17:13:29,622 INFO L226 Difference]: Without dead ends: 63980 [2018-10-24 17:13:29,659 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:29,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63980 states. [2018-10-24 17:13:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63980 to 63978. [2018-10-24 17:13:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63978 states. [2018-10-24 17:13:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63978 states to 63978 states and 99908 transitions. [2018-10-24 17:13:30,323 INFO L78 Accepts]: Start accepts. Automaton has 63978 states and 99908 transitions. Word has length 53 [2018-10-24 17:13:30,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:30,324 INFO L481 AbstractCegarLoop]: Abstraction has 63978 states and 99908 transitions. [2018-10-24 17:13:30,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 63978 states and 99908 transitions. [2018-10-24 17:13:30,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-24 17:13:30,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:30,325 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, 1, 1, 1, 1, 1, 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 17:13:30,325 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:30,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:30,326 INFO L82 PathProgramCache]: Analyzing trace with hash 202272896, now seen corresponding path program 1 times [2018-10-24 17:13:30,326 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:30,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:30,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:30,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:30,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:30,477 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:30,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:30,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 17:13:30,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 17:13:30,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 17:13:30,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 17:13:30,478 INFO L87 Difference]: Start difference. First operand 63978 states and 99908 transitions. Second operand 4 states. [2018-10-24 17:13:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:36,671 INFO L93 Difference]: Finished difference Result 116798 states and 181838 transitions. [2018-10-24 17:13:36,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:36,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-10-24 17:13:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:36,748 INFO L225 Difference]: With dead ends: 116798 [2018-10-24 17:13:36,748 INFO L226 Difference]: Without dead ends: 64988 [2018-10-24 17:13:36,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 17:13:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64988 states. [2018-10-24 17:13:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64988 to 63722. [2018-10-24 17:13:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63722 states. [2018-10-24 17:13:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63722 states to 63722 states and 98884 transitions. [2018-10-24 17:13:37,394 INFO L78 Accepts]: Start accepts. Automaton has 63722 states and 98884 transitions. Word has length 58 [2018-10-24 17:13:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:37,394 INFO L481 AbstractCegarLoop]: Abstraction has 63722 states and 98884 transitions. [2018-10-24 17:13:37,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 17:13:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 63722 states and 98884 transitions. [2018-10-24 17:13:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-24 17:13:37,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:37,396 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 17:13:37,396 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:37,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:37,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1537843893, now seen corresponding path program 1 times [2018-10-24 17:13:37,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:37,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:37,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:37,535 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:37,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:37,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:37,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:37,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:37,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:37,537 INFO L87 Difference]: Start difference. First operand 63722 states and 98884 transitions. Second operand 3 states. [2018-10-24 17:13:43,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:43,967 INFO L93 Difference]: Finished difference Result 129850 states and 200364 transitions. [2018-10-24 17:13:43,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:43,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-10-24 17:13:43,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:44,045 INFO L225 Difference]: With dead ends: 129850 [2018-10-24 17:13:44,045 INFO L226 Difference]: Without dead ends: 66096 [2018-10-24 17:13:44,087 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:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66096 states. [2018-10-24 17:13:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66096 to 63402. [2018-10-24 17:13:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63402 states. [2018-10-24 17:13:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63402 states to 63402 states and 98164 transitions. [2018-10-24 17:13:44,705 INFO L78 Accepts]: Start accepts. Automaton has 63402 states and 98164 transitions. Word has length 64 [2018-10-24 17:13:44,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:44,705 INFO L481 AbstractCegarLoop]: Abstraction has 63402 states and 98164 transitions. [2018-10-24 17:13:44,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 63402 states and 98164 transitions. [2018-10-24 17:13:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-24 17:13:44,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:44,707 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 17:13:44,708 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:44,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:44,708 INFO L82 PathProgramCache]: Analyzing trace with hash -106919386, now seen corresponding path program 1 times [2018-10-24 17:13:44,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:44,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:44,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:44,918 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:44,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:44,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:44,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:44,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:44,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:44,920 INFO L87 Difference]: Start difference. First operand 63402 states and 98164 transitions. Second operand 3 states. [2018-10-24 17:13:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:51,532 INFO L93 Difference]: Finished difference Result 91358 states and 140318 transitions. [2018-10-24 17:13:51,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:51,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-10-24 17:13:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:51,610 INFO L225 Difference]: With dead ends: 91358 [2018-10-24 17:13:51,610 INFO L226 Difference]: Without dead ends: 64708 [2018-10-24 17:13:51,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 17:13:51,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64708 states. [2018-10-24 17:13:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64708 to 63410. [2018-10-24 17:13:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63410 states. [2018-10-24 17:13:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63410 states to 63410 states and 98092 transitions. [2018-10-24 17:13:52,257 INFO L78 Accepts]: Start accepts. Automaton has 63410 states and 98092 transitions. Word has length 74 [2018-10-24 17:13:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:52,257 INFO L481 AbstractCegarLoop]: Abstraction has 63410 states and 98092 transitions. [2018-10-24 17:13:52,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 63410 states and 98092 transitions. [2018-10-24 17:13:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-24 17:13:52,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:52,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:52,259 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:52,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:52,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1408861189, now seen corresponding path program 1 times [2018-10-24 17:13:52,260 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:52,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:52,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:52,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:52,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:52,363 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:52,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:52,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:52,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:52,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:52,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:52,365 INFO L87 Difference]: Start difference. First operand 63410 states and 98092 transitions. Second operand 3 states. [2018-10-24 17:13:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:53,892 INFO L93 Difference]: Finished difference Result 121045 states and 187238 transitions. [2018-10-24 17:13:53,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:53,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-10-24 17:13:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:53,969 INFO L225 Difference]: With dead ends: 121045 [2018-10-24 17:13:53,970 INFO L226 Difference]: Without dead ends: 57643 [2018-10-24 17:13:54,014 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:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57643 states. [2018-10-24 17:13:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57643 to 57641. [2018-10-24 17:13:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57641 states. [2018-10-24 17:13:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57641 states to 57641 states and 89114 transitions. [2018-10-24 17:13:54,874 INFO L78 Accepts]: Start accepts. Automaton has 57641 states and 89114 transitions. Word has length 81 [2018-10-24 17:13:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:54,874 INFO L481 AbstractCegarLoop]: Abstraction has 57641 states and 89114 transitions. [2018-10-24 17:13:54,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 57641 states and 89114 transitions. [2018-10-24 17:13:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-24 17:13:54,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:54,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:54,876 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:54,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1579885087, now seen corresponding path program 1 times [2018-10-24 17:13:54,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:54,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:54,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:54,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:54,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:54,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:13:54,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:13:54,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:13:54,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:13:54,971 INFO L87 Difference]: Start difference. First operand 57641 states and 89114 transitions. Second operand 3 states. [2018-10-24 17:13:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:13:56,707 INFO L93 Difference]: Finished difference Result 114966 states and 177748 transitions. [2018-10-24 17:13:56,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:13:56,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-24 17:13:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:13:56,777 INFO L225 Difference]: With dead ends: 114966 [2018-10-24 17:13:56,777 INFO L226 Difference]: Without dead ends: 57723 [2018-10-24 17:13:56,820 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:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57723 states. [2018-10-24 17:13:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57723 to 57721. [2018-10-24 17:13:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57721 states. [2018-10-24 17:13:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57721 states to 57721 states and 89194 transitions. [2018-10-24 17:13:57,350 INFO L78 Accepts]: Start accepts. Automaton has 57721 states and 89194 transitions. Word has length 84 [2018-10-24 17:13:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:13:57,350 INFO L481 AbstractCegarLoop]: Abstraction has 57721 states and 89194 transitions. [2018-10-24 17:13:57,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:13:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 57721 states and 89194 transitions. [2018-10-24 17:13:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-24 17:13:57,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:13:57,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:57,352 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:13:57,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:13:57,352 INFO L82 PathProgramCache]: Analyzing trace with hash 134709906, now seen corresponding path program 1 times [2018-10-24 17:13:57,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:13:57,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:13:57,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:57,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:13:57,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:13:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:13:57,766 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 17:13:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:13:57,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:13:57,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 17:13:57,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 17:13:57,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 17:13:57,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 17:13:57,795 INFO L87 Difference]: Start difference. First operand 57721 states and 89194 transitions. Second operand 4 states. [2018-10-24 17:14:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:14:04,918 INFO L93 Difference]: Finished difference Result 82679 states and 126797 transitions. [2018-10-24 17:14:04,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 17:14:04,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-10-24 17:14:04,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:14:04,963 INFO L225 Difference]: With dead ends: 82679 [2018-10-24 17:14:04,963 INFO L226 Difference]: Without dead ends: 36250 [2018-10-24 17:14:04,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 17:14:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36250 states. [2018-10-24 17:14:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36250 to 35099. [2018-10-24 17:14:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35099 states. [2018-10-24 17:14:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35099 states to 35099 states and 53383 transitions. [2018-10-24 17:14:05,314 INFO L78 Accepts]: Start accepts. Automaton has 35099 states and 53383 transitions. Word has length 88 [2018-10-24 17:14:05,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:14:05,314 INFO L481 AbstractCegarLoop]: Abstraction has 35099 states and 53383 transitions. [2018-10-24 17:14:05,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 17:14:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 35099 states and 53383 transitions. [2018-10-24 17:14:05,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-24 17:14:05,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:14:05,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:14:05,316 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:14:05,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:14:05,316 INFO L82 PathProgramCache]: Analyzing trace with hash 961940546, now seen corresponding path program 1 times [2018-10-24 17:14:05,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:14:05,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:14:05,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:05,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:14:05,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:14:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:14:05,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:14:05,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 17:14:05,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 17:14:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 17:14:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 17:14:05,539 INFO L87 Difference]: Start difference. First operand 35099 states and 53383 transitions. Second operand 4 states. [2018-10-24 17:14:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:14:12,450 INFO L93 Difference]: Finished difference Result 48617 states and 72988 transitions. [2018-10-24 17:14:12,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 17:14:12,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-10-24 17:14:12,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:14:12,478 INFO L225 Difference]: With dead ends: 48617 [2018-10-24 17:14:12,478 INFO L226 Difference]: Without dead ends: 24950 [2018-10-24 17:14:12,497 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 17:14:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24950 states. [2018-10-24 17:14:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24950 to 23799. [2018-10-24 17:14:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23799 states. [2018-10-24 17:14:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23799 states to 23799 states and 35861 transitions. [2018-10-24 17:14:12,689 INFO L78 Accepts]: Start accepts. Automaton has 23799 states and 35861 transitions. Word has length 90 [2018-10-24 17:14:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:14:12,690 INFO L481 AbstractCegarLoop]: Abstraction has 23799 states and 35861 transitions. [2018-10-24 17:14:12,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 17:14:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 23799 states and 35861 transitions. [2018-10-24 17:14:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 17:14:12,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:14:12,691 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 17:14:12,692 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:14:12,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:14:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1610003192, now seen corresponding path program 1 times [2018-10-24 17:14:12,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:14:12,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:14:12,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:12,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:14:12,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:14:12,804 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:14:12,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:14:12,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:14:12,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:14:12,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:14:12,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:14:12,806 INFO L87 Difference]: Start difference. First operand 23799 states and 35861 transitions. Second operand 3 states. [2018-10-24 17:14:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:14:14,847 INFO L93 Difference]: Finished difference Result 24574 states and 36974 transitions. [2018-10-24 17:14:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:14:14,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-10-24 17:14:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:14:14,872 INFO L225 Difference]: With dead ends: 24574 [2018-10-24 17:14:14,873 INFO L226 Difference]: Without dead ends: 24572 [2018-10-24 17:14:14,880 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:14:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24572 states. [2018-10-24 17:14:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24572 to 24570. [2018-10-24 17:14:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24570 states. [2018-10-24 17:14:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24570 states to 24570 states and 36964 transitions. [2018-10-24 17:14:15,100 INFO L78 Accepts]: Start accepts. Automaton has 24570 states and 36964 transitions. Word has length 98 [2018-10-24 17:14:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:14:15,101 INFO L481 AbstractCegarLoop]: Abstraction has 24570 states and 36964 transitions. [2018-10-24 17:14:15,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:14:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 24570 states and 36964 transitions. [2018-10-24 17:14:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-24 17:14:15,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:14:15,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:14:15,103 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:14:15,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:14:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash 651727635, now seen corresponding path program 1 times [2018-10-24 17:14:15,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:14:15,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:14:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:15,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:14:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:14:15,219 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:14:15,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:14:15,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:14:15,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:14:15,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:14:15,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:14:15,221 INFO L87 Difference]: Start difference. First operand 24570 states and 36964 transitions. Second operand 3 states. [2018-10-24 17:14:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:14:17,173 INFO L93 Difference]: Finished difference Result 42966 states and 64448 transitions. [2018-10-24 17:14:17,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:14:17,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-10-24 17:14:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:14:17,194 INFO L225 Difference]: With dead ends: 42966 [2018-10-24 17:14:17,194 INFO L226 Difference]: Without dead ends: 19565 [2018-10-24 17:14:17,211 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:14:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19565 states. [2018-10-24 17:14:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19565 to 19563. [2018-10-24 17:14:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19563 states. [2018-10-24 17:14:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19563 states to 19563 states and 29149 transitions. [2018-10-24 17:14:17,379 INFO L78 Accepts]: Start accepts. Automaton has 19563 states and 29149 transitions. Word has length 114 [2018-10-24 17:14:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:14:17,380 INFO L481 AbstractCegarLoop]: Abstraction has 19563 states and 29149 transitions. [2018-10-24 17:14:17,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:14:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 19563 states and 29149 transitions. [2018-10-24 17:14:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-24 17:14:17,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:14:17,383 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:14:17,383 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:14:17,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:14:17,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1517850476, now seen corresponding path program 1 times [2018-10-24 17:14:17,383 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:14:17,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:14:17,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:17,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:14:17,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:14:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 17:14:17,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:14:17,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:14:17,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:14:17,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:14:17,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:14:17,509 INFO L87 Difference]: Start difference. First operand 19563 states and 29149 transitions. Second operand 3 states. [2018-10-24 17:14:18,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:14:18,575 INFO L93 Difference]: Finished difference Result 36148 states and 53944 transitions. [2018-10-24 17:14:18,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:14:18,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-24 17:14:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:14:18,602 INFO L225 Difference]: With dead ends: 36148 [2018-10-24 17:14:18,602 INFO L226 Difference]: Without dead ends: 17944 [2018-10-24 17:14:18,614 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:14:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17944 states. [2018-10-24 17:14:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17944 to 17942. [2018-10-24 17:14:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17942 states. [2018-10-24 17:14:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17942 states to 17942 states and 26733 transitions. [2018-10-24 17:14:18,788 INFO L78 Accepts]: Start accepts. Automaton has 17942 states and 26733 transitions. Word has length 136 [2018-10-24 17:14:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:14:18,789 INFO L481 AbstractCegarLoop]: Abstraction has 17942 states and 26733 transitions. [2018-10-24 17:14:18,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:14:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 17942 states and 26733 transitions. [2018-10-24 17:14:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-24 17:14:18,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:14:18,792 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:14:18,792 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:14:18,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:14:18,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1952452209, now seen corresponding path program 1 times [2018-10-24 17:14:18,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:14:18,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:14:18,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:18,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:14:18,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:14:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 17:14:18,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:14:18,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:14:18,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:14:18,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:14:18,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:14:18,917 INFO L87 Difference]: Start difference. First operand 17942 states and 26733 transitions. Second operand 3 states. [2018-10-24 17:14:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:14:20,070 INFO L93 Difference]: Finished difference Result 29250 states and 43528 transitions. [2018-10-24 17:14:20,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:14:20,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-10-24 17:14:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:14:20,084 INFO L225 Difference]: With dead ends: 29250 [2018-10-24 17:14:20,084 INFO L226 Difference]: Without dead ends: 13058 [2018-10-24 17:14:20,095 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:14:20,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13058 states. [2018-10-24 17:14:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13058 to 13056. [2018-10-24 17:14:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13056 states. [2018-10-24 17:14:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13056 states to 13056 states and 19298 transitions. [2018-10-24 17:14:20,214 INFO L78 Accepts]: Start accepts. Automaton has 13056 states and 19298 transitions. Word has length 138 [2018-10-24 17:14:20,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:14:20,215 INFO L481 AbstractCegarLoop]: Abstraction has 13056 states and 19298 transitions. [2018-10-24 17:14:20,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:14:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 13056 states and 19298 transitions. [2018-10-24 17:14:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-24 17:14:20,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:14:20,217 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:14:20,217 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:14:20,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:14:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1040592206, now seen corresponding path program 1 times [2018-10-24 17:14:20,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:14:20,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:14:20,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:20,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:14:20,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:14:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 17:14:20,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:14:20,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:14:20,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:14:20,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:14:20,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:14:20,351 INFO L87 Difference]: Start difference. First operand 13056 states and 19298 transitions. Second operand 3 states. [2018-10-24 17:14:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:14:21,609 INFO L93 Difference]: Finished difference Result 23526 states and 34853 transitions. [2018-10-24 17:14:21,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:14:21,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-10-24 17:14:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:14:21,622 INFO L225 Difference]: With dead ends: 23526 [2018-10-24 17:14:21,622 INFO L226 Difference]: Without dead ends: 12415 [2018-10-24 17:14:21,631 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:14:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12415 states. [2018-10-24 17:14:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12415 to 12413. [2018-10-24 17:14:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12413 states. [2018-10-24 17:14:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12413 states to 12413 states and 18332 transitions. [2018-10-24 17:14:21,739 INFO L78 Accepts]: Start accepts. Automaton has 12413 states and 18332 transitions. Word has length 144 [2018-10-24 17:14:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:14:21,739 INFO L481 AbstractCegarLoop]: Abstraction has 12413 states and 18332 transitions. [2018-10-24 17:14:21,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:14:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 12413 states and 18332 transitions. [2018-10-24 17:14:21,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-24 17:14:21,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:14:21,741 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:14:21,742 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:14:21,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:14:21,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1253431981, now seen corresponding path program 1 times [2018-10-24 17:14:21,742 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:14:21,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:14:21,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:21,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:14:21,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:14:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 17:14:21,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:14:21,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:14:21,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:14:21,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:14:21,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:14:21,877 INFO L87 Difference]: Start difference. First operand 12413 states and 18332 transitions. Second operand 3 states. [2018-10-24 17:14:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:14:23,510 INFO L93 Difference]: Finished difference Result 22913 states and 33911 transitions. [2018-10-24 17:14:23,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:14:23,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-24 17:14:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:14:23,525 INFO L225 Difference]: With dead ends: 22913 [2018-10-24 17:14:23,525 INFO L226 Difference]: Without dead ends: 12445 [2018-10-24 17:14:23,535 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:14:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12445 states. [2018-10-24 17:14:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12445 to 12443. [2018-10-24 17:14:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12443 states. [2018-10-24 17:14:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12443 states to 12443 states and 18362 transitions. [2018-10-24 17:14:23,679 INFO L78 Accepts]: Start accepts. Automaton has 12443 states and 18362 transitions. Word has length 148 [2018-10-24 17:14:23,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:14:23,680 INFO L481 AbstractCegarLoop]: Abstraction has 12443 states and 18362 transitions. [2018-10-24 17:14:23,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:14:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 12443 states and 18362 transitions. [2018-10-24 17:14:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-24 17:14:23,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:14:23,683 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:14:23,683 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:14:23,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:14:23,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1776030124, now seen corresponding path program 1 times [2018-10-24 17:14:23,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:14:23,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:14:23,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:23,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:14:23,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:14:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 17:14:23,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:14:23,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:14:23,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:14:23,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:14:23,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:14:23,848 INFO L87 Difference]: Start difference. First operand 12443 states and 18362 transitions. Second operand 3 states. [2018-10-24 17:14:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:14:24,841 INFO L93 Difference]: Finished difference Result 20615 states and 30499 transitions. [2018-10-24 17:14:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:14:24,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-10-24 17:14:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:14:24,852 INFO L225 Difference]: With dead ends: 20615 [2018-10-24 17:14:24,852 INFO L226 Difference]: Without dead ends: 10117 [2018-10-24 17:14:24,860 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:14:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2018-10-24 17:14:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 10115. [2018-10-24 17:14:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10115 states. [2018-10-24 17:14:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10115 states to 10115 states and 14912 transitions. [2018-10-24 17:14:24,946 INFO L78 Accepts]: Start accepts. Automaton has 10115 states and 14912 transitions. Word has length 178 [2018-10-24 17:14:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:14:24,946 INFO L481 AbstractCegarLoop]: Abstraction has 10115 states and 14912 transitions. [2018-10-24 17:14:24,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:14:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 10115 states and 14912 transitions. [2018-10-24 17:14:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-24 17:14:24,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:14:24,949 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:14:24,949 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:14:24,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:14:24,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1547707242, now seen corresponding path program 1 times [2018-10-24 17:14:24,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:14:24,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:14:24,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:24,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:14:24,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:14:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 17:14:25,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:14:25,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:14:25,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:14:25,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:14:25,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:14:25,078 INFO L87 Difference]: Start difference. First operand 10115 states and 14912 transitions. Second operand 3 states. [2018-10-24 17:14:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:14:25,423 INFO L93 Difference]: Finished difference Result 10521 states and 15481 transitions. [2018-10-24 17:14:25,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:14:25,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-24 17:14:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:14:25,426 INFO L225 Difference]: With dead ends: 10521 [2018-10-24 17:14:25,426 INFO L226 Difference]: Without dead ends: 2357 [2018-10-24 17:14:25,430 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:14:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2018-10-24 17:14:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2355. [2018-10-24 17:14:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2355 states. [2018-10-24 17:14:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3359 transitions. [2018-10-24 17:14:25,454 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3359 transitions. Word has length 183 [2018-10-24 17:14:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:14:25,455 INFO L481 AbstractCegarLoop]: Abstraction has 2355 states and 3359 transitions. [2018-10-24 17:14:25,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:14:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3359 transitions. [2018-10-24 17:14:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-24 17:14:25,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:14:25,458 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:14:25,458 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:14:25,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:14:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash -554518260, now seen corresponding path program 1 times [2018-10-24 17:14:25,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:14:25,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:14:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:25,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:14:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:14:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 17:14:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 17:14:25,771 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-24 17:14:25,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:14:25 BoogieIcfgContainer [2018-10-24 17:14:25,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 17:14:26,000 INFO L168 Benchmark]: Toolchain (without parser) took 152470.49 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -129.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-24 17:14:26,001 INFO L168 Benchmark]: CDTParser took 0.27 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:14:26,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3747.36 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 478.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -439.7 MB). Peak memory consumption was 715.7 MB. Max. memory is 7.1 GB. [2018-10-24 17:14:26,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 1522.35 ms. Allocated memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: 573.6 MB). Free memory was 1.8 GB in the beginning and 2.3 GB in the end (delta: -492.2 MB). Peak memory consumption was 169.5 MB. Max. memory is 7.1 GB. [2018-10-24 17:14:26,005 INFO L168 Benchmark]: Boogie Preprocessor took 985.01 ms. Allocated memory is still 2.6 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 135.8 MB). Peak memory consumption was 135.8 MB. Max. memory is 7.1 GB. [2018-10-24 17:14:26,005 INFO L168 Benchmark]: RCFGBuilder took 24930.36 ms. Allocated memory was 2.6 GB in the beginning and 3.3 GB in the end (delta: 676.9 MB). Free memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: -647.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-24 17:14:26,006 INFO L168 Benchmark]: TraceAbstraction took 121280.07 ms. Allocated memory was 3.3 GB in the beginning and 3.5 GB in the end (delta: 273.2 MB). Free memory was 2.8 GB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-24 17:14:26,011 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.27 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 3747.36 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 478.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -439.7 MB). Peak memory consumption was 715.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 1522.35 ms. Allocated memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: 573.6 MB). Free memory was 1.8 GB in the beginning and 2.3 GB in the end (delta: -492.2 MB). Peak memory consumption was 169.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 985.01 ms. Allocated memory is still 2.6 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 135.8 MB). Peak memory consumption was 135.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 24930.36 ms. Allocated memory was 2.6 GB in the beginning and 3.3 GB in the end (delta: 676.9 MB). Free memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: -647.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * TraceAbstraction took 121280.07 ms. Allocated memory was 3.3 GB in the beginning and 3.5 GB in the end (delta: 273.2 MB). Free memory was 2.8 GB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 49138]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_getInetAddress = 1; [L6] int m_getOOBInline = 2; [L7] int m_getLocalPort = 3; [L8] int m_isInputShutdown = 4; [L9] int m_setTcpNoDelay = 5; [L10] int m_isConnected = 6; [L11] int m_getKeepAlive = 7; [L12] int m_getLocalAddress = 8; [L13] int m_bind = 9; [L14] int m_getChannel = 10; [L15] int m_getSoLinger = 11; [L16] int m_getImpl = 12; [L17] int m_getTcpNoDelay = 13; [L18] int m_getSoTimeout = 14; [L19] int m_isOutputShutdown = 15; [L20] int m_postAccept = 16; [L21] int m_close = 17; [L22] int m_setOOBInline = 18; [L23] int m_getLocalSocketAddress = 19; [L24] int m_getReceiveBufferSize = 20; [L25] int m_setReuseAddress = 21; [L26] int m_getTrafficClass = 22; [L27] int m_getReuseAddress = 23; [L28] int m_createImpl = 24; [L29] int m_setCreated = 25; [L30] int m_setKeepAlive = 26; [L31] int m_getInputStream = 27; [L32] int m_shutdownOutput = 28; [L33] int m_shutdownInput = 29; [L34] int m_setPerformancePreferences = 30; [L35] int m_getPort = 31; [L36] int m_sendUrgentData = 32; [L37] int m_isClosed = 33; [L38] int m_isBound = 34; [L39] int m_setBound = 35; [L40] int m_getSendBufferSize = 36; [L41] int m_getOutputStream = 37; [L42] int m_setConnected = 38; [L43] int m_Socket = 39; [L44] int m_getRemoteSocketAddress = 40; [L45] int m_setReceiveBufferSize_1 = 41; [L46] int m_setReceiveBufferSize_2 = 42; [L47] int m_connect2_1 = 43; [L48] int m_connect2_2 = 44; [L49] int m_setSoLinger_1 = 45; [L50] int m_setSoLinger_2 = 46; [L51] int m_connect1_1 = 47; [L52] int m_connect1_2 = 48; [L53] int m_setTrafficClass_1 = 49; [L54] int m_setTrafficClass_2 = 50; [L55] int m_setSoTimeout_1 = 51; [L56] int m_setSoTimeout_2 = 52; [L57] int m_setSendBufferSize_1 = 53; [L58] int m_setSendBufferSize_2 = 54; [L59] int m_setSocketImplFactory_1 = 55; [L60] int m_setSocketImplFactory_2 = 56; VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L65] int q = 0; [L66] int method_id; [L69] int this_oldImpl = 0; [L70] int this_factory = 0; [L71] int this_shutOut = 0; [L72] int this_created = 0; [L73] int this_shutIn = 0; [L74] int this_closed = 0; [L75] int this_bound = 0; [L76] int this_impl = 1; [L77] int this_connected = 0; VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND TRUE q == 0 [L117] COND TRUE __VERIFIER_nondet_int() [L119] COND TRUE 1 [L121] method_id = 39 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L123] COND FALSE !(0) [L127] q = 2 [L129] this_factory=0 [L129] this_shutIn=0 [L129] this_connected=0 [L129] this_closed=0 [L129] this_shutOut=0 [L129] this_created=0 [L129] this_impl=1 [L129] this_bound=0 [L129] this_oldImpl=0 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND FALSE !(__VERIFIER_nondet_int()) [L2077] COND TRUE __VERIFIER_nondet_int() [L2079] COND TRUE !(P1 != 0) [L2081] method_id = 56 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L2083] COND FALSE !(((this_factory != 0) && !(P30 != 0))) [L2087] q = 2 [L2089] this_factory=P30 [L2089] this_shutIn=this_shutIn [L2089] this_connected=this_connected [L2089] this_closed=this_closed [L2089] this_shutOut=this_shutOut [L2089] this_created=this_created [L2089] this_impl=this_impl [L2089] this_bound=this_bound [L2089] this_oldImpl=this_oldImpl VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND TRUE __VERIFIER_nondet_int() [L2063] COND TRUE (P1 != 0) [L2065] method_id = 55 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L2067] COND TRUE ((this_factory != 0) && (P29 != 0)) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L49138] __VERIFIER_error() VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9211 locations, 1 error locations. UNSAFE Result, 121.1s OverallTime, 28 OverallIterations, 4 TraceHistogramMax, 103.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 310220 SDtfs, 209653 SDslu, 202611 SDs, 0 SdLazy, 56858 SolverSat, 21884 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 76.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66198occurred in iteration=10, 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: 12.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 16312 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2206 NumberOfCodeBlocks, 2206 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1991 ConstructedInterpolants, 0 QuantifiedInterpolants, 502323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 214/214 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...