java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:04:39,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:04:39,113 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:04:39,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:04:39,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:04:39,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:04:39,132 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:04:39,134 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:04:39,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:04:39,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:04:39,139 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:04:39,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:04:39,141 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:04:39,142 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:04:39,143 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:04:39,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:04:39,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:04:39,150 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:04:39,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:04:39,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:04:39,165 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:04:39,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:04:39,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:04:39,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:04:39,172 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:04:39,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:04:39,174 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:04:39,175 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:04:39,175 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:04:39,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:04:39,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:04:39,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:04:39,181 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:04:39,181 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:04:39,182 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:04:39,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:04:39,183 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 16:04:39,200 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:04:39,201 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:04:39,201 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:04:39,202 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:04:39,202 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:04:39,202 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:04:39,203 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:04:39,204 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:04:39,204 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:04:39,204 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:04:39,204 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:04:39,204 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:04:39,205 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:04:39,205 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:04:39,205 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:04:39,205 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:04:39,205 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:04:39,205 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:04:39,206 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:04:39,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:04:39,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:04:39,207 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:04:39,207 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:04:39,208 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:04:39,208 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:04:39,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:04:39,208 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:04:39,208 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:04:39,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:04:39,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:04:39,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:04:39,274 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:04:39,275 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:04:39,275 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label25_true-unreach-call.c [2018-10-24 16:04:39,343 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/db58cb1bd/37dfbe2d301d455088314a99a0296fc0/FLAGc687f7d41 [2018-10-24 16:04:39,938 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:04:39,942 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label25_true-unreach-call.c [2018-10-24 16:04:39,958 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/db58cb1bd/37dfbe2d301d455088314a99a0296fc0/FLAGc687f7d41 [2018-10-24 16:04:39,977 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/db58cb1bd/37dfbe2d301d455088314a99a0296fc0 [2018-10-24 16:04:39,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:04:39,989 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:04:39,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:04:39,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:04:39,994 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:04:39,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:04:39" (1/1) ... [2018-10-24 16:04:39,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206c1d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:39, skipping insertion in model container [2018-10-24 16:04:39,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:04:39" (1/1) ... [2018-10-24 16:04:40,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:04:40,080 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:04:40,592 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:04:40,596 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:04:40,847 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:04:40,869 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:04:40,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40 WrapperNode [2018-10-24 16:04:40,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:04:40,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:04:40,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:04:40,872 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:04:40,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40" (1/1) ... [2018-10-24 16:04:40,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40" (1/1) ... [2018-10-24 16:04:41,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:04:41,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:04:41,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:04:41,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:04:41,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40" (1/1) ... [2018-10-24 16:04:41,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40" (1/1) ... [2018-10-24 16:04:41,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40" (1/1) ... [2018-10-24 16:04:41,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40" (1/1) ... [2018-10-24 16:04:41,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40" (1/1) ... [2018-10-24 16:04:41,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40" (1/1) ... [2018-10-24 16:04:41,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40" (1/1) ... [2018-10-24 16:04:41,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:04:41,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:04:41,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:04:41,295 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:04:41,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40" (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 16:04:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:04:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:04:41,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:04:46,031 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:04:46,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:04:46 BoogieIcfgContainer [2018-10-24 16:04:46,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:04:46,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:04:46,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:04:46,040 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:04:46,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:04:39" (1/3) ... [2018-10-24 16:04:46,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722a4d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:04:46, skipping insertion in model container [2018-10-24 16:04:46,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:04:40" (2/3) ... [2018-10-24 16:04:46,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722a4d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:04:46, skipping insertion in model container [2018-10-24 16:04:46,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:04:46" (3/3) ... [2018-10-24 16:04:46,044 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label25_true-unreach-call.c [2018-10-24 16:04:46,054 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:04:46,063 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:04:46,080 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:04:46,113 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:04:46,114 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:04:46,114 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:04:46,114 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:04:46,114 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:04:46,114 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:04:46,114 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:04:46,114 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:04:46,115 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:04:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-10-24 16:04:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-24 16:04:46,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:04:46,149 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:04:46,152 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:04:46,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:04:46,158 INFO L82 PathProgramCache]: Analyzing trace with hash 18549650, now seen corresponding path program 1 times [2018-10-24 16:04:46,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:04:46,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:04:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:04:46,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:04:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:04:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:04:46,588 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 16:04:46,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:04:46,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:04:46,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:04:46,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:04:46,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:04:46,612 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-10-24 16:04:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:04:49,799 INFO L93 Difference]: Finished difference Result 958 states and 1725 transitions. [2018-10-24 16:04:49,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:04:49,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-10-24 16:04:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:04:49,826 INFO L225 Difference]: With dead ends: 958 [2018-10-24 16:04:49,826 INFO L226 Difference]: Without dead ends: 667 [2018-10-24 16:04:49,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:04:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-24 16:04:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2018-10-24 16:04:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-10-24 16:04:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 983 transitions. [2018-10-24 16:04:49,935 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 983 transitions. Word has length 32 [2018-10-24 16:04:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:04:49,935 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 983 transitions. [2018-10-24 16:04:49,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:04:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 983 transitions. [2018-10-24 16:04:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-24 16:04:49,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:04:49,941 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:49,941 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:04:49,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:04:49,941 INFO L82 PathProgramCache]: Analyzing trace with hash -63351988, now seen corresponding path program 1 times [2018-10-24 16:04:49,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:04:49,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:04:49,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:04:49,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:04:49,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:04:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:04:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:04:50,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:04:50,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:04:50,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:04:50,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:04:50,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:04:50,406 INFO L87 Difference]: Start difference. First operand 667 states and 983 transitions. Second operand 4 states. [2018-10-24 16:04:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:04:54,699 INFO L93 Difference]: Finished difference Result 2464 states and 3711 transitions. [2018-10-24 16:04:54,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:04:54,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-24 16:04:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:04:54,712 INFO L225 Difference]: With dead ends: 2464 [2018-10-24 16:04:54,713 INFO L226 Difference]: Without dead ends: 1799 [2018-10-24 16:04:54,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 16:04:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-10-24 16:04:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1596. [2018-10-24 16:04:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2018-10-24 16:04:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2267 transitions. [2018-10-24 16:04:54,790 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2267 transitions. Word has length 102 [2018-10-24 16:04:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:04:54,791 INFO L481 AbstractCegarLoop]: Abstraction has 1596 states and 2267 transitions. [2018-10-24 16:04:54,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:04:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2267 transitions. [2018-10-24 16:04:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-24 16:04:54,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:04:54,803 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:54,804 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:04:54,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:04:54,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1347254132, now seen corresponding path program 1 times [2018-10-24 16:04:54,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:04:54,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:04:54,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:04:54,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:04:54,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:04:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:04:55,264 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 16:04:55,616 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2018-10-24 16:04:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:04:55,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:04:55,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 16:04:55,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:04:55,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:04:55,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:04:55,954 INFO L87 Difference]: Start difference. First operand 1596 states and 2267 transitions. Second operand 7 states. [2018-10-24 16:05:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:00,643 INFO L93 Difference]: Finished difference Result 5055 states and 7097 transitions. [2018-10-24 16:05:00,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:05:00,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2018-10-24 16:05:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:00,662 INFO L225 Difference]: With dead ends: 5055 [2018-10-24 16:05:00,663 INFO L226 Difference]: Without dead ends: 3461 [2018-10-24 16:05:00,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:05:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2018-10-24 16:05:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3454. [2018-10-24 16:05:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3454 states. [2018-10-24 16:05:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4561 transitions. [2018-10-24 16:05:00,745 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4561 transitions. Word has length 123 [2018-10-24 16:05:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:00,746 INFO L481 AbstractCegarLoop]: Abstraction has 3454 states and 4561 transitions. [2018-10-24 16:05:00,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:05:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4561 transitions. [2018-10-24 16:05:00,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-24 16:05:00,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:00,751 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:00,751 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:00,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:00,752 INFO L82 PathProgramCache]: Analyzing trace with hash -127123909, now seen corresponding path program 1 times [2018-10-24 16:05:00,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:00,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:00,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:00,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:00,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:01,054 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 16:05:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-24 16:05:01,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:01,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:05:01,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:01,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:01,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:01,107 INFO L87 Difference]: Start difference. First operand 3454 states and 4561 transitions. Second operand 4 states. [2018-10-24 16:05:03,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:03,620 INFO L93 Difference]: Finished difference Result 8777 states and 11599 transitions. [2018-10-24 16:05:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:05:03,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2018-10-24 16:05:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:03,646 INFO L225 Difference]: With dead ends: 8777 [2018-10-24 16:05:03,647 INFO L226 Difference]: Without dead ends: 5325 [2018-10-24 16:05:03,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 16:05:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2018-10-24 16:05:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 5119. [2018-10-24 16:05:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5119 states. [2018-10-24 16:05:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 6439 transitions. [2018-10-24 16:05:03,750 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 6439 transitions. Word has length 192 [2018-10-24 16:05:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:03,751 INFO L481 AbstractCegarLoop]: Abstraction has 5119 states and 6439 transitions. [2018-10-24 16:05:03,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:05:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 6439 transitions. [2018-10-24 16:05:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-24 16:05:03,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:03,758 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:03,758 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:03,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1806737612, now seen corresponding path program 1 times [2018-10-24 16:05:03,759 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:03,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:03,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:03,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:03,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-24 16:05:03,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:03,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:05:03,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:05:03,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:05:03,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:05:03,995 INFO L87 Difference]: Start difference. First operand 5119 states and 6439 transitions. Second operand 3 states. [2018-10-24 16:05:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:06,049 INFO L93 Difference]: Finished difference Result 11530 states and 14899 transitions. [2018-10-24 16:05:06,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:05:06,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2018-10-24 16:05:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:06,077 INFO L225 Difference]: With dead ends: 11530 [2018-10-24 16:05:06,077 INFO L226 Difference]: Without dead ends: 6413 [2018-10-24 16:05:06,084 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 16:05:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6413 states. [2018-10-24 16:05:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6413 to 6413. [2018-10-24 16:05:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2018-10-24 16:05:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 8049 transitions. [2018-10-24 16:05:06,184 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 8049 transitions. Word has length 248 [2018-10-24 16:05:06,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:06,185 INFO L481 AbstractCegarLoop]: Abstraction has 6413 states and 8049 transitions. [2018-10-24 16:05:06,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:05:06,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 8049 transitions. [2018-10-24 16:05:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-24 16:05:06,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:06,194 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:06,194 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:06,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:06,195 INFO L82 PathProgramCache]: Analyzing trace with hash 639833405, now seen corresponding path program 1 times [2018-10-24 16:05:06,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:06,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:06,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:06,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:06,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:06,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:06,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:05:06,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:06,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:06,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:06,625 INFO L87 Difference]: Start difference. First operand 6413 states and 8049 transitions. Second operand 4 states. [2018-10-24 16:05:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:09,347 INFO L93 Difference]: Finished difference Result 14864 states and 18977 transitions. [2018-10-24 16:05:09,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:05:09,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-10-24 16:05:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:09,375 INFO L225 Difference]: With dead ends: 14864 [2018-10-24 16:05:09,376 INFO L226 Difference]: Without dead ends: 7510 [2018-10-24 16:05:09,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7510 states. [2018-10-24 16:05:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7510 to 7317. [2018-10-24 16:05:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7317 states. [2018-10-24 16:05:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7317 states to 7317 states and 8856 transitions. [2018-10-24 16:05:09,489 INFO L78 Accepts]: Start accepts. Automaton has 7317 states and 8856 transitions. Word has length 267 [2018-10-24 16:05:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:09,490 INFO L481 AbstractCegarLoop]: Abstraction has 7317 states and 8856 transitions. [2018-10-24 16:05:09,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:05:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 7317 states and 8856 transitions. [2018-10-24 16:05:09,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-24 16:05:09,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:09,497 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:09,497 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:09,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:09,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1651260540, now seen corresponding path program 1 times [2018-10-24 16:05:09,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:09,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:09,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:09,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:09,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-24 16:05:09,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:09,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:05:09,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:05:09,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:05:09,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:05:09,898 INFO L87 Difference]: Start difference. First operand 7317 states and 8856 transitions. Second operand 5 states. [2018-10-24 16:05:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:12,753 INFO L93 Difference]: Finished difference Result 21508 states and 25910 transitions. [2018-10-24 16:05:12,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:05:12,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2018-10-24 16:05:12,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:12,795 INFO L225 Difference]: With dead ends: 21508 [2018-10-24 16:05:12,796 INFO L226 Difference]: Without dead ends: 13636 [2018-10-24 16:05:12,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:05:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13636 states. [2018-10-24 16:05:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13636 to 12512. [2018-10-24 16:05:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12512 states. [2018-10-24 16:05:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12512 states to 12512 states and 14880 transitions. [2018-10-24 16:05:12,973 INFO L78 Accepts]: Start accepts. Automaton has 12512 states and 14880 transitions. Word has length 273 [2018-10-24 16:05:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:12,973 INFO L481 AbstractCegarLoop]: Abstraction has 12512 states and 14880 transitions. [2018-10-24 16:05:12,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:05:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 12512 states and 14880 transitions. [2018-10-24 16:05:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-24 16:05:12,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:12,985 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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 16:05:12,985 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:12,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2075523106, now seen corresponding path program 1 times [2018-10-24 16:05:12,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:12,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:12,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:12,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:12,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-24 16:05:13,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:13,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:05:13,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:05:13,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:05:13,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:05:13,235 INFO L87 Difference]: Start difference. First operand 12512 states and 14880 transitions. Second operand 3 states. [2018-10-24 16:05:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:16,206 INFO L93 Difference]: Finished difference Result 27428 states and 32691 transitions. [2018-10-24 16:05:16,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:05:16,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-10-24 16:05:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:16,232 INFO L225 Difference]: With dead ends: 27428 [2018-10-24 16:05:16,232 INFO L226 Difference]: Without dead ends: 13432 [2018-10-24 16:05:16,243 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 16:05:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13432 states. [2018-10-24 16:05:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13432 to 12875. [2018-10-24 16:05:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12875 states. [2018-10-24 16:05:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12875 states to 12875 states and 15067 transitions. [2018-10-24 16:05:16,391 INFO L78 Accepts]: Start accepts. Automaton has 12875 states and 15067 transitions. Word has length 317 [2018-10-24 16:05:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:16,392 INFO L481 AbstractCegarLoop]: Abstraction has 12875 states and 15067 transitions. [2018-10-24 16:05:16,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:05:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 12875 states and 15067 transitions. [2018-10-24 16:05:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-24 16:05:16,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:16,405 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:05:16,406 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:16,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:16,406 INFO L82 PathProgramCache]: Analyzing trace with hash 386797, now seen corresponding path program 1 times [2018-10-24 16:05:16,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:16,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:16,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:16,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:16,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:16,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:05:16,854 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:05:16,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:16,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:05:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 59 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:05:17,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:05:17,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-24 16:05:17,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:05:17,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:05:17,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:05:17,740 INFO L87 Difference]: Start difference. First operand 12875 states and 15067 transitions. Second operand 9 states. [2018-10-24 16:05:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:25,176 INFO L93 Difference]: Finished difference Result 32827 states and 38477 transitions. [2018-10-24 16:05:25,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 16:05:25,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 332 [2018-10-24 16:05:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:25,209 INFO L225 Difference]: With dead ends: 32827 [2018-10-24 16:05:25,209 INFO L226 Difference]: Without dead ends: 21625 [2018-10-24 16:05:25,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:05:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21625 states. [2018-10-24 16:05:25,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21625 to 16613. [2018-10-24 16:05:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16613 states. [2018-10-24 16:05:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16613 states to 16613 states and 19362 transitions. [2018-10-24 16:05:25,514 INFO L78 Accepts]: Start accepts. Automaton has 16613 states and 19362 transitions. Word has length 332 [2018-10-24 16:05:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:25,514 INFO L481 AbstractCegarLoop]: Abstraction has 16613 states and 19362 transitions. [2018-10-24 16:05:25,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:05:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 16613 states and 19362 transitions. [2018-10-24 16:05:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-24 16:05:25,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:25,529 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 16:05:25,530 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:25,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1592391023, now seen corresponding path program 1 times [2018-10-24 16:05:25,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:25,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:25,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:25,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:25,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:26,236 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-24 16:05:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-24 16:05:26,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:26,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:05:26,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:26,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:26,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:26,329 INFO L87 Difference]: Start difference. First operand 16613 states and 19362 transitions. Second operand 4 states. [2018-10-24 16:05:28,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:28,781 INFO L93 Difference]: Finished difference Result 36402 states and 42403 transitions. [2018-10-24 16:05:28,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:05:28,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 356 [2018-10-24 16:05:28,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:28,806 INFO L225 Difference]: With dead ends: 36402 [2018-10-24 16:05:28,806 INFO L226 Difference]: Without dead ends: 19418 [2018-10-24 16:05:28,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19418 states. [2018-10-24 16:05:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19418 to 19015. [2018-10-24 16:05:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19015 states. [2018-10-24 16:05:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19015 states to 19015 states and 21917 transitions. [2018-10-24 16:05:29,040 INFO L78 Accepts]: Start accepts. Automaton has 19015 states and 21917 transitions. Word has length 356 [2018-10-24 16:05:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:29,041 INFO L481 AbstractCegarLoop]: Abstraction has 19015 states and 21917 transitions. [2018-10-24 16:05:29,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:05:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 19015 states and 21917 transitions. [2018-10-24 16:05:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-24 16:05:29,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:29,062 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:05:29,062 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:29,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:29,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1469956884, now seen corresponding path program 1 times [2018-10-24 16:05:29,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:29,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:29,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:29,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:29,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-24 16:05:29,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:29,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:05:29,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:29,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:29,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:29,416 INFO L87 Difference]: Start difference. First operand 19015 states and 21917 transitions. Second operand 4 states. [2018-10-24 16:05:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:31,626 INFO L93 Difference]: Finished difference Result 38799 states and 44737 transitions. [2018-10-24 16:05:31,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:05:31,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 402 [2018-10-24 16:05:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:31,657 INFO L225 Difference]: With dead ends: 38799 [2018-10-24 16:05:31,657 INFO L226 Difference]: Without dead ends: 19971 [2018-10-24 16:05:31,672 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 16:05:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19971 states. [2018-10-24 16:05:31,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19971 to 19014. [2018-10-24 16:05:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19014 states. [2018-10-24 16:05:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19014 states to 19014 states and 21463 transitions. [2018-10-24 16:05:31,902 INFO L78 Accepts]: Start accepts. Automaton has 19014 states and 21463 transitions. Word has length 402 [2018-10-24 16:05:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:31,903 INFO L481 AbstractCegarLoop]: Abstraction has 19014 states and 21463 transitions. [2018-10-24 16:05:31,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:05:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand 19014 states and 21463 transitions. [2018-10-24 16:05:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-24 16:05:31,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:31,923 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:31,923 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:31,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:31,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1573777934, now seen corresponding path program 1 times [2018-10-24 16:05:31,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:31,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:31,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-24 16:05:32,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:32,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:05:32,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:05:32,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:05:32,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:05:32,615 INFO L87 Difference]: Start difference. First operand 19014 states and 21463 transitions. Second operand 5 states. [2018-10-24 16:05:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:37,462 INFO L93 Difference]: Finished difference Result 50422 states and 56888 transitions. [2018-10-24 16:05:37,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:05:37,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 433 [2018-10-24 16:05:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:37,491 INFO L225 Difference]: With dead ends: 50422 [2018-10-24 16:05:37,491 INFO L226 Difference]: Without dead ends: 31595 [2018-10-24 16:05:37,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:05:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31595 states. [2018-10-24 16:05:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31595 to 29554. [2018-10-24 16:05:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29554 states. [2018-10-24 16:05:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29554 states to 29554 states and 32397 transitions. [2018-10-24 16:05:37,853 INFO L78 Accepts]: Start accepts. Automaton has 29554 states and 32397 transitions. Word has length 433 [2018-10-24 16:05:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:37,854 INFO L481 AbstractCegarLoop]: Abstraction has 29554 states and 32397 transitions. [2018-10-24 16:05:37,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:05:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 29554 states and 32397 transitions. [2018-10-24 16:05:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2018-10-24 16:05:37,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:37,892 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:37,893 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:37,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash -187224792, now seen corresponding path program 1 times [2018-10-24 16:05:37,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:37,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:37,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:37,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:37,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 89 proven. 319 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-10-24 16:05:39,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:05:39,741 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:05:39,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:39,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:05:40,915 WARN L179 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-10-24 16:05:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 89 proven. 319 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-10-24 16:05:42,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:05:42,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-10-24 16:05:42,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 16:05:42,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 16:05:42,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:05:42,394 INFO L87 Difference]: Start difference. First operand 29554 states and 32397 transitions. Second operand 12 states. [2018-10-24 16:05:43,580 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2018-10-24 16:05:46,322 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-10-24 16:05:48,946 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2018-10-24 16:05:51,447 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2018-10-24 16:05:55,656 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2018-10-24 16:05:56,834 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-10-24 16:05:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:58,212 INFO L93 Difference]: Finished difference Result 69793 states and 76225 transitions. [2018-10-24 16:05:58,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-24 16:05:58,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 524 [2018-10-24 16:05:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:58,261 INFO L225 Difference]: With dead ends: 69793 [2018-10-24 16:05:58,262 INFO L226 Difference]: Without dead ends: 40425 [2018-10-24 16:05:58,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 511 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2018-10-24 16:05:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40425 states. [2018-10-24 16:05:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40425 to 29170. [2018-10-24 16:05:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29170 states. [2018-10-24 16:05:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29170 states to 29170 states and 31854 transitions. [2018-10-24 16:05:58,869 INFO L78 Accepts]: Start accepts. Automaton has 29170 states and 31854 transitions. Word has length 524 [2018-10-24 16:05:58,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:58,870 INFO L481 AbstractCegarLoop]: Abstraction has 29170 states and 31854 transitions. [2018-10-24 16:05:58,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 16:05:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 29170 states and 31854 transitions. [2018-10-24 16:05:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-10-24 16:05:58,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:58,891 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:58,891 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:58,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1457264010, now seen corresponding path program 1 times [2018-10-24 16:05:58,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:58,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:58,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:58,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:58,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:59,384 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-24 16:05:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-24 16:05:59,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:05:59,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:05:59,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:05:59,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:05:59,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:05:59,514 INFO L87 Difference]: Start difference. First operand 29170 states and 31854 transitions. Second operand 4 states. [2018-10-24 16:06:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:01,238 INFO L93 Difference]: Finished difference Result 58909 states and 64312 transitions. [2018-10-24 16:06:01,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:06:01,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 572 [2018-10-24 16:06:01,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:01,269 INFO L225 Difference]: With dead ends: 58909 [2018-10-24 16:06:01,269 INFO L226 Difference]: Without dead ends: 29926 [2018-10-24 16:06:01,289 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 16:06:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29926 states. [2018-10-24 16:06:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29926 to 28984. [2018-10-24 16:06:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28984 states. [2018-10-24 16:06:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28984 states to 28984 states and 31180 transitions. [2018-10-24 16:06:01,575 INFO L78 Accepts]: Start accepts. Automaton has 28984 states and 31180 transitions. Word has length 572 [2018-10-24 16:06:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:01,575 INFO L481 AbstractCegarLoop]: Abstraction has 28984 states and 31180 transitions. [2018-10-24 16:06:01,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:06:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 28984 states and 31180 transitions. [2018-10-24 16:06:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2018-10-24 16:06:01,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:01,588 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:06:01,589 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:01,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:01,589 INFO L82 PathProgramCache]: Analyzing trace with hash 396085645, now seen corresponding path program 1 times [2018-10-24 16:06:01,589 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:01,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:01,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:01,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:01,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:02,228 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-10-24 16:06:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1049 backedges. 736 proven. 60 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-24 16:06:02,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:06:02,726 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:06:02,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:02,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:06:03,380 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2018-10-24 16:06:04,442 WARN L179 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 24 [2018-10-24 16:06:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1049 backedges. 736 proven. 60 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-24 16:06:05,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:06:05,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-10-24 16:06:05,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:06:05,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:06:05,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:06:05,033 INFO L87 Difference]: Start difference. First operand 28984 states and 31180 transitions. Second operand 9 states. [2018-10-24 16:06:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:10,735 INFO L93 Difference]: Finished difference Result 57610 states and 61985 transitions. [2018-10-24 16:06:10,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 16:06:10,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 574 [2018-10-24 16:06:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:10,763 INFO L225 Difference]: With dead ends: 57610 [2018-10-24 16:06:10,763 INFO L226 Difference]: Without dead ends: 30852 [2018-10-24 16:06:10,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-10-24 16:06:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30852 states. [2018-10-24 16:06:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30852 to 28798. [2018-10-24 16:06:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2018-10-24 16:06:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 30957 transitions. [2018-10-24 16:06:11,103 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 30957 transitions. Word has length 574 [2018-10-24 16:06:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:11,104 INFO L481 AbstractCegarLoop]: Abstraction has 28798 states and 30957 transitions. [2018-10-24 16:06:11,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:06:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 30957 transitions. [2018-10-24 16:06:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-24 16:06:11,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:11,132 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:11,133 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:11,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:11,133 INFO L82 PathProgramCache]: Analyzing trace with hash 649228648, now seen corresponding path program 1 times [2018-10-24 16:06:11,133 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:11,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:11,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:11,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:11,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-10-24 16:06:11,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:06:11,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-24 16:06:11,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:06:11,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:06:11,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:06:11,963 INFO L87 Difference]: Start difference. First operand 28798 states and 30957 transitions. Second operand 7 states. [2018-10-24 16:06:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:16,323 INFO L93 Difference]: Finished difference Result 64999 states and 69821 transitions. [2018-10-24 16:06:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 16:06:16,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 639 [2018-10-24 16:06:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:16,356 INFO L225 Difference]: With dead ends: 64999 [2018-10-24 16:06:16,357 INFO L226 Difference]: Without dead ends: 38427 [2018-10-24 16:06:16,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:06:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38427 states. [2018-10-24 16:06:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38427 to 25458. [2018-10-24 16:06:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25458 states. [2018-10-24 16:06:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25458 states to 25458 states and 27345 transitions. [2018-10-24 16:06:16,628 INFO L78 Accepts]: Start accepts. Automaton has 25458 states and 27345 transitions. Word has length 639 [2018-10-24 16:06:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:16,629 INFO L481 AbstractCegarLoop]: Abstraction has 25458 states and 27345 transitions. [2018-10-24 16:06:16,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:06:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 25458 states and 27345 transitions. [2018-10-24 16:06:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-10-24 16:06:16,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:16,645 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:16,645 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:16,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1912840326, now seen corresponding path program 1 times [2018-10-24 16:06:16,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:16,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:16,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:16,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:16,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 590 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-10-24 16:06:17,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:06:17,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 16:06:17,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:06:17,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:06:17,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:06:17,251 INFO L87 Difference]: Start difference. First operand 25458 states and 27345 transitions. Second operand 6 states. [2018-10-24 16:06:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:21,270 INFO L93 Difference]: Finished difference Result 58328 states and 62606 transitions. [2018-10-24 16:06:21,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 16:06:21,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 646 [2018-10-24 16:06:21,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:21,301 INFO L225 Difference]: With dead ends: 58328 [2018-10-24 16:06:21,301 INFO L226 Difference]: Without dead ends: 33616 [2018-10-24 16:06:21,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:06:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33616 states. [2018-10-24 16:06:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33616 to 26574. [2018-10-24 16:06:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26574 states. [2018-10-24 16:06:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26574 states to 26574 states and 28542 transitions. [2018-10-24 16:06:21,590 INFO L78 Accepts]: Start accepts. Automaton has 26574 states and 28542 transitions. Word has length 646 [2018-10-24 16:06:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:21,590 INFO L481 AbstractCegarLoop]: Abstraction has 26574 states and 28542 transitions. [2018-10-24 16:06:21,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:06:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 26574 states and 28542 transitions. [2018-10-24 16:06:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-10-24 16:06:21,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:21,610 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:06:21,611 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:21,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:21,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1945478519, now seen corresponding path program 1 times [2018-10-24 16:06:21,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:21,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:21,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:22,995 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-24 16:06:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 30 proven. 976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:06:23,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:06:23,923 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:06:23,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:24,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:06:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 155 proven. 851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:06:25,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:06:25,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-10-24 16:06:25,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 16:06:25,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 16:06:25,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:06:25,909 INFO L87 Difference]: Start difference. First operand 26574 states and 28542 transitions. Second operand 12 states. [2018-10-24 16:06:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:06:34,624 INFO L93 Difference]: Finished difference Result 76324 states and 81870 transitions. [2018-10-24 16:06:34,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 16:06:34,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 677 [2018-10-24 16:06:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:06:34,670 INFO L225 Difference]: With dead ends: 76324 [2018-10-24 16:06:34,671 INFO L226 Difference]: Without dead ends: 49941 [2018-10-24 16:06:34,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 671 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-24 16:06:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49941 states. [2018-10-24 16:06:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49941 to 36230. [2018-10-24 16:06:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36230 states. [2018-10-24 16:06:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36230 states to 36230 states and 38876 transitions. [2018-10-24 16:06:35,110 INFO L78 Accepts]: Start accepts. Automaton has 36230 states and 38876 transitions. Word has length 677 [2018-10-24 16:06:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:06:35,110 INFO L481 AbstractCegarLoop]: Abstraction has 36230 states and 38876 transitions. [2018-10-24 16:06:35,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 16:06:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 36230 states and 38876 transitions. [2018-10-24 16:06:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2018-10-24 16:06:35,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:06:35,127 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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 16:06:35,128 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:06:35,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:06:35,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1769512697, now seen corresponding path program 1 times [2018-10-24 16:06:35,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:06:35,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:06:35,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:35,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:35,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:06:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:06:37,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:06:37,174 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:06:37,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:06:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:06:37,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:06:53,837 WARN L179 SmtUtils]: Spent 16.16 s on a formula simplification. DAG size of input: 199 DAG size of output: 38 [2018-10-24 16:06:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 680 proven. 200 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-24 16:06:56,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:06:56,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-24 16:06:56,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 16:06:56,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 16:06:56,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:06:56,268 INFO L87 Difference]: Start difference. First operand 36230 states and 38876 transitions. Second operand 12 states. [2018-10-24 16:07:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:07:14,490 INFO L93 Difference]: Finished difference Result 105268 states and 112778 transitions. [2018-10-24 16:07:14,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 16:07:14,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 685 [2018-10-24 16:07:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:07:14,550 INFO L225 Difference]: With dead ends: 105268 [2018-10-24 16:07:14,550 INFO L226 Difference]: Without dead ends: 68489 [2018-10-24 16:07:14,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 683 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-10-24 16:07:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68489 states. [2018-10-24 16:07:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68489 to 37897. [2018-10-24 16:07:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37897 states. [2018-10-24 16:07:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37897 states to 37897 states and 40589 transitions. [2018-10-24 16:07:15,059 INFO L78 Accepts]: Start accepts. Automaton has 37897 states and 40589 transitions. Word has length 685 [2018-10-24 16:07:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:07:15,060 INFO L481 AbstractCegarLoop]: Abstraction has 37897 states and 40589 transitions. [2018-10-24 16:07:15,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 16:07:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 37897 states and 40589 transitions. [2018-10-24 16:07:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2018-10-24 16:07:15,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:07:15,088 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:07:15,089 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:07:15,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:07:15,089 INFO L82 PathProgramCache]: Analyzing trace with hash -260430783, now seen corresponding path program 1 times [2018-10-24 16:07:15,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:07:15,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:07:15,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:07:15,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:07:15,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:07:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:07:16,290 WARN L179 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-10-24 16:07:16,705 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-24 16:07:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2308 backedges. 1440 proven. 687 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-24 16:07:17,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:07:17,992 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:07:18,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:07:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:07:18,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:07:19,901 WARN L179 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 43 DAG size of output: 16 [2018-10-24 16:07:26,720 WARN L179 SmtUtils]: Spent 6.38 s on a formula simplification. DAG size of input: 209 DAG size of output: 67 [2018-10-24 16:07:29,180 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2018-10-24 16:07:29,406 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 48 [2018-10-24 16:07:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2308 backedges. 245 proven. 1752 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-10-24 16:07:34,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:07:34,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-24 16:07:34,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 16:07:34,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 16:07:34,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-10-24 16:07:34,617 INFO L87 Difference]: Start difference. First operand 37897 states and 40589 transitions. Second operand 13 states. [2018-10-24 16:07:36,999 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 Received shutdown request... [2018-10-24 16:08:44,257 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 73 [2018-10-24 16:08:44,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:08:44,273 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 16:08:44,278 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 16:08:44,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:08:44 BoogieIcfgContainer [2018-10-24 16:08:44,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:08:44,280 INFO L168 Benchmark]: Toolchain (without parser) took 244291.46 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -175.3 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-24 16:08:44,281 INFO L168 Benchmark]: CDTParser took 0.22 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 16:08:44,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-10-24 16:08:44,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 264.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -847.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-10-24 16:08:44,283 INFO L168 Benchmark]: Boogie Preprocessor took 158.22 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:08:44,283 INFO L168 Benchmark]: RCFGBuilder took 4740.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 186.5 MB). Peak memory consumption was 186.5 MB. Max. memory is 7.1 GB. [2018-10-24 16:08:44,284 INFO L168 Benchmark]: TraceAbstraction took 238242.70 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 422.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-24 16:08:44,289 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.22 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 880.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 264.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -847.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 158.22 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4740.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 186.5 MB). Peak memory consumption was 186.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238242.70 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 422.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 99). Cancelled while BasicCegarLoop was constructing difference of abstraction (37897states) and FLOYD_HOARE automaton (currently 4 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (135 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. TIMEOUT Result, 238.1s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 171.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3906 SDtfs, 18516 SDslu, 3304 SDs, 0 SdLazy, 48821 SolverSat, 6528 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 144.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3901 GetRequests, 3752 SyntacticMatches, 24 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 49.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37897occurred in iteration=19, 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: 4.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 89268 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 53.6s InterpolantComputationTime, 12120 NumberOfCodeBlocks, 12120 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 12094 ConstructedInterpolants, 1274 QuantifiedInterpolants, 77468824 SizeOfPredicates, 12 NumberOfNonLiveVariables, 4699 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 10627/17165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown