java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label34_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:23:18,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:23:18,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:23:18,406 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:23:18,406 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:23:18,409 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:23:18,411 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:23:18,413 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:23:18,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:23:18,419 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:23:18,422 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:23:18,422 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:23:18,423 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:23:18,424 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:23:18,428 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:23:18,429 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:23:18,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:23:18,441 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:23:18,443 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:23:18,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:23:18,451 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:23:18,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:23:18,455 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:23:18,455 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:23:18,456 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:23:18,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:23:18,460 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:23:18,461 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:23:18,461 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:23:18,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:23:18,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:23:18,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:23:18,468 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:23:18,468 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:23:18,469 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:23:18,470 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:23:18,470 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 16:23:18,501 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:23:18,502 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:23:18,503 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:23:18,503 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:23:18,504 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:23:18,504 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:23:18,504 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:23:18,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:23:18,507 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:23:18,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:23:18,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:23:18,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:23:18,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:23:18,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:23:18,508 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:23:18,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:23:18,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:23:18,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:23:18,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:23:18,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:23:18,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:23:18,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:23:18,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:23:18,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:23:18,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:23:18,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:23:18,511 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:23:18,511 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:23:18,578 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:23:18,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:23:18,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:23:18,602 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:23:18,602 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:23:18,603 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label34_true-unreach-call.c [2018-10-24 16:23:18,671 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d2a860195/12d96fc90f3948759f63cd25e3ede798/FLAGb5b9d89c6 [2018-10-24 16:23:19,494 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:23:19,495 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label34_true-unreach-call.c [2018-10-24 16:23:19,526 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d2a860195/12d96fc90f3948759f63cd25e3ede798/FLAGb5b9d89c6 [2018-10-24 16:23:19,541 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d2a860195/12d96fc90f3948759f63cd25e3ede798 [2018-10-24 16:23:19,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:23:19,554 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:23:19,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:23:19,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:23:19,562 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:23:19,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:19" (1/1) ... [2018-10-24 16:23:19,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31eb09b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:19, skipping insertion in model container [2018-10-24 16:23:19,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:19" (1/1) ... [2018-10-24 16:23:19,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:23:19,762 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:23:21,409 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:23:21,413 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:23:22,097 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:23:22,136 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:23:22,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22 WrapperNode [2018-10-24 16:23:22,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:23:22,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:23:22,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:23:22,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:23:22,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22" (1/1) ... [2018-10-24 16:23:22,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22" (1/1) ... [2018-10-24 16:23:23,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:23:23,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:23:23,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:23:23,042 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:23:23,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22" (1/1) ... [2018-10-24 16:23:23,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22" (1/1) ... [2018-10-24 16:23:23,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22" (1/1) ... [2018-10-24 16:23:23,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22" (1/1) ... [2018-10-24 16:23:23,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22" (1/1) ... [2018-10-24 16:23:23,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22" (1/1) ... [2018-10-24 16:23:23,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22" (1/1) ... [2018-10-24 16:23:23,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:23:23,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:23:23,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:23:23,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:23:23,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:23:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:23:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:23:23,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:23:39,857 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:23:39,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:23:39 BoogieIcfgContainer [2018-10-24 16:23:39,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:23:39,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:23:39,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:23:39,862 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:23:39,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:23:19" (1/3) ... [2018-10-24 16:23:39,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495ba6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:23:39, skipping insertion in model container [2018-10-24 16:23:39,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:22" (2/3) ... [2018-10-24 16:23:39,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495ba6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:23:39, skipping insertion in model container [2018-10-24 16:23:39,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:23:39" (3/3) ... [2018-10-24 16:23:39,867 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label34_true-unreach-call.c [2018-10-24 16:23:39,877 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:23:39,888 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:23:39,906 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:23:39,954 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:23:39,954 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:23:39,955 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:23:39,955 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:23:39,955 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:23:39,955 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:23:39,955 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:23:39,955 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:23:39,955 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:23:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-24 16:23:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-24 16:23:40,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:23:40,002 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] [2018-10-24 16:23:40,005 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:23:40,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:23:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1848943538, now seen corresponding path program 1 times [2018-10-24 16:23:40,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:23:40,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:23:40,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:23:40,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:23:40,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:23:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:23:40,544 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-24 16:23:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:23:40,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:23:40,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:23:40,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:23:40,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:23:40,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:23:40,585 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-10-24 16:23:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:23:57,439 INFO L93 Difference]: Finished difference Result 3896 states and 7286 transitions. [2018-10-24 16:23:57,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:23:57,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-10-24 16:23:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:23:57,493 INFO L225 Difference]: With dead ends: 3896 [2018-10-24 16:23:57,494 INFO L226 Difference]: Without dead ends: 2790 [2018-10-24 16:23:57,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:23:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2018-10-24 16:23:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1945. [2018-10-24 16:23:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-10-24 16:23:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3412 transitions. [2018-10-24 16:23:57,659 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3412 transitions. Word has length 57 [2018-10-24 16:23:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:23:57,660 INFO L481 AbstractCegarLoop]: Abstraction has 1945 states and 3412 transitions. [2018-10-24 16:23:57,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:23:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3412 transitions. [2018-10-24 16:23:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-24 16:23:57,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:23:57,665 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:23:57,666 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:23:57,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:23:57,666 INFO L82 PathProgramCache]: Analyzing trace with hash 591180937, now seen corresponding path program 1 times [2018-10-24 16:23:57,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:23:57,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:23:57,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:23:57,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:23:57,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:23:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:23:58,282 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-10-24 16:23:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:23:58,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:23:58,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:23:58,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:23:58,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:23:58,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:23:58,693 INFO L87 Difference]: Start difference. First operand 1945 states and 3412 transitions. Second operand 5 states. [2018-10-24 16:23:58,957 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-24 16:24:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:24:16,094 INFO L93 Difference]: Finished difference Result 7061 states and 12475 transitions. [2018-10-24 16:24:16,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:24:16,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2018-10-24 16:24:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:24:16,121 INFO L225 Difference]: With dead ends: 7061 [2018-10-24 16:24:16,121 INFO L226 Difference]: Without dead ends: 5118 [2018-10-24 16:24:16,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:24:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2018-10-24 16:24:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 5117. [2018-10-24 16:24:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2018-10-24 16:24:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 7612 transitions. [2018-10-24 16:24:16,229 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 7612 transitions. Word has length 123 [2018-10-24 16:24:16,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:24:16,230 INFO L481 AbstractCegarLoop]: Abstraction has 5117 states and 7612 transitions. [2018-10-24 16:24:16,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:24:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 7612 transitions. [2018-10-24 16:24:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-24 16:24:16,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:24:16,235 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:24:16,235 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:24:16,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:24:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2132882266, now seen corresponding path program 1 times [2018-10-24 16:24:16,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:24:16,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:24:16,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:16,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:16,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:24:16,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:24:16,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:24:16,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:24:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:24:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:24:16,417 INFO L87 Difference]: Start difference. First operand 5117 states and 7612 transitions. Second operand 3 states. [2018-10-24 16:24:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:24:24,480 INFO L93 Difference]: Finished difference Result 10220 states and 15517 transitions. [2018-10-24 16:24:24,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:24:24,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-24 16:24:24,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:24:24,509 INFO L225 Difference]: With dead ends: 10220 [2018-10-24 16:24:24,509 INFO L226 Difference]: Without dead ends: 5893 [2018-10-24 16:24:24,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:24:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2018-10-24 16:24:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 5892. [2018-10-24 16:24:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5892 states. [2018-10-24 16:24:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5892 states to 5892 states and 7437 transitions. [2018-10-24 16:24:24,625 INFO L78 Accepts]: Start accepts. Automaton has 5892 states and 7437 transitions. Word has length 183 [2018-10-24 16:24:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:24:24,626 INFO L481 AbstractCegarLoop]: Abstraction has 5892 states and 7437 transitions. [2018-10-24 16:24:24,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:24:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5892 states and 7437 transitions. [2018-10-24 16:24:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-24 16:24:24,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:24:24,629 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:24:24,630 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:24:24,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:24:24,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1133001011, now seen corresponding path program 1 times [2018-10-24 16:24:24,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:24:24,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:24:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:24,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 109 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-24 16:24:24,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:24:24,951 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:24:24,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:25,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:24:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:24:25,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:24:25,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-10-24 16:24:25,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:24:25,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:24:25,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:24:25,288 INFO L87 Difference]: Start difference. First operand 5892 states and 7437 transitions. Second operand 5 states. [2018-10-24 16:24:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:24:39,221 INFO L93 Difference]: Finished difference Result 20501 states and 27031 transitions. [2018-10-24 16:24:39,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:24:39,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2018-10-24 16:24:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:24:39,274 INFO L225 Difference]: With dead ends: 20501 [2018-10-24 16:24:39,274 INFO L226 Difference]: Without dead ends: 15399 [2018-10-24 16:24:39,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:24:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15399 states. [2018-10-24 16:24:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15399 to 10627. [2018-10-24 16:24:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2018-10-24 16:24:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 13141 transitions. [2018-10-24 16:24:39,489 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 13141 transitions. Word has length 222 [2018-10-24 16:24:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:24:39,490 INFO L481 AbstractCegarLoop]: Abstraction has 10627 states and 13141 transitions. [2018-10-24 16:24:39,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:24:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 13141 transitions. [2018-10-24 16:24:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-24 16:24:39,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:24:39,494 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:24:39,495 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:24:39,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:24:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash 268993022, now seen corresponding path program 1 times [2018-10-24 16:24:39,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:24:39,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:24:39,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:39,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:39,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-24 16:24:39,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:24:39,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 16:24:39,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:24:39,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:24:39,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:24:39,752 INFO L87 Difference]: Start difference. First operand 10627 states and 13141 transitions. Second operand 3 states. [2018-10-24 16:24:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:24:48,590 INFO L93 Difference]: Finished difference Result 28343 states and 35767 transitions. [2018-10-24 16:24:48,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:24:48,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-10-24 16:24:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:24:48,625 INFO L225 Difference]: With dead ends: 28343 [2018-10-24 16:24:48,625 INFO L226 Difference]: Without dead ends: 18506 [2018-10-24 16:24:48,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:24:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18506 states. [2018-10-24 16:24:48,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18506 to 18505. [2018-10-24 16:24:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18505 states. [2018-10-24 16:24:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18505 states to 18505 states and 22008 transitions. [2018-10-24 16:24:48,879 INFO L78 Accepts]: Start accepts. Automaton has 18505 states and 22008 transitions. Word has length 233 [2018-10-24 16:24:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:24:48,879 INFO L481 AbstractCegarLoop]: Abstraction has 18505 states and 22008 transitions. [2018-10-24 16:24:48,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:24:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 18505 states and 22008 transitions. [2018-10-24 16:24:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-24 16:24:48,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:24:48,885 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:24:48,886 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:24:48,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:24:48,886 INFO L82 PathProgramCache]: Analyzing trace with hash 787888975, now seen corresponding path program 1 times [2018-10-24 16:24:48,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:24:48,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:24:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:48,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:49,474 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 6 [2018-10-24 16:24:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 109 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-24 16:24:49,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:24:49,556 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:24:49,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:49,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:24:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:24:49,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:24:49,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-24 16:24:49,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:24:49,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:24:49,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:24:49,820 INFO L87 Difference]: Start difference. First operand 18505 states and 22008 transitions. Second operand 4 states. [2018-10-24 16:24:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:24:58,190 INFO L93 Difference]: Finished difference Result 44141 states and 51712 transitions. [2018-10-24 16:24:58,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:24:58,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 271 [2018-10-24 16:24:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:24:58,225 INFO L225 Difference]: With dead ends: 44141 [2018-10-24 16:24:58,225 INFO L226 Difference]: Without dead ends: 21648 [2018-10-24 16:24:58,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:24:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21648 states. [2018-10-24 16:24:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21648 to 19266. [2018-10-24 16:24:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19266 states. [2018-10-24 16:24:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19266 states to 19266 states and 22668 transitions. [2018-10-24 16:24:58,526 INFO L78 Accepts]: Start accepts. Automaton has 19266 states and 22668 transitions. Word has length 271 [2018-10-24 16:24:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:24:58,526 INFO L481 AbstractCegarLoop]: Abstraction has 19266 states and 22668 transitions. [2018-10-24 16:24:58,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:24:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 19266 states and 22668 transitions. [2018-10-24 16:24:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-24 16:24:58,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:24:58,534 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:24:58,534 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:24:58,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:24:58,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2055948998, now seen corresponding path program 1 times [2018-10-24 16:24:58,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:24:58,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:24:58,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:58,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:24:58,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:24:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:24:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:24:58,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:24:58,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:24:58,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:24:58,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:24:58,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:24:58,964 INFO L87 Difference]: Start difference. First operand 19266 states and 22668 transitions. Second operand 4 states. [2018-10-24 16:25:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:25:05,708 INFO L93 Difference]: Finished difference Result 41683 states and 48797 transitions. [2018-10-24 16:25:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:25:05,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2018-10-24 16:25:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:25:05,757 INFO L225 Difference]: With dead ends: 41683 [2018-10-24 16:25:05,757 INFO L226 Difference]: Without dead ends: 21594 [2018-10-24 16:25:05,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:25:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21594 states. [2018-10-24 16:25:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21594 to 19229. [2018-10-24 16:25:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19229 states. [2018-10-24 16:25:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19229 states to 19229 states and 22239 transitions. [2018-10-24 16:25:05,997 INFO L78 Accepts]: Start accepts. Automaton has 19229 states and 22239 transitions. Word has length 300 [2018-10-24 16:25:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:25:05,997 INFO L481 AbstractCegarLoop]: Abstraction has 19229 states and 22239 transitions. [2018-10-24 16:25:05,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:25:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 19229 states and 22239 transitions. [2018-10-24 16:25:06,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-24 16:25:06,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:25:06,005 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:25:06,006 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:25:06,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:25:06,007 INFO L82 PathProgramCache]: Analyzing trace with hash -424530140, now seen corresponding path program 1 times [2018-10-24 16:25:06,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:25:06,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:25:06,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:06,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:25:06,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:25:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-24 16:25:06,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:25:06,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:25:06,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:25:06,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:25:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:25:06,414 INFO L87 Difference]: Start difference. First operand 19229 states and 22239 transitions. Second operand 4 states. [2018-10-24 16:25:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:25:16,921 INFO L93 Difference]: Finished difference Result 68437 states and 79694 transitions. [2018-10-24 16:25:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:25:16,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 305 [2018-10-24 16:25:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:25:16,982 INFO L225 Difference]: With dead ends: 68437 [2018-10-24 16:25:16,983 INFO L226 Difference]: Without dead ends: 49206 [2018-10-24 16:25:17,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:25:17,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49206 states. [2018-10-24 16:25:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49206 to 47597. [2018-10-24 16:25:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47597 states. [2018-10-24 16:25:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47597 states to 47597 states and 53239 transitions. [2018-10-24 16:25:17,493 INFO L78 Accepts]: Start accepts. Automaton has 47597 states and 53239 transitions. Word has length 305 [2018-10-24 16:25:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:25:17,493 INFO L481 AbstractCegarLoop]: Abstraction has 47597 states and 53239 transitions. [2018-10-24 16:25:17,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:25:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 47597 states and 53239 transitions. [2018-10-24 16:25:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-24 16:25:17,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:25:17,504 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:25:17,504 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:25:17,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:25:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash 966754319, now seen corresponding path program 1 times [2018-10-24 16:25:17,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:25:17,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:25:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:17,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:25:17,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:25:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-10-24 16:25:18,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:25:18,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:25:18,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:25:18,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:25:18,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:25:18,020 INFO L87 Difference]: Start difference. First operand 47597 states and 53239 transitions. Second operand 3 states. [2018-10-24 16:25:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:25:24,065 INFO L93 Difference]: Finished difference Result 94403 states and 105685 transitions. [2018-10-24 16:25:24,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:25:24,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 413 [2018-10-24 16:25:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:25:24,120 INFO L225 Difference]: With dead ends: 94403 [2018-10-24 16:25:24,120 INFO L226 Difference]: Without dead ends: 47596 [2018-10-24 16:25:24,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:25:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47596 states. [2018-10-24 16:25:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47596 to 47595. [2018-10-24 16:25:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47595 states. [2018-10-24 16:25:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47595 states to 47595 states and 51851 transitions. [2018-10-24 16:25:24,973 INFO L78 Accepts]: Start accepts. Automaton has 47595 states and 51851 transitions. Word has length 413 [2018-10-24 16:25:24,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:25:24,974 INFO L481 AbstractCegarLoop]: Abstraction has 47595 states and 51851 transitions. [2018-10-24 16:25:24,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:25:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 47595 states and 51851 transitions. [2018-10-24 16:25:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2018-10-24 16:25:25,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:25:25,012 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:25:25,012 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:25:25,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:25:25,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1667699618, now seen corresponding path program 1 times [2018-10-24 16:25:25,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:25:25,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:25:25,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:25,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:25:25,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:25:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-10-24 16:25:25,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:25:25,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:25:25,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:25:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:25:25,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:25:25,531 INFO L87 Difference]: Start difference. First operand 47595 states and 51851 transitions. Second operand 4 states. [2018-10-24 16:25:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:25:35,176 INFO L93 Difference]: Finished difference Result 125942 states and 137702 transitions. [2018-10-24 16:25:35,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:25:35,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 654 [2018-10-24 16:25:35,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:25:35,259 INFO L225 Difference]: With dead ends: 125942 [2018-10-24 16:25:35,259 INFO L226 Difference]: Without dead ends: 78344 [2018-10-24 16:25:35,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:25:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78344 states. [2018-10-24 16:25:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78344 to 74382. [2018-10-24 16:25:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74382 states. [2018-10-24 16:25:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74382 states to 74382 states and 80017 transitions. [2018-10-24 16:25:35,938 INFO L78 Accepts]: Start accepts. Automaton has 74382 states and 80017 transitions. Word has length 654 [2018-10-24 16:25:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:25:35,939 INFO L481 AbstractCegarLoop]: Abstraction has 74382 states and 80017 transitions. [2018-10-24 16:25:35,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:25:35,940 INFO L276 IsEmpty]: Start isEmpty. Operand 74382 states and 80017 transitions. [2018-10-24 16:25:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2018-10-24 16:25:36,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:25:36,043 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:25:36,043 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:25:36,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:25:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1561064601, now seen corresponding path program 1 times [2018-10-24 16:25:36,044 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:25:36,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:25:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:36,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:25:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:25:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-10-24 16:25:37,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:25:37,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:25:37,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:25:37,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:25:37,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:25:37,410 INFO L87 Difference]: Start difference. First operand 74382 states and 80017 transitions. Second operand 5 states. [2018-10-24 16:25:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:25:53,691 INFO L93 Difference]: Finished difference Result 267979 states and 287847 transitions. [2018-10-24 16:25:53,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:25:53,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1113 [2018-10-24 16:25:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:25:53,883 INFO L225 Difference]: With dead ends: 267979 [2018-10-24 16:25:53,883 INFO L226 Difference]: Without dead ends: 194386 [2018-10-24 16:25:53,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:25:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194386 states. [2018-10-24 16:25:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194386 to 183983. [2018-10-24 16:25:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183983 states. [2018-10-24 16:25:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183983 states to 183983 states and 195494 transitions. [2018-10-24 16:25:56,304 INFO L78 Accepts]: Start accepts. Automaton has 183983 states and 195494 transitions. Word has length 1113 [2018-10-24 16:25:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:25:56,305 INFO L481 AbstractCegarLoop]: Abstraction has 183983 states and 195494 transitions. [2018-10-24 16:25:56,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:25:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 183983 states and 195494 transitions. [2018-10-24 16:25:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190 [2018-10-24 16:25:56,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:25:56,435 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:25:56,436 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:25:56,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:25:56,436 INFO L82 PathProgramCache]: Analyzing trace with hash 79212995, now seen corresponding path program 1 times [2018-10-24 16:25:56,436 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:25:56,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:25:56,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:56,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:25:56,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:25:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:25:57,280 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 16:25:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-10-24 16:25:58,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:25:58,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:25:58,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:25:58,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:25:58,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:25:58,830 INFO L87 Difference]: Start difference. First operand 183983 states and 195494 transitions. Second operand 4 states. [2018-10-24 16:26:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:26:08,509 INFO L93 Difference]: Finished difference Result 366417 states and 389449 transitions. [2018-10-24 16:26:08,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:26:08,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1189 [2018-10-24 16:26:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:26:08,708 INFO L225 Difference]: With dead ends: 366417 [2018-10-24 16:26:08,708 INFO L226 Difference]: Without dead ends: 183223 [2018-10-24 16:26:08,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:26:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183223 states. [2018-10-24 16:26:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183223 to 168998. [2018-10-24 16:26:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168998 states. [2018-10-24 16:26:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168998 states to 168998 states and 174937 transitions. [2018-10-24 16:26:10,248 INFO L78 Accepts]: Start accepts. Automaton has 168998 states and 174937 transitions. Word has length 1189 [2018-10-24 16:26:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:26:10,249 INFO L481 AbstractCegarLoop]: Abstraction has 168998 states and 174937 transitions. [2018-10-24 16:26:10,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:26:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 168998 states and 174937 transitions. [2018-10-24 16:26:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1197 [2018-10-24 16:26:10,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:26:10,337 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:26:10,337 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:26:10,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:26:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1653764469, now seen corresponding path program 1 times [2018-10-24 16:26:10,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:26:10,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:26:10,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:10,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:26:10,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:26:11,128 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 16:26:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1212 backedges. 882 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-10-24 16:26:12,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:26:12,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:26:12,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:26:12,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:26:12,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:26:12,427 INFO L87 Difference]: Start difference. First operand 168998 states and 174937 transitions. Second operand 4 states. [2018-10-24 16:26:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:26:19,948 INFO L93 Difference]: Finished difference Result 342731 states and 354686 transitions. [2018-10-24 16:26:19,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:26:19,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1196 [2018-10-24 16:26:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:26:20,131 INFO L225 Difference]: With dead ends: 342731 [2018-10-24 16:26:20,131 INFO L226 Difference]: Without dead ends: 174523 [2018-10-24 16:26:20,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:26:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174523 states. [2018-10-24 16:26:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174523 to 170574. [2018-10-24 16:26:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170574 states. [2018-10-24 16:26:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170574 states to 170574 states and 176410 transitions. [2018-10-24 16:26:22,756 INFO L78 Accepts]: Start accepts. Automaton has 170574 states and 176410 transitions. Word has length 1196 [2018-10-24 16:26:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:26:22,756 INFO L481 AbstractCegarLoop]: Abstraction has 170574 states and 176410 transitions. [2018-10-24 16:26:22,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:26:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 170574 states and 176410 transitions. [2018-10-24 16:26:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2018-10-24 16:26:22,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:26:22,828 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:26:22,829 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:26:22,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:26:22,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1387546168, now seen corresponding path program 1 times [2018-10-24 16:26:22,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:26:22,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:26:22,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:22,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:26:22,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:26:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 943 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-10-24 16:26:25,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:26:25,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:26:25,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:26:25,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:26:25,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:26:25,207 INFO L87 Difference]: Start difference. First operand 170574 states and 176410 transitions. Second operand 4 states. [2018-10-24 16:26:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:26:39,072 INFO L93 Difference]: Finished difference Result 376707 states and 389804 transitions. [2018-10-24 16:26:39,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:26:39,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1220 [2018-10-24 16:26:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:26:40,122 INFO L225 Difference]: With dead ends: 376707 [2018-10-24 16:26:40,122 INFO L226 Difference]: Without dead ends: 206923 [2018-10-24 16:26:40,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:26:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206923 states. [2018-10-24 16:26:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206923 to 199733. [2018-10-24 16:26:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199733 states. [2018-10-24 16:26:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199733 states to 199733 states and 206495 transitions. [2018-10-24 16:26:42,964 INFO L78 Accepts]: Start accepts. Automaton has 199733 states and 206495 transitions. Word has length 1220 [2018-10-24 16:26:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:26:42,965 INFO L481 AbstractCegarLoop]: Abstraction has 199733 states and 206495 transitions. [2018-10-24 16:26:42,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:26:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 199733 states and 206495 transitions. [2018-10-24 16:26:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1418 [2018-10-24 16:26:43,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:26:43,073 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:26:43,073 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:26:43,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:26:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash 138000160, now seen corresponding path program 1 times [2018-10-24 16:26:43,074 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:26:43,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:26:43,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:43,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:26:43,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:26:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:26:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 542 proven. 411 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2018-10-24 16:26:52,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:26:52,575 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:26:52,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:26:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:26:52,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:26:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 953 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2018-10-24 16:26:54,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:26:54,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 16:26:54,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 16:26:54,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 16:26:54,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:26:54,634 INFO L87 Difference]: Start difference. First operand 199733 states and 206495 transitions. Second operand 11 states. Received shutdown request... [2018-10-24 16:27:03,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 16:27:03,757 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 16:27:03,763 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 16:27:03,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:27:03 BoogieIcfgContainer [2018-10-24 16:27:03,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:27:03,764 INFO L168 Benchmark]: Toolchain (without parser) took 224210.80 ms. Allocated memory was 1.5 GB in the beginning and 4.6 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 755.5 MB. Max. memory is 7.1 GB. [2018-10-24 16:27:03,765 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:27:03,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2582.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-24 16:27:03,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 902.95 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 826.8 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2018-10-24 16:27:03,768 INFO L168 Benchmark]: Boogie Preprocessor took 461.83 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 7.1 GB. [2018-10-24 16:27:03,768 INFO L168 Benchmark]: RCFGBuilder took 16354.38 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 225.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 63.3 MB). Peak memory consumption was 600.4 MB. Max. memory is 7.1 GB. [2018-10-24 16:27:03,769 INFO L168 Benchmark]: TraceAbstraction took 203904.78 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 3.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 349.7 MB. Max. memory is 7.1 GB. [2018-10-24 16:27:03,775 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.21 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 2582.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 902.95 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 826.8 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 461.83 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 16354.38 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 225.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 63.3 MB). Peak memory consumption was 600.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203904.78 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 3.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 349.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 180]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 180). Cancelled while BasicCegarLoop was constructing difference of abstraction (199733states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (24971 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 203.8s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 165.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12011 SDtfs, 34305 SDslu, 3355 SDs, 0 SdLazy, 66114 SolverSat, 15240 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 136.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1990 GetRequests, 1935 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199733occurred in iteration=14, 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: 12.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 51706 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 10806 NumberOfCodeBlocks, 10806 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 10788 ConstructedInterpolants, 0 QuantifiedInterpolants, 33439904 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2296 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 10680/11161 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown