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/Problem03_label05_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:53:42,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:53:42,419 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:53:42,439 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:53:42,439 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:53:42,440 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:53:42,442 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:53:42,443 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:53:42,445 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:53:42,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:53:42,447 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:53:42,447 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:53:42,448 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:53:42,449 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:53:42,450 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:53:42,451 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:53:42,452 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:53:42,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:53:42,456 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:53:42,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:53:42,459 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:53:42,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:53:42,463 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:53:42,464 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:53:42,464 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:53:42,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:53:42,468 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:53:42,471 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:53:42,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:53:42,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:53:42,477 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:53:42,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:53:42,478 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:53:42,480 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:53:42,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:53:42,482 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:53:42,482 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:53:42,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:53:42,509 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:53:42,510 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:53:42,510 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:53:42,514 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:53:42,514 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:53:42,515 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:53:42,515 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:53:42,515 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:53:42,515 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:53:42,515 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:53:42,516 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:53:42,516 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:53:42,516 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:53:42,516 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:53:42,516 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:53:42,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:53:42,518 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:53:42,518 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:53:42,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:42,519 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:53:42,519 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:53:42,519 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:53:42,519 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:53:42,520 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:53:42,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:53:42,520 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:53:42,520 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:53:42,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:53:42,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:53:42,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:53:42,601 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:53:42,602 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:53:42,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label05_true-unreach-call.c [2018-10-24 14:53:42,662 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8366fb8e5/2f53cf33311448a39150ae717147139e/FLAG077251cb7 [2018-10-24 14:53:43,324 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:53:43,325 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label05_true-unreach-call.c [2018-10-24 14:53:43,351 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8366fb8e5/2f53cf33311448a39150ae717147139e/FLAG077251cb7 [2018-10-24 14:53:43,373 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8366fb8e5/2f53cf33311448a39150ae717147139e [2018-10-24 14:53:43,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:53:43,387 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:53:43,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:43,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:53:43,394 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:53:43,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:43" (1/1) ... [2018-10-24 14:53:43,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cab73e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:43, skipping insertion in model container [2018-10-24 14:53:43,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:43" (1/1) ... [2018-10-24 14:53:43,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:53:43,516 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:53:44,208 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:44,213 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:53:44,527 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:44,556 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:53:44,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44 WrapperNode [2018-10-24 14:53:44,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:44,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:44,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:53:44,558 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:53:44,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44" (1/1) ... [2018-10-24 14:53:44,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44" (1/1) ... [2018-10-24 14:53:44,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:44,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:53:44,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:53:44,878 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:53:44,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44" (1/1) ... [2018-10-24 14:53:44,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44" (1/1) ... [2018-10-24 14:53:44,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44" (1/1) ... [2018-10-24 14:53:44,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44" (1/1) ... [2018-10-24 14:53:44,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44" (1/1) ... [2018-10-24 14:53:44,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44" (1/1) ... [2018-10-24 14:53:44,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44" (1/1) ... [2018-10-24 14:53:45,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:53:45,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:53:45,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:53:45,001 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:53:45,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:45,069 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:53:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:53:45,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:53:50,318 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:53:50,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:50 BoogieIcfgContainer [2018-10-24 14:53:50,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:53:50,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:53:50,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:53:50,324 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:53:50,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:53:43" (1/3) ... [2018-10-24 14:53:50,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ff4ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:50, skipping insertion in model container [2018-10-24 14:53:50,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:44" (2/3) ... [2018-10-24 14:53:50,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ff4ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:50, skipping insertion in model container [2018-10-24 14:53:50,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:50" (3/3) ... [2018-10-24 14:53:50,328 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label05_true-unreach-call.c [2018-10-24 14:53:50,339 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:53:50,349 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:53:50,367 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:53:50,405 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:53:50,406 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:53:50,406 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:53:50,406 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:53:50,407 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:53:50,407 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:53:50,407 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:53:50,407 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:53:50,407 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:53:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:53:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-24 14:53:50,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:50,454 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:50,457 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:50,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:50,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1384220858, now seen corresponding path program 1 times [2018-10-24 14:53:50,464 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:50,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:50,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:53:51,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:51,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:51,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:53:51,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:53:51,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:51,615 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:53:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:54,939 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-24 14:53:54,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:53:54,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-10-24 14:53:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:54,967 INFO L225 Difference]: With dead ends: 1075 [2018-10-24 14:53:54,967 INFO L226 Difference]: Without dead ends: 765 [2018-10-24 14:53:54,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:54,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-24 14:53:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-24 14:53:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-24 14:53:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-24 14:53:55,054 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 159 [2018-10-24 14:53:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:55,055 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-24 14:53:55,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:53:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-24 14:53:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-24 14:53:55,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:55,061 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:53:55,061 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:55,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:55,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1142249947, now seen corresponding path program 1 times [2018-10-24 14:53:55,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:55,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:55,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:55,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:55,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:53:55,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:55,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:55,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:55,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:55,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:55,205 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-24 14:53:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:57,268 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-24 14:53:57,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:57,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-10-24 14:53:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:57,275 INFO L225 Difference]: With dead ends: 1465 [2018-10-24 14:53:57,275 INFO L226 Difference]: Without dead ends: 947 [2018-10-24 14:53:57,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-24 14:53:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-24 14:53:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-24 14:53:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-24 14:53:57,350 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 168 [2018-10-24 14:53:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:57,350 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-24 14:53:57,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-24 14:53:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-24 14:53:57,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:57,364 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:53:57,364 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:57,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:57,365 INFO L82 PathProgramCache]: Analyzing trace with hash -721058890, now seen corresponding path program 1 times [2018-10-24 14:53:57,365 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:57,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:57,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:57,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 14:53:57,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:57,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:57,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:57,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:57,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:57,521 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-24 14:54:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:00,405 INFO L93 Difference]: Finished difference Result 2774 states and 4502 transitions. [2018-10-24 14:54:00,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:00,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-24 14:54:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:00,417 INFO L225 Difference]: With dead ends: 2774 [2018-10-24 14:54:00,417 INFO L226 Difference]: Without dead ends: 1845 [2018-10-24 14:54:00,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2018-10-24 14:54:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1841. [2018-10-24 14:54:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1841 states. [2018-10-24 14:54:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2985 transitions. [2018-10-24 14:54:00,474 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2985 transitions. Word has length 182 [2018-10-24 14:54:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:00,475 INFO L481 AbstractCegarLoop]: Abstraction has 1841 states and 2985 transitions. [2018-10-24 14:54:00,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2985 transitions. [2018-10-24 14:54:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-24 14:54:00,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:00,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:00,482 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:00,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2043591850, now seen corresponding path program 1 times [2018-10-24 14:54:00,485 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:00,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:00,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:00,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:00,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:00,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:00,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:00,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:00,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:00,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:00,813 INFO L87 Difference]: Start difference. First operand 1841 states and 2985 transitions. Second operand 4 states. [2018-10-24 14:54:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:03,658 INFO L93 Difference]: Finished difference Result 7028 states and 11557 transitions. [2018-10-24 14:54:03,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:03,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-10-24 14:54:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:03,687 INFO L225 Difference]: With dead ends: 7028 [2018-10-24 14:54:03,687 INFO L226 Difference]: Without dead ends: 5189 [2018-10-24 14:54:03,692 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-24 14:54:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2018-10-24 14:54:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 3481. [2018-10-24 14:54:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3481 states. [2018-10-24 14:54:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 5332 transitions. [2018-10-24 14:54:03,799 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 5332 transitions. Word has length 183 [2018-10-24 14:54:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:03,799 INFO L481 AbstractCegarLoop]: Abstraction has 3481 states and 5332 transitions. [2018-10-24 14:54:03,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:03,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 5332 transitions. [2018-10-24 14:54:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-24 14:54:03,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:03,807 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-10-24 14:54:03,807 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:03,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:03,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1105939895, now seen corresponding path program 1 times [2018-10-24 14:54:03,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:03,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:03,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:03,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:03,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:54:04,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:04,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:04,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:04,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:04,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:04,036 INFO L87 Difference]: Start difference. First operand 3481 states and 5332 transitions. Second operand 3 states. [2018-10-24 14:54:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:04,836 INFO L93 Difference]: Finished difference Result 6910 states and 10594 transitions. [2018-10-24 14:54:04,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:04,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-24 14:54:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:04,851 INFO L225 Difference]: With dead ends: 6910 [2018-10-24 14:54:04,851 INFO L226 Difference]: Without dead ends: 3431 [2018-10-24 14:54:04,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2018-10-24 14:54:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3431. [2018-10-24 14:54:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3431 states. [2018-10-24 14:54:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 5172 transitions. [2018-10-24 14:54:04,928 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 5172 transitions. Word has length 197 [2018-10-24 14:54:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:04,928 INFO L481 AbstractCegarLoop]: Abstraction has 3431 states and 5172 transitions. [2018-10-24 14:54:04,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 5172 transitions. [2018-10-24 14:54:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-24 14:54:04,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:04,934 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:04,935 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:04,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash 184830782, now seen corresponding path program 1 times [2018-10-24 14:54:04,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:04,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:04,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:04,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:04,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:05,453 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:54:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:05,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:05,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:05,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:05,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:05,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:05,488 INFO L87 Difference]: Start difference. First operand 3431 states and 5172 transitions. Second operand 5 states. [2018-10-24 14:54:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:10,039 INFO L93 Difference]: Finished difference Result 8133 states and 12410 transitions. [2018-10-24 14:54:10,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:54:10,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2018-10-24 14:54:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:10,059 INFO L225 Difference]: With dead ends: 8133 [2018-10-24 14:54:10,059 INFO L226 Difference]: Without dead ends: 4704 [2018-10-24 14:54:10,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2018-10-24 14:54:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 3839. [2018-10-24 14:54:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3839 states. [2018-10-24 14:54:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 5746 transitions. [2018-10-24 14:54:10,144 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 5746 transitions. Word has length 199 [2018-10-24 14:54:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:10,145 INFO L481 AbstractCegarLoop]: Abstraction has 3839 states and 5746 transitions. [2018-10-24 14:54:10,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 5746 transitions. [2018-10-24 14:54:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-24 14:54:10,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:10,154 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-10-24 14:54:10,154 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:10,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:10,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1707350819, now seen corresponding path program 1 times [2018-10-24 14:54:10,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:10,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:10,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:10,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:10,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:10,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:10,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:10,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:10,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:10,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:10,306 INFO L87 Difference]: Start difference. First operand 3839 states and 5746 transitions. Second operand 3 states. [2018-10-24 14:54:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:12,032 INFO L93 Difference]: Finished difference Result 10952 states and 16371 transitions. [2018-10-24 14:54:12,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:12,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-10-24 14:54:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:12,063 INFO L225 Difference]: With dead ends: 10952 [2018-10-24 14:54:12,064 INFO L226 Difference]: Without dead ends: 7115 [2018-10-24 14:54:12,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2018-10-24 14:54:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7109. [2018-10-24 14:54:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2018-10-24 14:54:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 10002 transitions. [2018-10-24 14:54:12,209 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 10002 transitions. Word has length 200 [2018-10-24 14:54:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:12,209 INFO L481 AbstractCegarLoop]: Abstraction has 7109 states and 10002 transitions. [2018-10-24 14:54:12,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 10002 transitions. [2018-10-24 14:54:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-24 14:54:12,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:12,220 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2018-10-24 14:54:12,220 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:12,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:12,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1058009179, now seen corresponding path program 1 times [2018-10-24 14:54:12,221 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:12,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 14:54:12,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:12,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:12,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:12,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:12,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:12,464 INFO L87 Difference]: Start difference. First operand 7109 states and 10002 transitions. Second operand 3 states. [2018-10-24 14:54:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:14,263 INFO L93 Difference]: Finished difference Result 20952 states and 29506 transitions. [2018-10-24 14:54:14,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:14,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2018-10-24 14:54:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:14,295 INFO L225 Difference]: With dead ends: 20952 [2018-10-24 14:54:14,295 INFO L226 Difference]: Without dead ends: 13845 [2018-10-24 14:54:14,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-24 14:54:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13845 states. [2018-10-24 14:54:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13845 to 13841. [2018-10-24 14:54:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13841 states. [2018-10-24 14:54:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13841 states to 13841 states and 17514 transitions. [2018-10-24 14:54:14,513 INFO L78 Accepts]: Start accepts. Automaton has 13841 states and 17514 transitions. Word has length 207 [2018-10-24 14:54:14,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:14,514 INFO L481 AbstractCegarLoop]: Abstraction has 13841 states and 17514 transitions. [2018-10-24 14:54:14,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 13841 states and 17514 transitions. [2018-10-24 14:54:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-24 14:54:14,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:14,532 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, 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-24 14:54:14,532 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:14,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2125468984, now seen corresponding path program 1 times [2018-10-24 14:54:14,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:14,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:14,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:14,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:14,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 14:54:14,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:14,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:14,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:14,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:14,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:14,679 INFO L87 Difference]: Start difference. First operand 13841 states and 17514 transitions. Second operand 3 states. [2018-10-24 14:54:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:16,213 INFO L93 Difference]: Finished difference Result 33188 states and 42784 transitions. [2018-10-24 14:54:16,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:16,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-10-24 14:54:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:16,247 INFO L225 Difference]: With dead ends: 33188 [2018-10-24 14:54:16,247 INFO L226 Difference]: Without dead ends: 19349 [2018-10-24 14:54:16,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19349 states. [2018-10-24 14:54:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19349 to 19349. [2018-10-24 14:54:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19349 states. [2018-10-24 14:54:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19349 states to 19349 states and 23382 transitions. [2018-10-24 14:54:16,515 INFO L78 Accepts]: Start accepts. Automaton has 19349 states and 23382 transitions. Word has length 228 [2018-10-24 14:54:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:16,515 INFO L481 AbstractCegarLoop]: Abstraction has 19349 states and 23382 transitions. [2018-10-24 14:54:16,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 19349 states and 23382 transitions. [2018-10-24 14:54:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-24 14:54:16,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:16,540 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:16,540 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:16,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:16,541 INFO L82 PathProgramCache]: Analyzing trace with hash -379201010, now seen corresponding path program 1 times [2018-10-24 14:54:16,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:16,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:16,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:16,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:16,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-24 14:54:16,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:16,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:16,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:16,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:16,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:16,940 INFO L87 Difference]: Start difference. First operand 19349 states and 23382 transitions. Second operand 4 states. [2018-10-24 14:54:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:19,443 INFO L93 Difference]: Finished difference Result 68561 states and 81633 transitions. [2018-10-24 14:54:19,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:19,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2018-10-24 14:54:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:19,538 INFO L225 Difference]: With dead ends: 68561 [2018-10-24 14:54:19,539 INFO L226 Difference]: Without dead ends: 49214 [2018-10-24 14:54:19,565 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-24 14:54:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49214 states. [2018-10-24 14:54:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49214 to 35465. [2018-10-24 14:54:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-10-24 14:54:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 41755 transitions. [2018-10-24 14:54:20,085 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 41755 transitions. Word has length 281 [2018-10-24 14:54:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:20,086 INFO L481 AbstractCegarLoop]: Abstraction has 35465 states and 41755 transitions. [2018-10-24 14:54:20,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 41755 transitions. [2018-10-24 14:54:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-24 14:54:20,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:20,119 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 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] [2018-10-24 14:54:20,119 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:20,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:20,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1671916148, now seen corresponding path program 1 times [2018-10-24 14:54:20,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:20,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:20,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-24 14:54:20,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:20,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:20,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:20,352 INFO L87 Difference]: Start difference. First operand 35465 states and 41755 transitions. Second operand 3 states. [2018-10-24 14:54:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:21,592 INFO L93 Difference]: Finished difference Result 70930 states and 83512 transitions. [2018-10-24 14:54:21,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:21,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2018-10-24 14:54:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:21,640 INFO L225 Difference]: With dead ends: 70930 [2018-10-24 14:54:21,640 INFO L226 Difference]: Without dead ends: 35467 [2018-10-24 14:54:21,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35467 states. [2018-10-24 14:54:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35467 to 35465. [2018-10-24 14:54:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-10-24 14:54:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 40448 transitions. [2018-10-24 14:54:22,433 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 40448 transitions. Word has length 296 [2018-10-24 14:54:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:22,434 INFO L481 AbstractCegarLoop]: Abstraction has 35465 states and 40448 transitions. [2018-10-24 14:54:22,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 40448 transitions. [2018-10-24 14:54:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-24 14:54:22,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:22,462 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:22,462 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:22,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:22,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1738833954, now seen corresponding path program 1 times [2018-10-24 14:54:22,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:22,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:22,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:22,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:22,934 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:22,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:22,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:22,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:22,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:22,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:22,936 INFO L87 Difference]: Start difference. First operand 35465 states and 40448 transitions. Second operand 4 states. [2018-10-24 14:54:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:24,733 INFO L93 Difference]: Finished difference Result 70937 states and 80912 transitions. [2018-10-24 14:54:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:24,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2018-10-24 14:54:24,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:24,774 INFO L225 Difference]: With dead ends: 70937 [2018-10-24 14:54:24,774 INFO L226 Difference]: Without dead ends: 35474 [2018-10-24 14:54:24,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2018-10-24 14:54:25,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 35465. [2018-10-24 14:54:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-10-24 14:54:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 40094 transitions. [2018-10-24 14:54:25,195 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 40094 transitions. Word has length 303 [2018-10-24 14:54:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:25,195 INFO L481 AbstractCegarLoop]: Abstraction has 35465 states and 40094 transitions. [2018-10-24 14:54:25,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 40094 transitions. [2018-10-24 14:54:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-24 14:54:25,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:25,214 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:25,215 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:25,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:25,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1030791003, now seen corresponding path program 1 times [2018-10-24 14:54:25,215 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:25,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:25,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:25,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:25,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:25,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:25,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:25,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:25,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:25,651 INFO L87 Difference]: Start difference. First operand 35465 states and 40094 transitions. Second operand 4 states. [2018-10-24 14:54:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:28,045 INFO L93 Difference]: Finished difference Result 70932 states and 80192 transitions. [2018-10-24 14:54:28,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:28,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-10-24 14:54:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:28,091 INFO L225 Difference]: With dead ends: 70932 [2018-10-24 14:54:28,091 INFO L226 Difference]: Without dead ends: 35469 [2018-10-24 14:54:28,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35469 states. [2018-10-24 14:54:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35469 to 33629. [2018-10-24 14:54:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33629 states. [2018-10-24 14:54:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33629 states to 33629 states and 37353 transitions. [2018-10-24 14:54:28,496 INFO L78 Accepts]: Start accepts. Automaton has 33629 states and 37353 transitions. Word has length 308 [2018-10-24 14:54:28,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:28,496 INFO L481 AbstractCegarLoop]: Abstraction has 33629 states and 37353 transitions. [2018-10-24 14:54:28,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 33629 states and 37353 transitions. [2018-10-24 14:54:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-24 14:54:28,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:28,516 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:28,516 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:28,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash -312509538, now seen corresponding path program 1 times [2018-10-24 14:54:28,517 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:28,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:28,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:28,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:28,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 203 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-24 14:54:29,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:29,177 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:54:29,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:29,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:54:29,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:54:29,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 14:54:29,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 14:54:29,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 14:54:29,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-24 14:54:29,672 INFO L87 Difference]: Start difference. First operand 33629 states and 37353 transitions. Second operand 9 states. [2018-10-24 14:54:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:43,252 INFO L93 Difference]: Finished difference Result 206388 states and 228474 transitions. [2018-10-24 14:54:43,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 14:54:43,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 382 [2018-10-24 14:54:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:43,620 INFO L225 Difference]: With dead ends: 206388 [2018-10-24 14:54:43,620 INFO L226 Difference]: Without dead ends: 172761 [2018-10-24 14:54:43,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 380 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2018-10-24 14:54:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172761 states. [2018-10-24 14:54:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172761 to 103288. [2018-10-24 14:54:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103288 states. [2018-10-24 14:54:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103288 states to 103288 states and 113667 transitions. [2018-10-24 14:54:46,572 INFO L78 Accepts]: Start accepts. Automaton has 103288 states and 113667 transitions. Word has length 382 [2018-10-24 14:54:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:46,572 INFO L481 AbstractCegarLoop]: Abstraction has 103288 states and 113667 transitions. [2018-10-24 14:54:46,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 14:54:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 103288 states and 113667 transitions. [2018-10-24 14:54:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-24 14:54:46,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:46,612 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:46,612 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:46,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:46,613 INFO L82 PathProgramCache]: Analyzing trace with hash 176335873, now seen corresponding path program 1 times [2018-10-24 14:54:46,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:46,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:46,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:46,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:46,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-24 14:54:46,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:46,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:46,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:46,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:46,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:46,945 INFO L87 Difference]: Start difference. First operand 103288 states and 113667 transitions. Second operand 3 states. [2018-10-24 14:54:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:48,391 INFO L93 Difference]: Finished difference Result 206570 states and 227328 transitions. [2018-10-24 14:54:48,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:48,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2018-10-24 14:54:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:48,508 INFO L225 Difference]: With dead ends: 206570 [2018-10-24 14:54:48,509 INFO L226 Difference]: Without dead ends: 103284 [2018-10-24 14:54:48,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103284 states. [2018-10-24 14:54:49,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103284 to 103284. [2018-10-24 14:54:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103284 states. [2018-10-24 14:54:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103284 states to 103284 states and 113657 transitions. [2018-10-24 14:54:49,790 INFO L78 Accepts]: Start accepts. Automaton has 103284 states and 113657 transitions. Word has length 417 [2018-10-24 14:54:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:49,791 INFO L481 AbstractCegarLoop]: Abstraction has 103284 states and 113657 transitions. [2018-10-24 14:54:49,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 103284 states and 113657 transitions. [2018-10-24 14:54:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-24 14:54:49,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:49,830 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:54:49,830 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:49,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:49,831 INFO L82 PathProgramCache]: Analyzing trace with hash 105442293, now seen corresponding path program 1 times [2018-10-24 14:54:49,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:49,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:49,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:49,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:49,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-24 14:54:51,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:51,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:51,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:51,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:51,178 INFO L87 Difference]: Start difference. First operand 103284 states and 113657 transitions. Second operand 4 states. [2018-10-24 14:54:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:52,955 INFO L93 Difference]: Finished difference Result 386104 states and 424306 transitions. [2018-10-24 14:54:52,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:52,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 418 [2018-10-24 14:54:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:53,271 INFO L225 Difference]: With dead ends: 386104 [2018-10-24 14:54:53,271 INFO L226 Difference]: Without dead ends: 282822 [2018-10-24 14:54:53,367 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-24 14:54:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282822 states. [2018-10-24 14:54:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282822 to 180154. [2018-10-24 14:54:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180154 states. [2018-10-24 14:54:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180154 states to 180154 states and 197738 transitions. [2018-10-24 14:54:56,960 INFO L78 Accepts]: Start accepts. Automaton has 180154 states and 197738 transitions. Word has length 418 [2018-10-24 14:54:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:56,961 INFO L481 AbstractCegarLoop]: Abstraction has 180154 states and 197738 transitions. [2018-10-24 14:54:56,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:56,961 INFO L276 IsEmpty]: Start isEmpty. Operand 180154 states and 197738 transitions. [2018-10-24 14:54:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-24 14:54:57,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:57,000 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 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] [2018-10-24 14:54:57,001 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:57,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash 846659115, now seen corresponding path program 1 times [2018-10-24 14:54:57,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:57,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:57,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:57,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:57,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-10-24 14:54:57,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:57,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:57,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:57,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:57,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:57,421 INFO L87 Difference]: Start difference. First operand 180154 states and 197738 transitions. Second operand 4 states. [2018-10-24 14:55:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:00,365 INFO L93 Difference]: Finished difference Result 368525 states and 404648 transitions. [2018-10-24 14:55:00,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:55:00,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2018-10-24 14:55:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:00,580 INFO L225 Difference]: With dead ends: 368525 [2018-10-24 14:55:00,581 INFO L226 Difference]: Without dead ends: 188373 [2018-10-24 14:55:00,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188373 states. [2018-10-24 14:55:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188373 to 185887. [2018-10-24 14:55:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185887 states. [2018-10-24 14:55:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185887 states to 185887 states and 203690 transitions. [2018-10-24 14:55:04,580 INFO L78 Accepts]: Start accepts. Automaton has 185887 states and 203690 transitions. Word has length 433 [2018-10-24 14:55:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:04,580 INFO L481 AbstractCegarLoop]: Abstraction has 185887 states and 203690 transitions. [2018-10-24 14:55:04,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:55:04,580 INFO L276 IsEmpty]: Start isEmpty. Operand 185887 states and 203690 transitions. [2018-10-24 14:55:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-24 14:55:04,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:04,607 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-24 14:55:04,607 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:04,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:04,607 INFO L82 PathProgramCache]: Analyzing trace with hash 913804750, now seen corresponding path program 1 times [2018-10-24 14:55:04,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:04,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:04,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:04,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:04,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:05,251 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 14:55:05,465 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 14:55:06,018 WARN L179 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-10-24 14:55:06,311 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-24 14:55:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 281 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:55:11,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:55:11,847 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:55:11,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:12,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:55:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:55:12,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:55:12,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 14:55:12,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 14:55:12,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 14:55:12,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:55:12,314 INFO L87 Difference]: Start difference. First operand 185887 states and 203690 transitions. Second operand 11 states. [2018-10-24 14:55:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:32,222 INFO L93 Difference]: Finished difference Result 658424 states and 722133 transitions. [2018-10-24 14:55:32,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-24 14:55:32,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 435 [2018-10-24 14:55:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:32,820 INFO L225 Difference]: With dead ends: 658424 [2018-10-24 14:55:32,820 INFO L226 Difference]: Without dead ends: 472539 [2018-10-24 14:55:32,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 456 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-10-24 14:55:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472539 states. [2018-10-24 14:55:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472539 to 462835. [2018-10-24 14:55:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462835 states. [2018-10-24 14:55:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462835 states to 462835 states and 503432 transitions. [2018-10-24 14:55:40,450 INFO L78 Accepts]: Start accepts. Automaton has 462835 states and 503432 transitions. Word has length 435 [2018-10-24 14:55:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:40,451 INFO L481 AbstractCegarLoop]: Abstraction has 462835 states and 503432 transitions. [2018-10-24 14:55:40,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 14:55:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 462835 states and 503432 transitions. [2018-10-24 14:55:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-24 14:55:40,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:40,499 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:55:40,500 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:40,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:40,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1716497848, now seen corresponding path program 1 times [2018-10-24 14:55:40,501 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:40,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:40,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:40,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:40,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-10-24 14:55:40,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:40,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:40,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:55:40,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:55:40,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:40,879 INFO L87 Difference]: Start difference. First operand 462835 states and 503432 transitions. Second operand 3 states. [2018-10-24 14:55:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:45,831 INFO L93 Difference]: Finished difference Result 851748 states and 927190 transitions. [2018-10-24 14:55:45,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:45,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 464 [2018-10-24 14:55:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:46,365 INFO L225 Difference]: With dead ends: 851748 [2018-10-24 14:55:46,365 INFO L226 Difference]: Without dead ends: 388915 [2018-10-24 14:55:46,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388915 states. [2018-10-24 14:56:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388915 to 378079. [2018-10-24 14:56:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378079 states. [2018-10-24 14:56:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378079 states to 378079 states and 404350 transitions. [2018-10-24 14:56:01,091 INFO L78 Accepts]: Start accepts. Automaton has 378079 states and 404350 transitions. Word has length 464 [2018-10-24 14:56:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:01,091 INFO L481 AbstractCegarLoop]: Abstraction has 378079 states and 404350 transitions. [2018-10-24 14:56:01,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 378079 states and 404350 transitions. [2018-10-24 14:56:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-10-24 14:56:01,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:01,131 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:01,131 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:01,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:01,132 INFO L82 PathProgramCache]: Analyzing trace with hash -487946110, now seen corresponding path program 1 times [2018-10-24 14:56:01,132 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:01,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:01,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:01,895 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 14:56:02,140 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 14:56:02,427 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 14:56:02,744 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-10-24 14:56:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 481 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:56:05,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:56:05,177 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:56:05,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:05,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:56:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-10-24 14:56:06,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:56:06,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 15 [2018-10-24 14:56:06,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 14:56:06,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 14:56:06,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-10-24 14:56:06,066 INFO L87 Difference]: Start difference. First operand 378079 states and 404350 transitions. Second operand 15 states. [2018-10-24 14:56:06,661 WARN L179 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-10-24 14:56:11,412 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-24 14:56:13,731 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-10-24 14:56:21,005 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-10-24 14:56:21,226 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-10-24 14:56:22,792 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-10-24 14:56:22,973 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-10-24 14:56:24,795 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-10-24 14:56:42,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:42,440 INFO L93 Difference]: Finished difference Result 1350864 states and 1460939 transitions. [2018-10-24 14:56:42,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-24 14:56:42,440 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 515 [2018-10-24 14:56:42,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:43,681 INFO L225 Difference]: With dead ends: 1350864 [2018-10-24 14:56:43,682 INFO L226 Difference]: Without dead ends: 972787 [2018-10-24 14:56:43,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 571 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1165, Invalid=3665, Unknown=0, NotChecked=0, Total=4830 [2018-10-24 14:56:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972787 states. [2018-10-24 14:56:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972787 to 683701. [2018-10-24 14:56:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683701 states. [2018-10-24 14:56:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683701 states to 683701 states and 727905 transitions. [2018-10-24 14:56:57,898 INFO L78 Accepts]: Start accepts. Automaton has 683701 states and 727905 transitions. Word has length 515 [2018-10-24 14:56:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:57,899 INFO L481 AbstractCegarLoop]: Abstraction has 683701 states and 727905 transitions. [2018-10-24 14:56:57,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 14:56:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 683701 states and 727905 transitions. [2018-10-24 14:56:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2018-10-24 14:56:58,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:58,102 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:58,102 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:58,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:58,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1556115499, now seen corresponding path program 1 times [2018-10-24 14:56:58,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:58,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:58,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:58,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:58,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2538 backedges. 785 proven. 0 refuted. 0 times theorem prover too weak. 1753 trivial. 0 not checked. [2018-10-24 14:57:06,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:06,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:06,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:06,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:06,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:06,956 INFO L87 Difference]: Start difference. First operand 683701 states and 727905 transitions. Second operand 4 states. Received shutdown request... [2018-10-24 14:57:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:08,194 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:57:08,201 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:57:08,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:57:08 BoogieIcfgContainer [2018-10-24 14:57:08,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:57:08,202 INFO L168 Benchmark]: Toolchain (without parser) took 204816.12 ms. Allocated memory was 1.5 GB in the beginning and 6.1 GB in the end (delta: 4.5 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 2.4 GB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,203 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:57:08,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1168.44 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: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 319.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.0 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -911.4 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,206 INFO L168 Benchmark]: Boogie Preprocessor took 123.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,206 INFO L168 Benchmark]: RCFGBuilder took 5319.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 252.9 MB). Peak memory consumption was 252.9 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,207 INFO L168 Benchmark]: TraceAbstraction took 197880.56 ms. Allocated memory was 2.3 GB in the beginning and 6.1 GB in the end (delta: 3.8 GB). Free memory was 2.0 GB in the beginning and 3.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-24 14:57:08,212 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.25 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 1168.44 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: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 319.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.0 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -911.4 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5319.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 252.9 MB). Peak memory consumption was 252.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197880.56 ms. Allocated memory was 2.3 GB in the beginning and 6.1 GB in the end (delta: 3.8 GB). Free memory was 2.0 GB in the beginning and 3.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1509]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1509). Cancelled while BasicCegarLoop was constructing difference of abstraction (683701states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (30956 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 197.8s OverallTime, 21 OverallIterations, 11 TraceHistogramMax, 116.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5063 SDtfs, 28911 SDslu, 5152 SDs, 0 SdLazy, 43729 SolverSat, 7773 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1597 GetRequests, 1430 SyntacticMatches, 12 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1983 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=683701occurred in iteration=20, 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: 50.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 502701 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 8154 NumberOfCodeBlocks, 8154 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 8130 ConstructedInterpolants, 0 QuantifiedInterpolants, 15107956 SizeOfPredicates, 21 NumberOfNonLiveVariables, 2191 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 8160/8591 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown