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/Problem15_label39_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:24:20,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:24:20,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:24:20,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:24:20,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:24:20,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:24:20,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:24:20,600 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:24:20,601 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:24:20,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:24:20,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:24:20,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:24:20,604 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:24:20,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:24:20,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:24:20,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:24:20,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:24:20,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:24:20,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:24:20,614 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:24:20,615 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:24:20,616 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:24:20,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:24:20,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:24:20,620 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:24:20,621 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:24:20,622 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:24:20,623 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:24:20,624 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:24:20,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:24:20,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:24:20,626 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:24:20,626 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:24:20,626 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:24:20,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:24:20,628 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:24:20,629 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-26 19:24:20,654 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:24:20,655 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:24:20,655 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:24:20,656 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:24:20,657 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:24:20,657 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:24:20,658 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:24:20,658 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:24:20,658 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:24:20,658 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:24:20,658 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:24:20,659 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:24:20,659 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:24:20,659 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:24:20,659 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:24:20,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:24:20,660 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:24:20,661 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:24:20,661 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:24:20,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:24:20,662 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:24:20,662 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:24:20,662 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:24:20,662 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:24:20,662 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:24:20,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:24:20,663 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:24:20,663 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:24:20,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:24:20,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:24:20,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:24:20,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:24:20,746 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:24:20,747 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label39_false-unreach-call.c [2018-10-26 19:24:20,812 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9fdde9dab/bb90642613a2454685b233c9e5f52daf/FLAG68947716f [2018-10-26 19:24:21,519 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:24:21,519 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label39_false-unreach-call.c [2018-10-26 19:24:21,541 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9fdde9dab/bb90642613a2454685b233c9e5f52daf/FLAG68947716f [2018-10-26 19:24:21,563 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9fdde9dab/bb90642613a2454685b233c9e5f52daf [2018-10-26 19:24:21,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:24:21,577 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:24:21,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:24:21,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:24:21,583 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:24:21,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:24:21" (1/1) ... [2018-10-26 19:24:21,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769766bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:21, skipping insertion in model container [2018-10-26 19:24:21,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:24:21" (1/1) ... [2018-10-26 19:24:21,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:24:21,692 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:24:22,470 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:24:22,475 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:24:22,771 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:24:22,792 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:24:22,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22 WrapperNode [2018-10-26 19:24:22,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:24:22,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:24:22,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:24:22,794 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:24:22,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22" (1/1) ... [2018-10-26 19:24:22,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22" (1/1) ... [2018-10-26 19:24:23,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:24:23,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:24:23,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:24:23,196 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:24:23,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22" (1/1) ... [2018-10-26 19:24:23,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22" (1/1) ... [2018-10-26 19:24:23,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22" (1/1) ... [2018-10-26 19:24:23,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22" (1/1) ... [2018-10-26 19:24:23,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22" (1/1) ... [2018-10-26 19:24:23,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22" (1/1) ... [2018-10-26 19:24:23,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22" (1/1) ... [2018-10-26 19:24:23,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:24:23,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:24:23,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:24:23,409 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:24:23,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22" (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-26 19:24:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:24:23,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:24:23,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:24:29,744 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:24:29,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:24:29 BoogieIcfgContainer [2018-10-26 19:24:29,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:24:29,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:24:29,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:24:29,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:24:29,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:24:21" (1/3) ... [2018-10-26 19:24:29,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732b686c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:24:29, skipping insertion in model container [2018-10-26 19:24:29,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:22" (2/3) ... [2018-10-26 19:24:29,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732b686c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:24:29, skipping insertion in model container [2018-10-26 19:24:29,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:24:29" (3/3) ... [2018-10-26 19:24:29,754 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label39_false-unreach-call.c [2018-10-26 19:24:29,765 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:24:29,777 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:24:29,795 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:24:29,843 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:24:29,844 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:24:29,844 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:24:29,845 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:24:29,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:24:29,845 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:24:29,845 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:24:29,845 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:24:29,846 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:24:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-10-26 19:24:29,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 19:24:29,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:29,883 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:29,886 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:29,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash -643220670, now seen corresponding path program 1 times [2018-10-26 19:24:29,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:29,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:29,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:29,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:29,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:30,257 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-26 19:24:30,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:30,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:24:30,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:24:30,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:24:30,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:24:30,285 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-10-26 19:24:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:38,146 INFO L93 Difference]: Finished difference Result 1461 states and 2710 transitions. [2018-10-26 19:24:38,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:24:38,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-26 19:24:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:38,176 INFO L225 Difference]: With dead ends: 1461 [2018-10-26 19:24:38,177 INFO L226 Difference]: Without dead ends: 1029 [2018-10-26 19:24:38,183 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-26 19:24:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-10-26 19:24:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 724. [2018-10-26 19:24:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-26 19:24:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1102 transitions. [2018-10-26 19:24:38,292 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1102 transitions. Word has length 12 [2018-10-26 19:24:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:38,293 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1102 transitions. [2018-10-26 19:24:38,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:24:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1102 transitions. [2018-10-26 19:24:38,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-26 19:24:38,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:38,297 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:24:38,298 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:38,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash -711428387, now seen corresponding path program 1 times [2018-10-26 19:24:38,299 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:38,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:38,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:38,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:38,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:38,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:38,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:24:38,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:24:38,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:24:38,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:24:38,707 INFO L87 Difference]: Start difference. First operand 724 states and 1102 transitions. Second operand 5 states. [2018-10-26 19:24:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:49,782 INFO L93 Difference]: Finished difference Result 2371 states and 3547 transitions. [2018-10-26 19:24:49,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:24:49,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-10-26 19:24:49,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:49,794 INFO L225 Difference]: With dead ends: 2371 [2018-10-26 19:24:49,794 INFO L226 Difference]: Without dead ends: 1649 [2018-10-26 19:24:49,802 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-26 19:24:49,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2018-10-26 19:24:49,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1341. [2018-10-26 19:24:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-26 19:24:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1885 transitions. [2018-10-26 19:24:49,855 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1885 transitions. Word has length 78 [2018-10-26 19:24:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:49,856 INFO L481 AbstractCegarLoop]: Abstraction has 1341 states and 1885 transitions. [2018-10-26 19:24:49,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:24:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1885 transitions. [2018-10-26 19:24:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 19:24:49,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:49,861 INFO L375 BasicCegarLoop]: trace histogram [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-26 19:24:49,861 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:49,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:49,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2019550931, now seen corresponding path program 1 times [2018-10-26 19:24:49,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:49,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:49,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:49,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:49,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:50,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:50,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:24:50,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:24:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:24:50,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:24:50,099 INFO L87 Difference]: Start difference. First operand 1341 states and 1885 transitions. Second operand 4 states. [2018-10-26 19:24:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:55,452 INFO L93 Difference]: Finished difference Result 4794 states and 6886 transitions. [2018-10-26 19:24:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:24:55,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-10-26 19:24:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:55,469 INFO L225 Difference]: With dead ends: 4794 [2018-10-26 19:24:55,470 INFO L226 Difference]: Without dead ends: 3455 [2018-10-26 19:24:55,472 INFO L605 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-10-26 19:24:55,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3455 states. [2018-10-26 19:24:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3455 to 3450. [2018-10-26 19:24:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3450 states. [2018-10-26 19:24:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4522 transitions. [2018-10-26 19:24:55,538 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4522 transitions. Word has length 83 [2018-10-26 19:24:55,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:55,539 INFO L481 AbstractCegarLoop]: Abstraction has 3450 states and 4522 transitions. [2018-10-26 19:24:55,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:24:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4522 transitions. [2018-10-26 19:24:55,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-26 19:24:55,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:55,542 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:55,542 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:55,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:55,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1017655630, now seen corresponding path program 1 times [2018-10-26 19:24:55,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:55,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:55,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:55,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:55,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:55,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:24:55,777 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-26 19:24:55,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:55,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:24:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:56,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:24:56,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-26 19:24:56,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:24:56,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:24:56,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:24:56,225 INFO L87 Difference]: Start difference. First operand 3450 states and 4522 transitions. Second operand 7 states. [2018-10-26 19:25:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:25:19,601 INFO L93 Difference]: Finished difference Result 15681 states and 21491 transitions. [2018-10-26 19:25:19,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:25:19,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-10-26 19:25:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:25:19,653 INFO L225 Difference]: With dead ends: 15681 [2018-10-26 19:25:19,653 INFO L226 Difference]: Without dead ends: 12233 [2018-10-26 19:25:19,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:25:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2018-10-26 19:25:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 10396. [2018-10-26 19:25:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10396 states. [2018-10-26 19:25:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10396 states to 10396 states and 13144 transitions. [2018-10-26 19:25:19,865 INFO L78 Accepts]: Start accepts. Automaton has 10396 states and 13144 transitions. Word has length 104 [2018-10-26 19:25:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:25:19,866 INFO L481 AbstractCegarLoop]: Abstraction has 10396 states and 13144 transitions. [2018-10-26 19:25:19,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 19:25:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 10396 states and 13144 transitions. [2018-10-26 19:25:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-26 19:25:19,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:25:19,875 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:25:19,876 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:25:19,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:25:19,876 INFO L82 PathProgramCache]: Analyzing trace with hash -760287831, now seen corresponding path program 1 times [2018-10-26 19:25:19,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:25:19,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:25:19,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:19,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-26 19:25:20,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:25:20,273 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-26 19:25:20,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:20,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:25:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 19:25:20,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:25:20,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-26 19:25:20,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:25:20,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:25:20,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:25:20,484 INFO L87 Difference]: Start difference. First operand 10396 states and 13144 transitions. Second operand 4 states. [2018-10-26 19:25:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:25:26,479 INFO L93 Difference]: Finished difference Result 33478 states and 42734 transitions. [2018-10-26 19:25:26,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:25:26,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2018-10-26 19:25:26,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:25:26,542 INFO L225 Difference]: With dead ends: 33478 [2018-10-26 19:25:26,542 INFO L226 Difference]: Without dead ends: 16967 [2018-10-26 19:25:26,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 262 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-26 19:25:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16967 states. [2018-10-26 19:25:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16967 to 12736. [2018-10-26 19:25:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12736 states. [2018-10-26 19:25:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12736 states to 12736 states and 14068 transitions. [2018-10-26 19:25:26,782 INFO L78 Accepts]: Start accepts. Automaton has 12736 states and 14068 transitions. Word has length 262 [2018-10-26 19:25:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:25:26,783 INFO L481 AbstractCegarLoop]: Abstraction has 12736 states and 14068 transitions. [2018-10-26 19:25:26,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:25:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 12736 states and 14068 transitions. [2018-10-26 19:25:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-26 19:25:26,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:25:26,789 INFO L375 BasicCegarLoop]: trace histogram [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, 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-10-26 19:25:26,789 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:25:26,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:25:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash 434069768, now seen corresponding path program 1 times [2018-10-26 19:25:26,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:25:26,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:25:26,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:26,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:27,461 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-26 19:25:27,783 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-26 19:25:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 19:25:28,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:25:28,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:25:28,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:25:28,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:25:28,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:25:28,105 INFO L87 Difference]: Start difference. First operand 12736 states and 14068 transitions. Second operand 5 states. [2018-10-26 19:25:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:25:32,294 INFO L93 Difference]: Finished difference Result 26075 states and 28789 transitions. [2018-10-26 19:25:32,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:25:32,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 332 [2018-10-26 19:25:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:25:32,319 INFO L225 Difference]: With dead ends: 26075 [2018-10-26 19:25:32,319 INFO L226 Difference]: Without dead ends: 13641 [2018-10-26 19:25:32,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:25:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13641 states. [2018-10-26 19:25:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13641 to 13636. [2018-10-26 19:25:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13636 states. [2018-10-26 19:25:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13636 states to 13636 states and 14980 transitions. [2018-10-26 19:25:32,504 INFO L78 Accepts]: Start accepts. Automaton has 13636 states and 14980 transitions. Word has length 332 [2018-10-26 19:25:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:25:32,504 INFO L481 AbstractCegarLoop]: Abstraction has 13636 states and 14980 transitions. [2018-10-26 19:25:32,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:25:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 13636 states and 14980 transitions. [2018-10-26 19:25:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-10-26 19:25:32,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:25:32,516 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:25:32,516 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:25:32,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:25:32,516 INFO L82 PathProgramCache]: Analyzing trace with hash 488424775, now seen corresponding path program 1 times [2018-10-26 19:25:32,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:25:32,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:25:32,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:32,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:32,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:33,139 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 19:25:33,717 WARN L179 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-10-26 19:25:34,046 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-10-26 19:25:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 213 proven. 71 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 19:25:35,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:25:35,140 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-26 19:25:35,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:35,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:25:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-26 19:25:35,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:25:35,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-10-26 19:25:35,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:25:35,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:25:35,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:25:35,452 INFO L87 Difference]: Start difference. First operand 13636 states and 14980 transitions. Second operand 9 states. [2018-10-26 19:25:36,499 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 7 [2018-10-26 19:25:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:25:44,204 INFO L93 Difference]: Finished difference Result 35019 states and 38812 transitions. [2018-10-26 19:25:44,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 19:25:44,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 468 [2018-10-26 19:25:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:25:44,241 INFO L225 Difference]: With dead ends: 35019 [2018-10-26 19:25:44,241 INFO L226 Difference]: Without dead ends: 21685 [2018-10-26 19:25:44,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 471 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-10-26 19:25:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21685 states. [2018-10-26 19:25:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21685 to 21438. [2018-10-26 19:25:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21438 states. [2018-10-26 19:25:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21438 states to 21438 states and 23186 transitions. [2018-10-26 19:25:44,542 INFO L78 Accepts]: Start accepts. Automaton has 21438 states and 23186 transitions. Word has length 468 [2018-10-26 19:25:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:25:44,542 INFO L481 AbstractCegarLoop]: Abstraction has 21438 states and 23186 transitions. [2018-10-26 19:25:44,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:25:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 21438 states and 23186 transitions. [2018-10-26 19:25:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-10-26 19:25:44,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:25:44,553 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:25:44,553 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:25:44,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:25:44,554 INFO L82 PathProgramCache]: Analyzing trace with hash -921037930, now seen corresponding path program 1 times [2018-10-26 19:25:44,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:25:44,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:25:44,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:44,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:44,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 19:25:45,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:25:45,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:25:45,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:25:45,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:25:45,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:25:45,077 INFO L87 Difference]: Start difference. First operand 21438 states and 23186 transitions. Second operand 4 states. [2018-10-26 19:25:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:25:48,863 INFO L93 Difference]: Finished difference Result 42575 states and 46073 transitions. [2018-10-26 19:25:48,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:25:48,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 494 [2018-10-26 19:25:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:25:48,893 INFO L225 Difference]: With dead ends: 42575 [2018-10-26 19:25:48,893 INFO L226 Difference]: Without dead ends: 21439 [2018-10-26 19:25:48,910 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-26 19:25:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21439 states. [2018-10-26 19:25:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21439 to 21435. [2018-10-26 19:25:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21435 states. [2018-10-26 19:25:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21435 states to 21435 states and 22831 transitions. [2018-10-26 19:25:49,150 INFO L78 Accepts]: Start accepts. Automaton has 21435 states and 22831 transitions. Word has length 494 [2018-10-26 19:25:49,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:25:49,151 INFO L481 AbstractCegarLoop]: Abstraction has 21435 states and 22831 transitions. [2018-10-26 19:25:49,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:25:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand 21435 states and 22831 transitions. [2018-10-26 19:25:49,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-10-26 19:25:49,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:25:49,162 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:25:49,162 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:25:49,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:25:49,162 INFO L82 PathProgramCache]: Analyzing trace with hash -396503741, now seen corresponding path program 1 times [2018-10-26 19:25:49,162 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:25:49,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:25:49,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:49,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:49,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-10-26 19:25:49,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:25:49,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:25:49,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:25:49,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:25:49,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:25:49,962 INFO L87 Difference]: Start difference. First operand 21435 states and 22831 transitions. Second operand 4 states. [2018-10-26 19:25:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:25:52,620 INFO L93 Difference]: Finished difference Result 42267 states and 45053 transitions. [2018-10-26 19:25:52,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:25:52,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 516 [2018-10-26 19:25:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:25:52,648 INFO L225 Difference]: With dead ends: 42267 [2018-10-26 19:25:52,649 INFO L226 Difference]: Without dead ends: 21134 [2018-10-26 19:25:52,663 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-26 19:25:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21134 states. [2018-10-26 19:25:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21134 to 21129. [2018-10-26 19:25:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-10-26 19:25:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 22149 transitions. [2018-10-26 19:25:52,890 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 22149 transitions. Word has length 516 [2018-10-26 19:25:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:25:52,891 INFO L481 AbstractCegarLoop]: Abstraction has 21129 states and 22149 transitions. [2018-10-26 19:25:52,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:25:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 22149 transitions. [2018-10-26 19:25:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-10-26 19:25:52,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:25:52,909 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:25:52,909 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:25:52,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:25:52,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1974630955, now seen corresponding path program 1 times [2018-10-26 19:25:52,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:25:52,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:25:52,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:52,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:52,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2018-10-26 19:25:53,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:25:53,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:25:53,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:25:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:25:53,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:25:53,553 INFO L87 Difference]: Start difference. First operand 21129 states and 22149 transitions. Second operand 3 states. [2018-10-26 19:25:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:25:56,094 INFO L93 Difference]: Finished difference Result 46168 states and 48424 transitions. [2018-10-26 19:25:56,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:25:56,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 603 [2018-10-26 19:25:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:25:56,124 INFO L225 Difference]: With dead ends: 46168 [2018-10-26 19:25:56,125 INFO L226 Difference]: Without dead ends: 26543 [2018-10-26 19:25:56,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:25:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26543 states. [2018-10-26 19:25:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26543 to 25029. [2018-10-26 19:25:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25029 states. [2018-10-26 19:25:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25029 states to 25029 states and 26209 transitions. [2018-10-26 19:25:56,436 INFO L78 Accepts]: Start accepts. Automaton has 25029 states and 26209 transitions. Word has length 603 [2018-10-26 19:25:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:25:56,437 INFO L481 AbstractCegarLoop]: Abstraction has 25029 states and 26209 transitions. [2018-10-26 19:25:56,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:25:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 25029 states and 26209 transitions. [2018-10-26 19:25:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2018-10-26 19:25:56,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:25:56,449 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:25:56,449 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:25:56,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:25:56,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1078882331, now seen corresponding path program 1 times [2018-10-26 19:25:56,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:25:56,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:25:56,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:56,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:25:56,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:25:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:25:57,026 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-10-26 19:25:57,237 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2018-10-26 19:25:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-10-26 19:25:57,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:25:57,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:25:57,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:25:57,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:25:57,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:25:57,469 INFO L87 Difference]: Start difference. First operand 25029 states and 26209 transitions. Second operand 5 states. [2018-10-26 19:26:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:01,915 INFO L93 Difference]: Finished difference Result 46718 states and 48673 transitions. [2018-10-26 19:26:01,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:26:01,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 632 [2018-10-26 19:26:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:01,939 INFO L225 Difference]: With dead ends: 46718 [2018-10-26 19:26:01,939 INFO L226 Difference]: Without dead ends: 22293 [2018-10-26 19:26:01,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:26:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22293 states. [2018-10-26 19:26:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22293 to 20483. [2018-10-26 19:26:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20483 states. [2018-10-26 19:26:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20483 states to 20483 states and 21176 transitions. [2018-10-26 19:26:02,179 INFO L78 Accepts]: Start accepts. Automaton has 20483 states and 21176 transitions. Word has length 632 [2018-10-26 19:26:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:02,180 INFO L481 AbstractCegarLoop]: Abstraction has 20483 states and 21176 transitions. [2018-10-26 19:26:02,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:26:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 20483 states and 21176 transitions. [2018-10-26 19:26:02,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-10-26 19:26:02,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:02,192 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:26:02,192 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:02,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:02,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1817886199, now seen corresponding path program 1 times [2018-10-26 19:26:02,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:02,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:02,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:02,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:02,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:02,866 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 19:26:03,382 WARN L179 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 18 [2018-10-26 19:26:03,736 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 18 [2018-10-26 19:26:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 394 proven. 107 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 19:26:04,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:26:04,772 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-26 19:26:04,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:04,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:26:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 403 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:26:06,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:26:06,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2018-10-26 19:26:06,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 19:26:06,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 19:26:06,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-26 19:26:06,855 INFO L87 Difference]: Start difference. First operand 20483 states and 21176 transitions. Second operand 13 states. [2018-10-26 19:26:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:16,931 INFO L93 Difference]: Finished difference Result 46375 states and 47902 transitions. [2018-10-26 19:26:16,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 19:26:16,931 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 659 [2018-10-26 19:26:16,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:16,955 INFO L225 Difference]: With dead ends: 46375 [2018-10-26 19:26:16,955 INFO L226 Difference]: Without dead ends: 26194 [2018-10-26 19:26:16,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 663 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-10-26 19:26:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26194 states. [2018-10-26 19:26:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26194 to 21983. [2018-10-26 19:26:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21983 states. [2018-10-26 19:26:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21983 states to 21983 states and 22653 transitions. [2018-10-26 19:26:17,243 INFO L78 Accepts]: Start accepts. Automaton has 21983 states and 22653 transitions. Word has length 659 [2018-10-26 19:26:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:17,244 INFO L481 AbstractCegarLoop]: Abstraction has 21983 states and 22653 transitions. [2018-10-26 19:26:17,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 19:26:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 21983 states and 22653 transitions. [2018-10-26 19:26:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2018-10-26 19:26:17,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:17,267 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:26:17,267 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:17,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:17,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1358728392, now seen corresponding path program 1 times [2018-10-26 19:26:17,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:17,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:17,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:17,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-10-26 19:26:18,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:18,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:18,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:18,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:18,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:18,254 INFO L87 Difference]: Start difference. First operand 21983 states and 22653 transitions. Second operand 3 states. [2018-10-26 19:26:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:19,939 INFO L93 Difference]: Finished difference Result 45162 states and 46583 transitions. [2018-10-26 19:26:19,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:19,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 756 [2018-10-26 19:26:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:19,959 INFO L225 Difference]: With dead ends: 45162 [2018-10-26 19:26:19,960 INFO L226 Difference]: Without dead ends: 23481 [2018-10-26 19:26:19,971 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-26 19:26:19,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23481 states. [2018-10-26 19:26:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23481 to 19866. [2018-10-26 19:26:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19866 states. [2018-10-26 19:26:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19866 states to 19866 states and 20452 transitions. [2018-10-26 19:26:20,149 INFO L78 Accepts]: Start accepts. Automaton has 19866 states and 20452 transitions. Word has length 756 [2018-10-26 19:26:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:20,150 INFO L481 AbstractCegarLoop]: Abstraction has 19866 states and 20452 transitions. [2018-10-26 19:26:20,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 19866 states and 20452 transitions. [2018-10-26 19:26:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2018-10-26 19:26:20,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:20,169 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:26:20,169 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:20,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:20,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1442224542, now seen corresponding path program 1 times [2018-10-26 19:26:20,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:20,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:20,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:20,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:20,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 567 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-10-26 19:26:20,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:20,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:26:20,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:26:20,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:26:20,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:26:20,959 INFO L87 Difference]: Start difference. First operand 19866 states and 20452 transitions. Second operand 3 states. [2018-10-26 19:26:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:22,743 INFO L93 Difference]: Finished difference Result 45135 states and 46544 transitions. [2018-10-26 19:26:22,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:26:22,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 836 [2018-10-26 19:26:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:22,766 INFO L225 Difference]: With dead ends: 45135 [2018-10-26 19:26:22,766 INFO L226 Difference]: Without dead ends: 25571 [2018-10-26 19:26:22,777 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-26 19:26:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25571 states. [2018-10-26 19:26:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25571 to 24063. [2018-10-26 19:26:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24063 states. [2018-10-26 19:26:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24063 states to 24063 states and 24767 transitions. [2018-10-26 19:26:22,986 INFO L78 Accepts]: Start accepts. Automaton has 24063 states and 24767 transitions. Word has length 836 [2018-10-26 19:26:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:22,987 INFO L481 AbstractCegarLoop]: Abstraction has 24063 states and 24767 transitions. [2018-10-26 19:26:22,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:26:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 24063 states and 24767 transitions. [2018-10-26 19:26:23,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2018-10-26 19:26:23,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:23,001 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:26:23,001 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:23,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:23,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1062297915, now seen corresponding path program 1 times [2018-10-26 19:26:23,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:23,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:23,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:23,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:23,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:23,723 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 3 [2018-10-26 19:26:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 467 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-10-26 19:26:24,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:24,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:26:24,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:26:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:26:24,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:26:24,003 INFO L87 Difference]: Start difference. First operand 24063 states and 24767 transitions. Second operand 4 states. [2018-10-26 19:26:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:26,660 INFO L93 Difference]: Finished difference Result 53546 states and 55126 transitions. [2018-10-26 19:26:26,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:26:26,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 839 [2018-10-26 19:26:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:26,687 INFO L225 Difference]: With dead ends: 53546 [2018-10-26 19:26:26,687 INFO L226 Difference]: Without dead ends: 29785 [2018-10-26 19:26:26,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:26:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29785 states. [2018-10-26 19:26:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29785 to 24963. [2018-10-26 19:26:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24963 states. [2018-10-26 19:26:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24963 states to 24963 states and 25652 transitions. [2018-10-26 19:26:26,928 INFO L78 Accepts]: Start accepts. Automaton has 24963 states and 25652 transitions. Word has length 839 [2018-10-26 19:26:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:26,929 INFO L481 AbstractCegarLoop]: Abstraction has 24963 states and 25652 transitions. [2018-10-26 19:26:26,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:26:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 24963 states and 25652 transitions. [2018-10-26 19:26:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2018-10-26 19:26:26,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:26,947 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:26:26,947 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:26,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:26,948 INFO L82 PathProgramCache]: Analyzing trace with hash 420395429, now seen corresponding path program 1 times [2018-10-26 19:26:26,948 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:26,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:26,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:26,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:26,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:27,651 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-10-26 19:26:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-10-26 19:26:28,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:26:28,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:26:28,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:26:28,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:26:28,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:26:28,422 INFO L87 Difference]: Start difference. First operand 24963 states and 25652 transitions. Second operand 4 states. [2018-10-26 19:26:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:26:30,638 INFO L93 Difference]: Finished difference Result 51122 states and 52538 transitions. [2018-10-26 19:26:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:26:30,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 840 [2018-10-26 19:26:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:26:30,662 INFO L225 Difference]: With dead ends: 51122 [2018-10-26 19:26:30,662 INFO L226 Difference]: Without dead ends: 26461 [2018-10-26 19:26:30,674 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-26 19:26:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26461 states. [2018-10-26 19:26:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26461 to 24659. [2018-10-26 19:26:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24659 states. [2018-10-26 19:26:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24659 states to 24659 states and 25252 transitions. [2018-10-26 19:26:30,915 INFO L78 Accepts]: Start accepts. Automaton has 24659 states and 25252 transitions. Word has length 840 [2018-10-26 19:26:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:26:30,916 INFO L481 AbstractCegarLoop]: Abstraction has 24659 states and 25252 transitions. [2018-10-26 19:26:30,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:26:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 24659 states and 25252 transitions. [2018-10-26 19:26:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2018-10-26 19:26:30,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:26:30,930 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:26:30,930 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:26:30,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:26:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash -466159340, now seen corresponding path program 1 times [2018-10-26 19:26:30,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:26:30,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:26:30,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:30,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:30,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:26:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:31,612 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 19:26:32,233 WARN L179 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-10-26 19:26:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 748 proven. 136 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-26 19:26:33,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:26:33,235 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-26 19:26:33,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:26:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:26:33,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:27:03,838 WARN L179 SmtUtils]: Spent 30.07 s on a formula simplification. DAG size of input: 445 DAG size of output: 50 [2018-10-26 19:27:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-10-26 19:27:06,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:27:06,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2018-10-26 19:27:06,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 19:27:06,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 19:27:06,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:27:06,109 INFO L87 Difference]: Start difference. First operand 24659 states and 25252 transitions. Second operand 10 states. [2018-10-26 19:27:20,532 WARN L179 SmtUtils]: Spent 12.70 s on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2018-10-26 19:27:35,928 WARN L179 SmtUtils]: Spent 15.18 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-10-26 19:28:07,488 WARN L179 SmtUtils]: Spent 24.94 s on a formula simplification. DAG size of input: 69 DAG size of output: 54 Received shutdown request... [2018-10-26 19:28:25,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 19:28:25,595 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 19:28:25,602 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 19:28:25,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:28:25 BoogieIcfgContainer [2018-10-26 19:28:25,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:28:25,605 INFO L168 Benchmark]: Toolchain (without parser) took 244029.12 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 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 513.9 MB. Max. memory is 7.1 GB. [2018-10-26 19:28:25,606 INFO L168 Benchmark]: CDTParser took 0.24 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-26 19:28:25,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1215.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:28:25,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 401.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -864.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 7.1 GB. [2018-10-26 19:28:25,612 INFO L168 Benchmark]: Boogie Preprocessor took 213.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:28:25,621 INFO L168 Benchmark]: RCFGBuilder took 6336.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 298.2 MB). Peak memory consumption was 298.2 MB. Max. memory is 7.1 GB. [2018-10-26 19:28:25,622 INFO L168 Benchmark]: TraceAbstraction took 235856.19 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 3.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 193.3 MB. Max. memory is 7.1 GB. [2018-10-26 19:28:25,629 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.24 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 1215.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 401.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -864.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 213.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6336.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 298.2 MB). Peak memory consumption was 298.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 235856.19 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 3.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 193.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 40]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 40). Cancelled while BasicCegarLoop was constructing difference of abstraction (24659states) and FLOYD_HOARE automaton (currently 10 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2218 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. TIMEOUT Result, 235.7s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 178.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3926 SDtfs, 16216 SDslu, 2291 SDs, 0 SdLazy, 38534 SolverSat, 5787 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 110.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2470 GetRequests, 2378 SyntacticMatches, 21 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 91.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25029occurred 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: 3.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 26229 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 46.1s InterpolantComputationTime, 10719 NumberOfCodeBlocks, 10719 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 10697 ConstructedInterpolants, 289 QuantifiedInterpolants, 32965109 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2856 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 9623/10058 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown