java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-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/Problem13_label54_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:14:50,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:14:50,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:14:50,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:14:50,300 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:14:50,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:14:50,303 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:14:50,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:14:50,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:14:50,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:14:50,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:14:50,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:14:50,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:14:50,311 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:14:50,312 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:14:50,313 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:14:50,314 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:14:50,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:14:50,318 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:14:50,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:14:50,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:14:50,322 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:14:50,324 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:14:50,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:14:50,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:14:50,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:14:50,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:14:50,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:14:50,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:14:50,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:14:50,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:14:50,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:14:50,330 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:14:50,331 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:14:50,332 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:14:50,332 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:14:50,333 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:14:50,360 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:14:50,360 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:14:50,361 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:14:50,362 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:14:50,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:14:50,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:14:50,363 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:14:50,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:14:50,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:14:50,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:14:50,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:14:50,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:14:50,365 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:14:50,365 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:14:50,365 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:14:50,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:14:50,366 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:14:50,366 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:14:50,366 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:14:50,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:14:50,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:14:50,368 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:14:50,368 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:14:50,368 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:14:50,368 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:14:50,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:14:50,369 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:14:50,369 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:14:50,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:14:50,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:14:50,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:14:50,440 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:14:50,441 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:14:50,442 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label54_false-unreach-call.c [2018-11-06 19:14:50,511 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23b90309/6b87f59b8813461c9feb5dc78fdecbe4/FLAG774d01acb [2018-11-06 19:14:51,412 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:14:51,413 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label54_false-unreach-call.c [2018-11-06 19:14:51,458 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23b90309/6b87f59b8813461c9feb5dc78fdecbe4/FLAG774d01acb [2018-11-06 19:14:51,477 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23b90309/6b87f59b8813461c9feb5dc78fdecbe4 [2018-11-06 19:14:51,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:14:51,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:14:51,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:14:51,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:14:51,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:14:51,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:14:51" (1/1) ... [2018-11-06 19:14:51,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5367fa28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:51, skipping insertion in model container [2018-11-06 19:14:51,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:14:51" (1/1) ... [2018-11-06 19:14:51,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:14:51,718 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:14:53,099 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:14:53,106 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:14:53,854 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:14:53,892 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:14:53,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53 WrapperNode [2018-11-06 19:14:53,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:14:53,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:14:53,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:14:53,894 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:14:53,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53" (1/1) ... [2018-11-06 19:14:54,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53" (1/1) ... [2018-11-06 19:14:54,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:14:54,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:14:54,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:14:54,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:14:54,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53" (1/1) ... [2018-11-06 19:14:54,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53" (1/1) ... [2018-11-06 19:14:54,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53" (1/1) ... [2018-11-06 19:14:54,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53" (1/1) ... [2018-11-06 19:14:55,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53" (1/1) ... [2018-11-06 19:14:55,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53" (1/1) ... [2018-11-06 19:14:55,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53" (1/1) ... [2018-11-06 19:14:55,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:14:55,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:14:55,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:14:55,377 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:14:55,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:14:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:14:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:14:55,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:15:05,788 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:15:05,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:15:05 BoogieIcfgContainer [2018-11-06 19:15:05,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:15:05,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:15:05,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:15:05,794 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:15:05,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:14:51" (1/3) ... [2018-11-06 19:15:05,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a3ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:15:05, skipping insertion in model container [2018-11-06 19:15:05,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:53" (2/3) ... [2018-11-06 19:15:05,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a3ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:15:05, skipping insertion in model container [2018-11-06 19:15:05,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:15:05" (3/3) ... [2018-11-06 19:15:05,797 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label54_false-unreach-call.c [2018-11-06 19:15:05,807 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:15:05,817 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:15:05,834 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:15:05,878 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:15:05,879 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:15:05,879 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:15:05,880 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:15:05,880 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:15:05,880 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:15:05,880 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:15:05,880 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:15:05,880 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:15:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 19:15:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-06 19:15:05,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:05,937 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] [2018-11-06 19:15:05,939 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:05,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:05,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1880720510, now seen corresponding path program 1 times [2018-11-06 19:15:05,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:05,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:05,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:05,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:05,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:06,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:06,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:06,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:06,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:06,378 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 19:15:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:18,888 INFO L93 Difference]: Finished difference Result 3973 states and 7416 transitions. [2018-11-06 19:15:18,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:18,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-06 19:15:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:18,935 INFO L225 Difference]: With dead ends: 3973 [2018-11-06 19:15:18,936 INFO L226 Difference]: Without dead ends: 2867 [2018-11-06 19:15:18,944 INFO L604 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-11-06 19:15:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2018-11-06 19:15:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1938. [2018-11-06 19:15:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2018-11-06 19:15:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 3240 transitions. [2018-11-06 19:15:19,092 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 3240 transitions. Word has length 28 [2018-11-06 19:15:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:19,092 INFO L480 AbstractCegarLoop]: Abstraction has 1938 states and 3240 transitions. [2018-11-06 19:15:19,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 3240 transitions. [2018-11-06 19:15:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-06 19:15:19,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:19,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:15:19,097 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:19,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1373493925, now seen corresponding path program 1 times [2018-11-06 19:15:19,098 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:19,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:19,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:19,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:19,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:19,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:19,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:19,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:19,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:19,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:19,446 INFO L87 Difference]: Start difference. First operand 1938 states and 3240 transitions. Second operand 4 states. [2018-11-06 19:15:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:33,540 INFO L93 Difference]: Finished difference Result 7101 states and 12101 transitions. [2018-11-06 19:15:33,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:33,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-06 19:15:33,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:33,571 INFO L225 Difference]: With dead ends: 7101 [2018-11-06 19:15:33,571 INFO L226 Difference]: Without dead ends: 5165 [2018-11-06 19:15:33,576 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2018-11-06 19:15:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 3540. [2018-11-06 19:15:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3540 states. [2018-11-06 19:15:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 5445 transitions. [2018-11-06 19:15:33,658 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 5445 transitions. Word has length 100 [2018-11-06 19:15:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:33,659 INFO L480 AbstractCegarLoop]: Abstraction has 3540 states and 5445 transitions. [2018-11-06 19:15:33,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 5445 transitions. [2018-11-06 19:15:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-06 19:15:33,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:33,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:15:33,664 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:33,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:33,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1648295608, now seen corresponding path program 1 times [2018-11-06 19:15:33,665 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:33,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:33,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:33,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:33,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:33,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:33,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:33,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:33,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:33,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:33,941 INFO L87 Difference]: Start difference. First operand 3540 states and 5445 transitions. Second operand 4 states. [2018-11-06 19:15:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:44,960 INFO L93 Difference]: Finished difference Result 13554 states and 21081 transitions. [2018-11-06 19:15:44,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:44,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-11-06 19:15:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:45,009 INFO L225 Difference]: With dead ends: 13554 [2018-11-06 19:15:45,009 INFO L226 Difference]: Without dead ends: 10016 [2018-11-06 19:15:45,017 INFO L604 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-11-06 19:15:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10016 states. [2018-11-06 19:15:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10016 to 6718. [2018-11-06 19:15:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6718 states. [2018-11-06 19:15:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 9885 transitions. [2018-11-06 19:15:45,158 INFO L78 Accepts]: Start accepts. Automaton has 6718 states and 9885 transitions. Word has length 114 [2018-11-06 19:15:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:45,159 INFO L480 AbstractCegarLoop]: Abstraction has 6718 states and 9885 transitions. [2018-11-06 19:15:45,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 6718 states and 9885 transitions. [2018-11-06 19:15:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-06 19:15:45,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:45,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:15:45,164 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:45,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:45,164 INFO L82 PathProgramCache]: Analyzing trace with hash -394755061, now seen corresponding path program 1 times [2018-11-06 19:15:45,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:45,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:45,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:45,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:45,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:45,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:45,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:45,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:45,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:45,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:45,475 INFO L87 Difference]: Start difference. First operand 6718 states and 9885 transitions. Second operand 4 states. [2018-11-06 19:15:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:57,481 INFO L93 Difference]: Finished difference Result 23854 states and 35012 transitions. [2018-11-06 19:15:57,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:57,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-11-06 19:15:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:57,533 INFO L225 Difference]: With dead ends: 23854 [2018-11-06 19:15:57,533 INFO L226 Difference]: Without dead ends: 17138 [2018-11-06 19:15:57,545 INFO L604 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-11-06 19:15:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17138 states. [2018-11-06 19:15:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17138 to 13037. [2018-11-06 19:15:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13037 states. [2018-11-06 19:15:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13037 states to 13037 states and 18976 transitions. [2018-11-06 19:15:57,778 INFO L78 Accepts]: Start accepts. Automaton has 13037 states and 18976 transitions. Word has length 132 [2018-11-06 19:15:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:57,778 INFO L480 AbstractCegarLoop]: Abstraction has 13037 states and 18976 transitions. [2018-11-06 19:15:57,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 13037 states and 18976 transitions. [2018-11-06 19:15:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-06 19:15:57,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:57,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:15:57,782 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:57,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:57,782 INFO L82 PathProgramCache]: Analyzing trace with hash -83044117, now seen corresponding path program 1 times [2018-11-06 19:15:57,782 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:57,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:57,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:57,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:57,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:58,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:58,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:58,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:58,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:58,193 INFO L87 Difference]: Start difference. First operand 13037 states and 18976 transitions. Second operand 4 states. [2018-11-06 19:16:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:16:07,619 INFO L93 Difference]: Finished difference Result 51334 states and 74903 transitions. [2018-11-06 19:16:07,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:16:07,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-11-06 19:16:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:16:07,704 INFO L225 Difference]: With dead ends: 51334 [2018-11-06 19:16:07,704 INFO L226 Difference]: Without dead ends: 38299 [2018-11-06 19:16:07,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-06 19:16:07,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38299 states. [2018-11-06 19:16:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38299 to 38259. [2018-11-06 19:16:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38259 states. [2018-11-06 19:16:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38259 states to 38259 states and 50689 transitions. [2018-11-06 19:16:08,259 INFO L78 Accepts]: Start accepts. Automaton has 38259 states and 50689 transitions. Word has length 162 [2018-11-06 19:16:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:16:08,259 INFO L480 AbstractCegarLoop]: Abstraction has 38259 states and 50689 transitions. [2018-11-06 19:16:08,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:16:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 38259 states and 50689 transitions. [2018-11-06 19:16:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-06 19:16:08,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:16:08,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:16:08,263 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:16:08,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:16:08,263 INFO L82 PathProgramCache]: Analyzing trace with hash 821999137, now seen corresponding path program 1 times [2018-11-06 19:16:08,263 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:16:08,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:16:08,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:08,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:16:08,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:16:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:16:08,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:16:08,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:16:08,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:16:08,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:16:08,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:08,647 INFO L87 Difference]: Start difference. First operand 38259 states and 50689 transitions. Second operand 4 states. [2018-11-06 19:16:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:16:18,124 INFO L93 Difference]: Finished difference Result 130933 states and 171774 transitions. [2018-11-06 19:16:18,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:16:18,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-11-06 19:16:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:16:18,293 INFO L225 Difference]: With dead ends: 130933 [2018-11-06 19:16:18,294 INFO L226 Difference]: Without dead ends: 92676 [2018-11-06 19:16:18,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:18,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92676 states. [2018-11-06 19:16:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92676 to 72143. [2018-11-06 19:16:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72143 states. [2018-11-06 19:16:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72143 states to 72143 states and 90430 transitions. [2018-11-06 19:16:19,320 INFO L78 Accepts]: Start accepts. Automaton has 72143 states and 90430 transitions. Word has length 166 [2018-11-06 19:16:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:16:19,321 INFO L480 AbstractCegarLoop]: Abstraction has 72143 states and 90430 transitions. [2018-11-06 19:16:19,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:16:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 72143 states and 90430 transitions. [2018-11-06 19:16:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-06 19:16:19,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:16:19,328 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:16:19,328 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:16:19,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:16:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash 259007377, now seen corresponding path program 1 times [2018-11-06 19:16:19,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:16:19,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:16:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:19,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:16:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:16:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-06 19:16:19,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:16:19,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:16:19,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:16:19,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:16:19,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:16:19,958 INFO L87 Difference]: Start difference. First operand 72143 states and 90430 transitions. Second operand 3 states. [2018-11-06 19:16:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:16:27,709 INFO L93 Difference]: Finished difference Result 201016 states and 251696 transitions. [2018-11-06 19:16:27,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:16:27,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2018-11-06 19:16:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:16:27,871 INFO L225 Difference]: With dead ends: 201016 [2018-11-06 19:16:27,872 INFO L226 Difference]: Without dead ends: 128875 [2018-11-06 19:16:27,932 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:16:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128875 states. [2018-11-06 19:16:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128875 to 128084. [2018-11-06 19:16:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128084 states. [2018-11-06 19:16:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128084 states to 128084 states and 150897 transitions. [2018-11-06 19:16:30,161 INFO L78 Accepts]: Start accepts. Automaton has 128084 states and 150897 transitions. Word has length 260 [2018-11-06 19:16:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:16:30,161 INFO L480 AbstractCegarLoop]: Abstraction has 128084 states and 150897 transitions. [2018-11-06 19:16:30,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:16:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 128084 states and 150897 transitions. [2018-11-06 19:16:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-06 19:16:30,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:16:30,169 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:16:30,169 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:16:30,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:16:30,170 INFO L82 PathProgramCache]: Analyzing trace with hash -638506597, now seen corresponding path program 1 times [2018-11-06 19:16:30,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:16:30,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:16:30,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:30,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:16:30,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:16:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-06 19:16:30,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:16:30,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:16:30,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:16:30,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:16:30,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:16:30,654 INFO L87 Difference]: Start difference. First operand 128084 states and 150897 transitions. Second operand 5 states. [2018-11-06 19:16:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:16:42,784 INFO L93 Difference]: Finished difference Result 268007 states and 314360 transitions. [2018-11-06 19:16:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:16:42,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2018-11-06 19:16:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:16:42,948 INFO L225 Difference]: With dead ends: 268007 [2018-11-06 19:16:42,948 INFO L226 Difference]: Without dead ends: 139925 [2018-11-06 19:16:42,996 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:16:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139925 states. [2018-11-06 19:16:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139925 to 138328. [2018-11-06 19:16:44,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138328 states. [2018-11-06 19:16:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138328 states to 138328 states and 161451 transitions. [2018-11-06 19:16:44,253 INFO L78 Accepts]: Start accepts. Automaton has 138328 states and 161451 transitions. Word has length 264 [2018-11-06 19:16:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:16:44,253 INFO L480 AbstractCegarLoop]: Abstraction has 138328 states and 161451 transitions. [2018-11-06 19:16:44,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:16:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 138328 states and 161451 transitions. [2018-11-06 19:16:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-06 19:16:44,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:16:44,264 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:16:44,265 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:16:44,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:16:44,265 INFO L82 PathProgramCache]: Analyzing trace with hash -604590294, now seen corresponding path program 1 times [2018-11-06 19:16:44,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:16:44,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:16:44,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:44,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:16:44,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:16:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-06 19:16:44,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:16:44,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:16:44,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:16:44,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:16:44,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:16:44,599 INFO L87 Difference]: Start difference. First operand 138328 states and 161451 transitions. Second operand 5 states. [2018-11-06 19:17:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:17:01,766 INFO L93 Difference]: Finished difference Result 362067 states and 425536 transitions. [2018-11-06 19:17:01,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:17:01,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 328 [2018-11-06 19:17:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:17:02,029 INFO L225 Difference]: With dead ends: 362067 [2018-11-06 19:17:02,029 INFO L226 Difference]: Without dead ends: 224529 [2018-11-06 19:17:02,103 INFO L604 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-11-06 19:17:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224529 states. [2018-11-06 19:17:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224529 to 214864. [2018-11-06 19:17:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214864 states. [2018-11-06 19:17:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214864 states to 214864 states and 249636 transitions. [2018-11-06 19:17:05,202 INFO L78 Accepts]: Start accepts. Automaton has 214864 states and 249636 transitions. Word has length 328 [2018-11-06 19:17:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:17:05,203 INFO L480 AbstractCegarLoop]: Abstraction has 214864 states and 249636 transitions. [2018-11-06 19:17:05,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:17:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 214864 states and 249636 transitions. [2018-11-06 19:17:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-11-06 19:17:05,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:17:05,211 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:17:05,212 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:17:05,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:17:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1490097149, now seen corresponding path program 1 times [2018-11-06 19:17:05,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:17:05,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:17:05,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:05,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:17:05,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:17:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2018-11-06 19:17:05,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:17:05,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:17:05,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:17:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:17:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:17:05,538 INFO L87 Difference]: Start difference. First operand 214864 states and 249636 transitions. Second operand 4 states. [2018-11-06 19:17:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:17:17,425 INFO L93 Difference]: Finished difference Result 528281 states and 614630 transitions. [2018-11-06 19:17:17,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:17:17,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2018-11-06 19:17:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:17:17,873 INFO L225 Difference]: With dead ends: 528281 [2018-11-06 19:17:17,873 INFO L226 Difference]: Without dead ends: 314207 [2018-11-06 19:17:18,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:17:18,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314207 states. [2018-11-06 19:17:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314207 to 310213. [2018-11-06 19:17:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310213 states. [2018-11-06 19:17:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310213 states to 310213 states and 351116 transitions. [2018-11-06 19:17:31,068 INFO L78 Accepts]: Start accepts. Automaton has 310213 states and 351116 transitions. Word has length 361 [2018-11-06 19:17:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:17:31,069 INFO L480 AbstractCegarLoop]: Abstraction has 310213 states and 351116 transitions. [2018-11-06 19:17:31,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:17:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 310213 states and 351116 transitions. [2018-11-06 19:17:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-11-06 19:17:31,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:17:31,077 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:17:31,077 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:17:31,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:17:31,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1077182117, now seen corresponding path program 1 times [2018-11-06 19:17:31,078 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:17:31,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:17:31,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:31,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:17:31,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:17:31,515 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:17:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-06 19:17:31,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:17:31,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:17:31,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:17:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:17:31,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:17:31,756 INFO L87 Difference]: Start difference. First operand 310213 states and 351116 transitions. Second operand 4 states. [2018-11-06 19:17:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:17:41,760 INFO L93 Difference]: Finished difference Result 633031 states and 715879 transitions. [2018-11-06 19:17:41,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:17:41,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2018-11-06 19:17:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:17:42,109 INFO L225 Difference]: With dead ends: 633031 [2018-11-06 19:17:42,109 INFO L226 Difference]: Without dead ends: 282564 [2018-11-06 19:17:42,240 INFO L604 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-11-06 19:17:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282564 states. [2018-11-06 19:17:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282564 to 266802. [2018-11-06 19:17:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266802 states. [2018-11-06 19:17:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266802 states to 266802 states and 297621 transitions. [2018-11-06 19:17:46,551 INFO L78 Accepts]: Start accepts. Automaton has 266802 states and 297621 transitions. Word has length 409 [2018-11-06 19:17:46,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:17:46,552 INFO L480 AbstractCegarLoop]: Abstraction has 266802 states and 297621 transitions. [2018-11-06 19:17:46,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:17:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 266802 states and 297621 transitions. [2018-11-06 19:17:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-11-06 19:17:46,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:17:46,560 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:17:46,560 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:17:46,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:17:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1814472154, now seen corresponding path program 1 times [2018-11-06 19:17:46,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:17:46,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:17:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:46,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:17:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:17:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 431 proven. 5 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2018-11-06 19:17:47,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:17:47,198 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:17:47,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:17:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:17:47,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:17:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-06 19:17:48,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:17:48,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 19:17:48,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:17:48,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:17:48,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:17:48,563 INFO L87 Difference]: Start difference. First operand 266802 states and 297621 transitions. Second operand 5 states. [2018-11-06 19:18:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:18:00,238 INFO L93 Difference]: Finished difference Result 534372 states and 596669 transitions. [2018-11-06 19:18:00,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:18:00,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 466 [2018-11-06 19:18:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:18:00,781 INFO L225 Difference]: With dead ends: 534372 [2018-11-06 19:18:00,781 INFO L226 Difference]: Without dead ends: 267572 [2018-11-06 19:18:00,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 467 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:18:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267572 states. [2018-11-06 19:18:06,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267572 to 264414. [2018-11-06 19:18:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264414 states. [2018-11-06 19:18:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264414 states to 264414 states and 284719 transitions. [2018-11-06 19:18:06,374 INFO L78 Accepts]: Start accepts. Automaton has 264414 states and 284719 transitions. Word has length 466 [2018-11-06 19:18:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:18:06,374 INFO L480 AbstractCegarLoop]: Abstraction has 264414 states and 284719 transitions. [2018-11-06 19:18:06,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:18:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 264414 states and 284719 transitions. [2018-11-06 19:18:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-11-06 19:18:06,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:18:06,390 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:18:06,391 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:18:06,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:18:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1653544463, now seen corresponding path program 1 times [2018-11-06 19:18:06,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:18:06,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:18:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:18:06,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:18:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:18:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:18:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2018-11-06 19:18:07,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:18:07,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:18:07,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:18:07,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:18:07,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:18:07,070 INFO L87 Difference]: Start difference. First operand 264414 states and 284719 transitions. Second operand 4 states. [2018-11-06 19:18:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:18:16,872 INFO L93 Difference]: Finished difference Result 522533 states and 562708 transitions. [2018-11-06 19:18:16,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:18:16,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 490 [2018-11-06 19:18:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:18:17,182 INFO L225 Difference]: With dead ends: 522533 [2018-11-06 19:18:17,183 INFO L226 Difference]: Without dead ends: 258909 [2018-11-06 19:18:17,314 INFO L604 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-11-06 19:18:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258909 states. [2018-11-06 19:18:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258909 to 253360. [2018-11-06 19:18:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253360 states. [2018-11-06 19:18:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253360 states to 253360 states and 268052 transitions. [2018-11-06 19:18:25,216 INFO L78 Accepts]: Start accepts. Automaton has 253360 states and 268052 transitions. Word has length 490 [2018-11-06 19:18:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:18:25,217 INFO L480 AbstractCegarLoop]: Abstraction has 253360 states and 268052 transitions. [2018-11-06 19:18:25,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:18:25,217 INFO L276 IsEmpty]: Start isEmpty. Operand 253360 states and 268052 transitions. [2018-11-06 19:18:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-11-06 19:18:25,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:18:25,222 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:18:25,222 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:18:25,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:18:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1128193089, now seen corresponding path program 1 times [2018-11-06 19:18:25,223 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:18:25,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:18:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:18:25,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:18:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:18:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:18:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2018-11-06 19:18:25,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:18:25,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:18:25,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:18:25,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:18:25,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:18:25,713 INFO L87 Difference]: Start difference. First operand 253360 states and 268052 transitions. Second operand 3 states. Received shutdown request... [2018-11-06 19:18:26,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:18:26,491 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:18:26,497 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:18:26,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:18:26 BoogieIcfgContainer [2018-11-06 19:18:26,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:18:26,499 INFO L168 Benchmark]: Toolchain (without parser) took 215007.03 ms. Allocated memory was 1.5 GB in the beginning and 5.1 GB in the end (delta: 3.5 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-06 19:18:26,501 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:18:26,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2398.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:18:26,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 795.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 801.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -980.8 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:18:26,503 INFO L168 Benchmark]: Boogie Preprocessor took 687.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 68.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:18:26,503 INFO L168 Benchmark]: RCFGBuilder took 10412.49 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 264.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -1.2 MB). Peak memory consumption was 588.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:18:26,504 INFO L168 Benchmark]: TraceAbstraction took 200707.89 ms. Allocated memory was 2.6 GB in the beginning and 5.1 GB in the end (delta: 2.5 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-06 19:18:26,510 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2398.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 795.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 801.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -980.8 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 687.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 68.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10412.49 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 264.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -1.2 MB). Peak memory consumption was 588.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 200707.89 ms. Allocated memory was 2.6 GB in the beginning and 5.1 GB in the end (delta: 2.5 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 93). Cancelled while BasicCegarLoop was constructing difference of abstraction (253360states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (3094 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 200.6s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 153.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11267 SDtfs, 27189 SDslu, 3910 SDs, 0 SdLazy, 68605 SolverSat, 15327 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 113.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 482 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310213occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 39.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 71042 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 4264 NumberOfCodeBlocks, 4264 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4249 ConstructedInterpolants, 0 QuantifiedInterpolants, 3622277 SizeOfPredicates, 1 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 5508/5513 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown