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/Problem13_label54_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:16:53,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:16:53,358 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:16:53,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:16:53,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:16:53,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:16:53,378 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:16:53,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:16:53,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:16:53,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:16:53,384 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:16:53,384 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:16:53,385 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:16:53,386 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:16:53,387 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:16:53,388 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:16:53,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:16:53,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:16:53,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:16:53,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:16:53,396 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:16:53,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:16:53,400 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:16:53,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:16:53,401 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:16:53,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:16:53,403 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:16:53,404 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:16:53,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:16:53,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:16:53,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:16:53,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:16:53,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:16:53,407 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:16:53,408 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:16:53,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:16:53,409 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:16:53,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:16:53,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:16:53,425 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:16:53,426 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:16:53,426 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:16:53,426 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:16:53,427 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:16:53,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:16:53,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:16:53,427 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:16:53,428 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:16:53,428 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:16:53,428 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:16:53,428 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:16:53,428 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:16:53,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:16:53,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:16:53,429 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:16:53,429 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:16:53,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:16:53,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:16:53,430 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:16:53,430 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:16:53,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:16:53,430 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:16:53,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:16:53,431 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:16:53,431 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:16:53,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:16:53,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:16:53,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:16:53,496 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:16:53,496 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:16:53,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label54_false-unreach-call.c [2018-10-26 19:16:53,555 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f919e1d68/eacc8fa70cf141a889c6d5a9cba446c4/FLAG9626f726d [2018-10-26 19:16:54,430 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:16:54,431 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label54_false-unreach-call.c [2018-10-26 19:16:54,464 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f919e1d68/eacc8fa70cf141a889c6d5a9cba446c4/FLAG9626f726d [2018-10-26 19:16:54,481 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f919e1d68/eacc8fa70cf141a889c6d5a9cba446c4 [2018-10-26 19:16:54,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:16:54,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:16:54,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:16:54,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:16:54,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:16:54,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:16:54" (1/1) ... [2018-10-26 19:16:54,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ebb76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:16:54, skipping insertion in model container [2018-10-26 19:16:54,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:16:54" (1/1) ... [2018-10-26 19:16:54,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:16:54,701 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:16:56,297 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:16:56,301 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:16:57,102 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:16:57,151 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:16:57,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:16:57 WrapperNode [2018-10-26 19:16:57,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:16:57,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:16:57,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:16:57,154 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:16:57,168 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:16:57" (1/1) ... [2018-10-26 19:16:57,250 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:16:57" (1/1) ... [2018-10-26 19:16:58,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:16:58,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:16:58,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:16:58,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:16:58,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:16:57" (1/1) ... [2018-10-26 19:16:58,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:16:57" (1/1) ... [2018-10-26 19:16:58,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:16:57" (1/1) ... [2018-10-26 19:16:58,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:16:57" (1/1) ... [2018-10-26 19:16:58,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:16:57" (1/1) ... [2018-10-26 19:16:58,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:16:57" (1/1) ... [2018-10-26 19:16:58,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:16:57" (1/1) ... [2018-10-26 19:16:58,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:16:58,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:16:58,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:16:58,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:16:58,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:16:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:16:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:16:58,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:16:58,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:17:12,112 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:17:12,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:17:12 BoogieIcfgContainer [2018-10-26 19:17:12,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:17:12,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:17:12,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:17:12,118 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:17:12,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:16:54" (1/3) ... [2018-10-26 19:17:12,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a00226c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:17:12, skipping insertion in model container [2018-10-26 19:17:12,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:16:57" (2/3) ... [2018-10-26 19:17:12,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a00226c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:17:12, skipping insertion in model container [2018-10-26 19:17:12,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:17:12" (3/3) ... [2018-10-26 19:17:12,124 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label54_false-unreach-call.c [2018-10-26 19:17:12,135 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:17:12,146 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:17:12,166 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:17:12,214 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:17:12,215 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:17:12,215 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:17:12,216 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:17:12,216 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:17:12,216 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:17:12,216 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:17:12,216 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:17:12,216 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:17:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-26 19:17:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:17:12,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:17:12,274 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:17:12,278 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:17:12,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:17:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1880720510, now seen corresponding path program 1 times [2018-10-26 19:17:12,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:17:12,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:17:12,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:17:12,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:17:12,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:17:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:17:12,713 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 19:17:12,728 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:17:12,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:17:12,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:17:12,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:17:12,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:17:12,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:17:12,761 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-10-26 19:17:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:17:27,200 INFO L93 Difference]: Finished difference Result 3973 states and 7416 transitions. [2018-10-26 19:17:27,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:17:27,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-26 19:17:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:17:27,253 INFO L225 Difference]: With dead ends: 3973 [2018-10-26 19:17:27,253 INFO L226 Difference]: Without dead ends: 2867 [2018-10-26 19:17:27,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:17:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2018-10-26 19:17:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1938. [2018-10-26 19:17:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2018-10-26 19:17:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 3240 transitions. [2018-10-26 19:17:27,435 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 3240 transitions. Word has length 28 [2018-10-26 19:17:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:17:27,435 INFO L481 AbstractCegarLoop]: Abstraction has 1938 states and 3240 transitions. [2018-10-26 19:17:27,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:17:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 3240 transitions. [2018-10-26 19:17:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 19:17:27,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:17:27,442 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:17:27,443 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:17:27,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:17:27,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1373493925, now seen corresponding path program 1 times [2018-10-26 19:17:27,443 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:17:27,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:17:27,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:17:27,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:17:27,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:17:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:17:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:17:27,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:17:27,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:17:27,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:17:27,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:17:27,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:17:27,728 INFO L87 Difference]: Start difference. First operand 1938 states and 3240 transitions. Second operand 4 states. [2018-10-26 19:17:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:17:42,495 INFO L93 Difference]: Finished difference Result 7101 states and 12101 transitions. [2018-10-26 19:17:42,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:17:42,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-26 19:17:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:17:42,524 INFO L225 Difference]: With dead ends: 7101 [2018-10-26 19:17:42,524 INFO L226 Difference]: Without dead ends: 5165 [2018-10-26 19:17:42,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:17:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2018-10-26 19:17:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 3540. [2018-10-26 19:17:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3540 states. [2018-10-26 19:17:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 5445 transitions. [2018-10-26 19:17:42,612 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 5445 transitions. Word has length 100 [2018-10-26 19:17:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:17:42,613 INFO L481 AbstractCegarLoop]: Abstraction has 3540 states and 5445 transitions. [2018-10-26 19:17:42,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:17:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 5445 transitions. [2018-10-26 19:17:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-26 19:17:42,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:17:42,618 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:17:42,618 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:17:42,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:17:42,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1648295608, now seen corresponding path program 1 times [2018-10-26 19:17:42,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:17:42,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:17:42,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:17:42,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:17:42,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:17:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:17:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:17:42,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:17:42,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:17:42,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:17:42,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:17:42,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:17:42,779 INFO L87 Difference]: Start difference. First operand 3540 states and 5445 transitions. Second operand 4 states. [2018-10-26 19:17:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:17:57,437 INFO L93 Difference]: Finished difference Result 13554 states and 21081 transitions. [2018-10-26 19:17:57,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:17:57,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-10-26 19:17:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:17:57,482 INFO L225 Difference]: With dead ends: 13554 [2018-10-26 19:17:57,482 INFO L226 Difference]: Without dead ends: 10016 [2018-10-26 19:17:57,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:17:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10016 states. [2018-10-26 19:17:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10016 to 6718. [2018-10-26 19:17:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6718 states. [2018-10-26 19:17:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 9885 transitions. [2018-10-26 19:17:57,636 INFO L78 Accepts]: Start accepts. Automaton has 6718 states and 9885 transitions. Word has length 114 [2018-10-26 19:17:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:17:57,636 INFO L481 AbstractCegarLoop]: Abstraction has 6718 states and 9885 transitions. [2018-10-26 19:17:57,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:17:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 6718 states and 9885 transitions. [2018-10-26 19:17:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 19:17:57,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:17:57,647 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:17:57,648 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:17:57,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:17:57,649 INFO L82 PathProgramCache]: Analyzing trace with hash -394755061, now seen corresponding path program 1 times [2018-10-26 19:17:57,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:17:57,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:17:57,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:17:57,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:17:57,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:17:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:17:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:17:58,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:17:58,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:17:58,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:17:58,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:17:58,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:17:58,022 INFO L87 Difference]: Start difference. First operand 6718 states and 9885 transitions. Second operand 4 states. [2018-10-26 19:18:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:12,547 INFO L93 Difference]: Finished difference Result 23854 states and 35012 transitions. [2018-10-26 19:18:12,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:18:12,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-10-26 19:18:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:12,611 INFO L225 Difference]: With dead ends: 23854 [2018-10-26 19:18:12,611 INFO L226 Difference]: Without dead ends: 17138 [2018-10-26 19:18:12,622 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:18:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17138 states. [2018-10-26 19:18:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17138 to 13037. [2018-10-26 19:18:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13037 states. [2018-10-26 19:18:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13037 states to 13037 states and 18976 transitions. [2018-10-26 19:18:12,849 INFO L78 Accepts]: Start accepts. Automaton has 13037 states and 18976 transitions. Word has length 132 [2018-10-26 19:18:12,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:12,850 INFO L481 AbstractCegarLoop]: Abstraction has 13037 states and 18976 transitions. [2018-10-26 19:18:12,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:18:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 13037 states and 18976 transitions. [2018-10-26 19:18:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-26 19:18:12,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:12,855 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:12,855 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:12,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:12,855 INFO L82 PathProgramCache]: Analyzing trace with hash -83044117, now seen corresponding path program 1 times [2018-10-26 19:18:12,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:12,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:12,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:12,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:18:13,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:18:13,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:18:13,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:18:13,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:18:13,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:18:13,182 INFO L87 Difference]: Start difference. First operand 13037 states and 18976 transitions. Second operand 4 states. [2018-10-26 19:18:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:24,029 INFO L93 Difference]: Finished difference Result 51334 states and 74903 transitions. [2018-10-26 19:18:24,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:18:24,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-10-26 19:18:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:24,144 INFO L225 Difference]: With dead ends: 51334 [2018-10-26 19:18:24,144 INFO L226 Difference]: Without dead ends: 38299 [2018-10-26 19:18:24,174 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:18:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38299 states. [2018-10-26 19:18:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38299 to 38259. [2018-10-26 19:18:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38259 states. [2018-10-26 19:18:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38259 states to 38259 states and 50689 transitions. [2018-10-26 19:18:24,821 INFO L78 Accepts]: Start accepts. Automaton has 38259 states and 50689 transitions. Word has length 162 [2018-10-26 19:18:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:24,822 INFO L481 AbstractCegarLoop]: Abstraction has 38259 states and 50689 transitions. [2018-10-26 19:18:24,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:18:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 38259 states and 50689 transitions. [2018-10-26 19:18:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-26 19:18:24,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:24,827 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:24,828 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:24,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:24,828 INFO L82 PathProgramCache]: Analyzing trace with hash 821999137, now seen corresponding path program 1 times [2018-10-26 19:18:24,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:24,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:24,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:24,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:24,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:18:25,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:18:25,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:18:25,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:18:25,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:18:25,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:18:25,179 INFO L87 Difference]: Start difference. First operand 38259 states and 50689 transitions. Second operand 4 states. [2018-10-26 19:18:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:37,563 INFO L93 Difference]: Finished difference Result 130933 states and 171774 transitions. [2018-10-26 19:18:37,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:18:37,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-10-26 19:18:37,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:37,736 INFO L225 Difference]: With dead ends: 130933 [2018-10-26 19:18:37,736 INFO L226 Difference]: Without dead ends: 92676 [2018-10-26 19:18:37,803 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:18:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92676 states. [2018-10-26 19:18:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92676 to 72143. [2018-10-26 19:18:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72143 states. [2018-10-26 19:18:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72143 states to 72143 states and 90430 transitions. [2018-10-26 19:18:39,359 INFO L78 Accepts]: Start accepts. Automaton has 72143 states and 90430 transitions. Word has length 166 [2018-10-26 19:18:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:39,359 INFO L481 AbstractCegarLoop]: Abstraction has 72143 states and 90430 transitions. [2018-10-26 19:18:39,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:18:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 72143 states and 90430 transitions. [2018-10-26 19:18:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-26 19:18:39,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:39,367 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:39,367 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:39,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash 259007377, now seen corresponding path program 1 times [2018-10-26 19:18:39,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:39,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:39,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:39,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:39,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-26 19:18:39,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:18:39,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:18:39,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:18:39,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:18:39,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:18:39,638 INFO L87 Difference]: Start difference. First operand 72143 states and 90430 transitions. Second operand 3 states. [2018-10-26 19:18:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:18:46,268 INFO L93 Difference]: Finished difference Result 201016 states and 251696 transitions. [2018-10-26 19:18:46,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:18:46,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2018-10-26 19:18:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:18:46,444 INFO L225 Difference]: With dead ends: 201016 [2018-10-26 19:18:46,444 INFO L226 Difference]: Without dead ends: 128875 [2018-10-26 19:18:46,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:18:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128875 states. [2018-10-26 19:18:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128875 to 128084. [2018-10-26 19:18:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128084 states. [2018-10-26 19:18:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128084 states to 128084 states and 150897 transitions. [2018-10-26 19:18:48,548 INFO L78 Accepts]: Start accepts. Automaton has 128084 states and 150897 transitions. Word has length 260 [2018-10-26 19:18:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:18:48,549 INFO L481 AbstractCegarLoop]: Abstraction has 128084 states and 150897 transitions. [2018-10-26 19:18:48,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:18:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 128084 states and 150897 transitions. [2018-10-26 19:18:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-26 19:18:48,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:18:48,555 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:18:48,556 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:18:48,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:18:48,556 INFO L82 PathProgramCache]: Analyzing trace with hash -638506597, now seen corresponding path program 1 times [2018-10-26 19:18:48,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:18:48,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:18:48,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:48,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:18:48,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:18:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:18:48,793 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-26 19:18:49,065 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-26 19:18:49,485 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-10-26 19:18:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 19:18:49,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:18:49,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:18:49,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:18:49,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:18:49,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:18:49,587 INFO L87 Difference]: Start difference. First operand 128084 states and 150897 transitions. Second operand 5 states. [2018-10-26 19:19:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:19:04,044 INFO L93 Difference]: Finished difference Result 268007 states and 314360 transitions. [2018-10-26 19:19:04,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:19:04,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2018-10-26 19:19:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:19:04,244 INFO L225 Difference]: With dead ends: 268007 [2018-10-26 19:19:04,245 INFO L226 Difference]: Without dead ends: 139925 [2018-10-26 19:19:04,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 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:19:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139925 states. [2018-10-26 19:19:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139925 to 138328. [2018-10-26 19:19:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138328 states. [2018-10-26 19:19:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138328 states to 138328 states and 161451 transitions. [2018-10-26 19:19:05,562 INFO L78 Accepts]: Start accepts. Automaton has 138328 states and 161451 transitions. Word has length 264 [2018-10-26 19:19:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:19:05,562 INFO L481 AbstractCegarLoop]: Abstraction has 138328 states and 161451 transitions. [2018-10-26 19:19:05,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:19:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 138328 states and 161451 transitions. [2018-10-26 19:19:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-26 19:19:05,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:19:05,573 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:19:05,573 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:19:05,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:19:05,573 INFO L82 PathProgramCache]: Analyzing trace with hash -604590294, now seen corresponding path program 1 times [2018-10-26 19:19:05,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:19:05,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:19:05,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:19:05,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:19:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:19:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:19:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 19:19:05,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:19:05,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:19:05,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:19:05,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:19:05,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:19:05,888 INFO L87 Difference]: Start difference. First operand 138328 states and 161451 transitions. Second operand 5 states. [2018-10-26 19:19:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:19:32,957 INFO L93 Difference]: Finished difference Result 362067 states and 425536 transitions. [2018-10-26 19:19:32,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:19:32,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 328 [2018-10-26 19:19:32,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:19:33,224 INFO L225 Difference]: With dead ends: 362067 [2018-10-26 19:19:33,224 INFO L226 Difference]: Without dead ends: 224529 [2018-10-26 19:19:33,333 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:19:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224529 states. [2018-10-26 19:19:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224529 to 214864. [2018-10-26 19:19:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214864 states. [2018-10-26 19:19:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214864 states to 214864 states and 249636 transitions. [2018-10-26 19:19:36,754 INFO L78 Accepts]: Start accepts. Automaton has 214864 states and 249636 transitions. Word has length 328 [2018-10-26 19:19:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:19:36,755 INFO L481 AbstractCegarLoop]: Abstraction has 214864 states and 249636 transitions. [2018-10-26 19:19:36,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:19:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 214864 states and 249636 transitions. [2018-10-26 19:19:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-26 19:19:36,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:19:36,764 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:19:36,764 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:19:36,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:19:36,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1490097149, now seen corresponding path program 1 times [2018-10-26 19:19:36,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:19:36,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:19:36,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:19:36,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:19:36,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:19:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:19:37,145 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 19:19:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2018-10-26 19:19:38,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:19:38,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:19:38,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:19:38,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:19:38,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:19:38,995 INFO L87 Difference]: Start difference. First operand 214864 states and 249636 transitions. Second operand 4 states. [2018-10-26 19:19:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:19:54,699 INFO L93 Difference]: Finished difference Result 528281 states and 614630 transitions. [2018-10-26 19:19:54,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:19:54,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2018-10-26 19:19:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:19:55,203 INFO L225 Difference]: With dead ends: 528281 [2018-10-26 19:19:55,203 INFO L226 Difference]: Without dead ends: 314207 [2018-10-26 19:19:55,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:19:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314207 states. [2018-10-26 19:20:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314207 to 310213. [2018-10-26 19:20:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310213 states. [2018-10-26 19:20:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310213 states to 310213 states and 351116 transitions. [2018-10-26 19:20:05,878 INFO L78 Accepts]: Start accepts. Automaton has 310213 states and 351116 transitions. Word has length 361 [2018-10-26 19:20:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:20:05,878 INFO L481 AbstractCegarLoop]: Abstraction has 310213 states and 351116 transitions. [2018-10-26 19:20:05,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:20:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 310213 states and 351116 transitions. [2018-10-26 19:20:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-26 19:20:05,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:20:05,890 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:20:05,890 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:20:05,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:20:05,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1077182117, now seen corresponding path program 1 times [2018-10-26 19:20:05,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:20:05,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:20:05,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:20:05,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:20:05,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:20:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:20:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 19:20:07,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:20:07,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:20:07,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:20:07,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:20:07,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:20:07,053 INFO L87 Difference]: Start difference. First operand 310213 states and 351116 transitions. Second operand 4 states. [2018-10-26 19:20:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:20:19,026 INFO L93 Difference]: Finished difference Result 633031 states and 715879 transitions. [2018-10-26 19:20:19,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:20:19,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2018-10-26 19:20:19,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:20:19,331 INFO L225 Difference]: With dead ends: 633031 [2018-10-26 19:20:19,331 INFO L226 Difference]: Without dead ends: 282564 [2018-10-26 19:20:20,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:20:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282564 states. [2018-10-26 19:20:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282564 to 266802. [2018-10-26 19:20:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266802 states. [2018-10-26 19:20:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266802 states to 266802 states and 297639 transitions. [2018-10-26 19:20:22,954 INFO L78 Accepts]: Start accepts. Automaton has 266802 states and 297639 transitions. Word has length 409 [2018-10-26 19:20:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:20:22,954 INFO L481 AbstractCegarLoop]: Abstraction has 266802 states and 297639 transitions. [2018-10-26 19:20:22,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:20:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 266802 states and 297639 transitions. [2018-10-26 19:20:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-26 19:20:22,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:20:22,964 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:20:22,964 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:20:22,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:20:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1814472154, now seen corresponding path program 1 times [2018-10-26 19:20:22,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:20:22,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:20:22,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:20:22,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:20:22,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:20:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:20:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 431 proven. 5 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2018-10-26 19:20:24,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:20:24,021 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:20:24,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:20:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:20:24,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:20:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-10-26 19:20:24,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:20:24,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-26 19:20:24,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:20:24,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:20:24,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:20:24,493 INFO L87 Difference]: Start difference. First operand 266802 states and 297639 transitions. Second operand 5 states. Received shutdown request... [2018-10-26 19:20:38,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:20:38,993 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 19:20:38,999 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 19:20:39,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:20:38 BoogieIcfgContainer [2018-10-26 19:20:39,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:20:39,001 INFO L168 Benchmark]: Toolchain (without parser) took 224508.23 ms. Allocated memory was 1.5 GB in the beginning and 4.6 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -969.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-26 19:20:39,002 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 19:20:39,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2658.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:20:39,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 919.46 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 832.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:20:39,004 INFO L168 Benchmark]: Boogie Preprocessor took 459.77 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 69.0 MB). Peak memory consumption was 69.0 MB. Max. memory is 7.1 GB. [2018-10-26 19:20:39,005 INFO L168 Benchmark]: RCFGBuilder took 13579.11 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 247.5 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 30.2 MB). Peak memory consumption was 599.6 MB. Max. memory is 7.1 GB. [2018-10-26 19:20:39,006 INFO L168 Benchmark]: TraceAbstraction took 206885.50 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -292.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-26 19:20:39,012 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2658.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 919.46 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 832.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 459.77 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 69.0 MB). Peak memory consumption was 69.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13579.11 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 247.5 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 30.2 MB). Peak memory consumption was 599.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 206885.50 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -292.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 93). Cancelled while BasicCegarLoop was constructing difference of abstraction (266802states) and FLOYD_HOARE automaton (currently 4 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (420199 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 206.7s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 175.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10765 SDtfs, 24882 SDslu, 3699 SDs, 0 SdLazy, 63437 SolverSat, 14012 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 141.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 479 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310213occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 22.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 62335 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 3256 NumberOfCodeBlocks, 3256 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3243 ConstructedInterpolants, 0 QuantifiedInterpolants, 2422465 SizeOfPredicates, 1 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 3716/3721 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown