java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:52:43,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:52:43,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:52:43,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:52:43,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:52:43,367 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:52:43,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:52:43,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:52:43,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:52:43,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:52:43,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:52:43,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:52:43,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:52:43,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:52:43,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:52:43,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:52:43,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:52:43,381 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:52:43,383 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:52:43,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:52:43,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:52:43,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:52:43,394 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:52:43,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:52:43,395 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:52:43,396 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:52:43,397 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:52:43,398 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:52:43,398 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:52:43,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:52:43,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:52:43,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:52:43,401 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:52:43,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:52:43,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:52:43,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:52:43,403 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:52:43,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:52:43,418 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:52:43,419 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:52:43,419 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:52:43,419 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:52:43,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:52:43,420 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:52:43,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:52:43,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:52:43,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:52:43,421 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:52:43,421 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:52:43,421 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:52:43,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:52:43,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:52:43,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:52:43,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:52:43,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:52:43,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:52:43,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:52:43,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:52:43,423 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:52:43,423 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:52:43,423 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:52:43,423 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:52:43,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:52:43,424 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:52:43,424 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:52:43,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:52:43,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:52:43,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:52:43,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:52:43,489 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:52:43,489 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-11-06 19:52:43,551 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8c425b8/86a3f689fbcf43fdbd743c2a8e91b3ee/FLAG9826159bb [2018-11-06 19:52:44,245 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:52:44,245 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-11-06 19:52:44,267 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8c425b8/86a3f689fbcf43fdbd743c2a8e91b3ee/FLAG9826159bb [2018-11-06 19:52:44,281 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8c425b8/86a3f689fbcf43fdbd743c2a8e91b3ee [2018-11-06 19:52:44,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:52:44,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:52:44,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:44,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:52:44,304 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:52:44,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:44" (1/1) ... [2018-11-06 19:52:44,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42844b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:44, skipping insertion in model container [2018-11-06 19:52:44,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:44" (1/1) ... [2018-11-06 19:52:44,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:52:44,420 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:52:45,154 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:45,160 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:52:45,406 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:45,432 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:52:45,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45 WrapperNode [2018-11-06 19:52:45,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:45,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:45,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:52:45,434 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:52:45,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45" (1/1) ... [2018-11-06 19:52:45,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45" (1/1) ... [2018-11-06 19:52:45,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:45,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:52:45,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:52:45,722 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:52:45,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45" (1/1) ... [2018-11-06 19:52:45,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45" (1/1) ... [2018-11-06 19:52:45,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45" (1/1) ... [2018-11-06 19:52:45,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45" (1/1) ... [2018-11-06 19:52:45,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45" (1/1) ... [2018-11-06 19:52:45,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45" (1/1) ... [2018-11-06 19:52:45,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45" (1/1) ... [2018-11-06 19:52:45,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:52:45,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:52:45,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:52:45,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:52:45,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:52:45,945 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:52:45,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:52:45,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:52:51,276 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:52:51,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:51 BoogieIcfgContainer [2018-11-06 19:52:51,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:52:51,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:52:51,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:52:51,281 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:52:51,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:52:44" (1/3) ... [2018-11-06 19:52:51,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f900359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:51, skipping insertion in model container [2018-11-06 19:52:51,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:45" (2/3) ... [2018-11-06 19:52:51,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f900359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:51, skipping insertion in model container [2018-11-06 19:52:51,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:51" (3/3) ... [2018-11-06 19:52:51,285 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label11_true-unreach-call.c [2018-11-06 19:52:51,295 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:52:51,304 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:52:51,321 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:52:51,361 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:52:51,362 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:52:51,362 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:52:51,362 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:52:51,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:52:51,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:52:51,364 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:52:51,364 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:52:51,365 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:52:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:52:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-06 19:52:51,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:51,416 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:51,418 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:51,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash -73727940, now seen corresponding path program 1 times [2018-11-06 19:52:51,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:51,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:51,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:51,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:52,256 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:52:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:52,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:52,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:52,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:52,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:52,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:52,386 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:52:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:56,471 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-11-06 19:52:56,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:52:56,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-11-06 19:52:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:56,498 INFO L225 Difference]: With dead ends: 1027 [2018-11-06 19:52:56,499 INFO L226 Difference]: Without dead ends: 717 [2018-11-06 19:52:56,504 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-11-06 19:52:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-11-06 19:52:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-11-06 19:52:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-11-06 19:52:56,591 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 194 [2018-11-06 19:52:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:56,592 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-11-06 19:52:56,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:52:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-11-06 19:52:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-06 19:52:56,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:56,601 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:56,601 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:56,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:56,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1649660795, now seen corresponding path program 1 times [2018-11-06 19:52:56,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:56,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:56,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:56,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:56,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:56,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:56,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:56,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:56,768 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-11-06 19:52:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:59,017 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-11-06 19:52:59,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:59,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2018-11-06 19:52:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:59,026 INFO L225 Difference]: With dead ends: 2058 [2018-11-06 19:52:59,026 INFO L226 Difference]: Without dead ends: 1345 [2018-11-06 19:52:59,031 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-11-06 19:52:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-11-06 19:52:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-11-06 19:52:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-11-06 19:52:59,086 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 203 [2018-11-06 19:52:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:59,087 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-11-06 19:52:59,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-11-06 19:52:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-06 19:52:59,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:59,092 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:52:59,092 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:59,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:59,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1743599183, now seen corresponding path program 1 times [2018-11-06 19:52:59,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:59,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:59,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:59,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:59,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:52:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:59,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:59,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:59,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:59,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:59,355 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-11-06 19:53:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:02,724 INFO L93 Difference]: Finished difference Result 3891 states and 6117 transitions. [2018-11-06 19:53:02,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:02,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-06 19:53:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:02,744 INFO L225 Difference]: With dead ends: 3891 [2018-11-06 19:53:02,745 INFO L226 Difference]: Without dead ends: 2562 [2018-11-06 19:53:02,747 INFO L604 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-11-06 19:53:02,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2018-11-06 19:53:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2557. [2018-11-06 19:53:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2557 states. [2018-11-06 19:53:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3774 transitions. [2018-11-06 19:53:02,802 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3774 transitions. Word has length 211 [2018-11-06 19:53:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:02,803 INFO L480 AbstractCegarLoop]: Abstraction has 2557 states and 3774 transitions. [2018-11-06 19:53:02,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3774 transitions. [2018-11-06 19:53:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-06 19:53:02,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:02,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:02,813 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:02,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:02,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1812376770, now seen corresponding path program 1 times [2018-11-06 19:53:02,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:02,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:02,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:02,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:02,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:03,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:03,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:03,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:03,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:03,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:03,018 INFO L87 Difference]: Start difference. First operand 2557 states and 3774 transitions. Second operand 3 states. [2018-11-06 19:53:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:04,403 INFO L93 Difference]: Finished difference Result 6396 states and 9368 transitions. [2018-11-06 19:53:04,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:04,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-11-06 19:53:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:04,423 INFO L225 Difference]: With dead ends: 6396 [2018-11-06 19:53:04,423 INFO L226 Difference]: Without dead ends: 3841 [2018-11-06 19:53:04,427 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2018-11-06 19:53:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3837. [2018-11-06 19:53:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2018-11-06 19:53:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5572 transitions. [2018-11-06 19:53:04,498 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5572 transitions. Word has length 223 [2018-11-06 19:53:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:04,498 INFO L480 AbstractCegarLoop]: Abstraction has 3837 states and 5572 transitions. [2018-11-06 19:53:04,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5572 transitions. [2018-11-06 19:53:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-06 19:53:04,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:04,508 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:04,508 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:04,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:04,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1480172138, now seen corresponding path program 1 times [2018-11-06 19:53:04,509 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:04,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:04,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:04,847 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:53:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:05,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:53:05,007 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:53:05,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:05,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:53:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-06 19:53:05,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:53:05,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-11-06 19:53:05,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:53:05,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:53:05,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:53:05,390 INFO L87 Difference]: Start difference. First operand 3837 states and 5572 transitions. Second operand 6 states. [2018-11-06 19:53:06,159 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 19:53:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:13,433 INFO L93 Difference]: Finished difference Result 25612 states and 37422 transitions. [2018-11-06 19:53:13,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:53:13,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2018-11-06 19:53:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:13,523 INFO L225 Difference]: With dead ends: 25612 [2018-11-06 19:53:13,523 INFO L226 Difference]: Without dead ends: 21777 [2018-11-06 19:53:13,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:53:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21777 states. [2018-11-06 19:53:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21777 to 21749. [2018-11-06 19:53:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21749 states. [2018-11-06 19:53:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21749 states to 21749 states and 28388 transitions. [2018-11-06 19:53:13,940 INFO L78 Accepts]: Start accepts. Automaton has 21749 states and 28388 transitions. Word has length 231 [2018-11-06 19:53:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:13,940 INFO L480 AbstractCegarLoop]: Abstraction has 21749 states and 28388 transitions. [2018-11-06 19:53:13,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:53:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 21749 states and 28388 transitions. [2018-11-06 19:53:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-06 19:53:13,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:13,987 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:13,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:13,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:13,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1458638854, now seen corresponding path program 1 times [2018-11-06 19:53:13,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:13,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:13,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:13,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:13,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:14,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:14,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:14,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:14,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:14,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:14,235 INFO L87 Difference]: Start difference. First operand 21749 states and 28388 transitions. Second operand 3 states. [2018-11-06 19:53:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:15,827 INFO L93 Difference]: Finished difference Result 43170 states and 56423 transitions. [2018-11-06 19:53:15,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:15,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-11-06 19:53:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:15,867 INFO L225 Difference]: With dead ends: 43170 [2018-11-06 19:53:15,868 INFO L226 Difference]: Without dead ends: 21423 [2018-11-06 19:53:15,892 INFO L604 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-11-06 19:53:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21423 states. [2018-11-06 19:53:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21423 to 21416. [2018-11-06 19:53:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21416 states. [2018-11-06 19:53:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21416 states to 21416 states and 26340 transitions. [2018-11-06 19:53:16,203 INFO L78 Accepts]: Start accepts. Automaton has 21416 states and 26340 transitions. Word has length 245 [2018-11-06 19:53:16,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:16,204 INFO L480 AbstractCegarLoop]: Abstraction has 21416 states and 26340 transitions. [2018-11-06 19:53:16,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 21416 states and 26340 transitions. [2018-11-06 19:53:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-06 19:53:16,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:16,246 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:16,246 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:16,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:16,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1653105828, now seen corresponding path program 1 times [2018-11-06 19:53:16,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:16,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:16,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:16,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:16,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-06 19:53:16,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:16,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:16,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:16,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:16,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:16,425 INFO L87 Difference]: Start difference. First operand 21416 states and 26340 transitions. Second operand 3 states. [2018-11-06 19:53:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:18,361 INFO L93 Difference]: Finished difference Result 42750 states and 52566 transitions. [2018-11-06 19:53:18,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:18,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-06 19:53:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:18,406 INFO L225 Difference]: With dead ends: 42750 [2018-11-06 19:53:18,407 INFO L226 Difference]: Without dead ends: 21336 [2018-11-06 19:53:18,433 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21336 states. [2018-11-06 19:53:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21336 to 20724. [2018-11-06 19:53:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20724 states. [2018-11-06 19:53:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20724 states to 20724 states and 25148 transitions. [2018-11-06 19:53:18,884 INFO L78 Accepts]: Start accepts. Automaton has 20724 states and 25148 transitions. Word has length 261 [2018-11-06 19:53:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:18,884 INFO L480 AbstractCegarLoop]: Abstraction has 20724 states and 25148 transitions. [2018-11-06 19:53:18,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 20724 states and 25148 transitions. [2018-11-06 19:53:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-06 19:53:18,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:18,917 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:18,917 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:18,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:18,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1354619751, now seen corresponding path program 1 times [2018-11-06 19:53:18,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:18,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:18,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:18,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:19,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:19,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:53:19,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:53:19,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:53:19,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:19,382 INFO L87 Difference]: Start difference. First operand 20724 states and 25148 transitions. Second operand 5 states. [2018-11-06 19:53:21,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:21,866 INFO L93 Difference]: Finished difference Result 69861 states and 84598 transitions. [2018-11-06 19:53:21,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:53:21,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-11-06 19:53:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:21,940 INFO L225 Difference]: With dead ends: 69861 [2018-11-06 19:53:21,940 INFO L226 Difference]: Without dead ends: 49139 [2018-11-06 19:53:21,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49139 states. [2018-11-06 19:53:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49139 to 47904. [2018-11-06 19:53:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47904 states. [2018-11-06 19:53:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47904 states to 47904 states and 56703 transitions. [2018-11-06 19:53:22,518 INFO L78 Accepts]: Start accepts. Automaton has 47904 states and 56703 transitions. Word has length 266 [2018-11-06 19:53:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:22,519 INFO L480 AbstractCegarLoop]: Abstraction has 47904 states and 56703 transitions. [2018-11-06 19:53:22,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:53:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 47904 states and 56703 transitions. [2018-11-06 19:53:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-06 19:53:22,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:22,546 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:22,546 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:22,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1278485182, now seen corresponding path program 1 times [2018-11-06 19:53:22,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:22,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:22,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:23,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:23,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:23,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:23,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:23,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:23,253 INFO L87 Difference]: Start difference. First operand 47904 states and 56703 transitions. Second operand 4 states. [2018-11-06 19:53:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:25,795 INFO L93 Difference]: Finished difference Result 126994 states and 149971 transitions. [2018-11-06 19:53:25,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:25,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-11-06 19:53:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:25,879 INFO L225 Difference]: With dead ends: 126994 [2018-11-06 19:53:25,879 INFO L226 Difference]: Without dead ends: 79092 [2018-11-06 19:53:25,916 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79092 states. [2018-11-06 19:53:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79092 to 77664. [2018-11-06 19:53:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77664 states. [2018-11-06 19:53:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77664 states to 77664 states and 88158 transitions. [2018-11-06 19:53:26,706 INFO L78 Accepts]: Start accepts. Automaton has 77664 states and 88158 transitions. Word has length 285 [2018-11-06 19:53:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:26,707 INFO L480 AbstractCegarLoop]: Abstraction has 77664 states and 88158 transitions. [2018-11-06 19:53:26,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 77664 states and 88158 transitions. [2018-11-06 19:53:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-11-06 19:53:26,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:26,738 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:53:26,738 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:26,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:26,739 INFO L82 PathProgramCache]: Analyzing trace with hash -310432137, now seen corresponding path program 1 times [2018-11-06 19:53:26,739 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:26,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:26,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:26,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:26,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-06 19:53:27,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:27,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:53:27,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:53:27,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:53:27,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:27,051 INFO L87 Difference]: Start difference. First operand 77664 states and 88158 transitions. Second operand 5 states. [2018-11-06 19:53:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:29,979 INFO L93 Difference]: Finished difference Result 200561 states and 228116 transitions. [2018-11-06 19:53:29,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:53:29,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 343 [2018-11-06 19:53:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:30,108 INFO L225 Difference]: With dead ends: 200561 [2018-11-06 19:53:30,108 INFO L226 Difference]: Without dead ends: 122899 [2018-11-06 19:53:30,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122899 states. [2018-11-06 19:53:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122899 to 120193. [2018-11-06 19:53:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120193 states. [2018-11-06 19:53:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120193 states to 120193 states and 136330 transitions. [2018-11-06 19:53:31,353 INFO L78 Accepts]: Start accepts. Automaton has 120193 states and 136330 transitions. Word has length 343 [2018-11-06 19:53:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:31,353 INFO L480 AbstractCegarLoop]: Abstraction has 120193 states and 136330 transitions. [2018-11-06 19:53:31,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:53:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 120193 states and 136330 transitions. [2018-11-06 19:53:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-06 19:53:31,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:31,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:31,399 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:31,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1887185285, now seen corresponding path program 1 times [2018-11-06 19:53:31,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:31,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:31,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:31,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:31,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:31,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:31,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:31,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:31,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:31,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:31,955 INFO L87 Difference]: Start difference. First operand 120193 states and 136330 transitions. Second operand 4 states. [2018-11-06 19:53:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:35,056 INFO L93 Difference]: Finished difference Result 253863 states and 287648 transitions. [2018-11-06 19:53:35,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:35,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2018-11-06 19:53:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:35,192 INFO L225 Difference]: With dead ends: 253863 [2018-11-06 19:53:35,192 INFO L226 Difference]: Without dead ends: 133670 [2018-11-06 19:53:35,254 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133670 states. [2018-11-06 19:53:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133670 to 125701. [2018-11-06 19:53:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125701 states. [2018-11-06 19:53:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125701 states to 125701 states and 142381 transitions. [2018-11-06 19:53:36,327 INFO L78 Accepts]: Start accepts. Automaton has 125701 states and 142381 transitions. Word has length 346 [2018-11-06 19:53:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:36,327 INFO L480 AbstractCegarLoop]: Abstraction has 125701 states and 142381 transitions. [2018-11-06 19:53:36,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 125701 states and 142381 transitions. [2018-11-06 19:53:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-11-06 19:53:36,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:36,355 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:53:36,356 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:36,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:36,356 INFO L82 PathProgramCache]: Analyzing trace with hash -308493581, now seen corresponding path program 1 times [2018-11-06 19:53:36,356 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:36,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:36,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:36,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:36,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-06 19:53:36,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:36,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:36,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:36,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:36,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:36,766 INFO L87 Difference]: Start difference. First operand 125701 states and 142381 transitions. Second operand 4 states. [2018-11-06 19:53:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:40,157 INFO L93 Difference]: Finished difference Result 383508 states and 430610 transitions. [2018-11-06 19:53:40,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:40,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-11-06 19:53:40,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:40,397 INFO L225 Difference]: With dead ends: 383508 [2018-11-06 19:53:40,397 INFO L226 Difference]: Without dead ends: 257809 [2018-11-06 19:53:40,476 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257809 states. [2018-11-06 19:53:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257809 to 199723. [2018-11-06 19:53:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199723 states. [2018-11-06 19:53:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199723 states to 199723 states and 222879 transitions. [2018-11-06 19:53:43,931 INFO L78 Accepts]: Start accepts. Automaton has 199723 states and 222879 transitions. Word has length 351 [2018-11-06 19:53:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:43,931 INFO L480 AbstractCegarLoop]: Abstraction has 199723 states and 222879 transitions. [2018-11-06 19:53:43,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 199723 states and 222879 transitions. [2018-11-06 19:53:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-11-06 19:53:43,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:43,971 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-11-06 19:53:43,971 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:43,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:43,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2131786340, now seen corresponding path program 1 times [2018-11-06 19:53:43,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:43,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:43,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:43,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:43,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:44,638 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-06 19:53:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-06 19:53:44,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:44,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:53:44,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:53:44,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:53:44,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:44,791 INFO L87 Difference]: Start difference. First operand 199723 states and 222879 transitions. Second operand 5 states. [2018-11-06 19:53:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:50,790 INFO L93 Difference]: Finished difference Result 920219 states and 1025126 transitions. [2018-11-06 19:53:50,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:53:50,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 372 [2018-11-06 19:53:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:53,606 INFO L225 Difference]: With dead ends: 920219 [2018-11-06 19:53:53,606 INFO L226 Difference]: Without dead ends: 720498 [2018-11-06 19:53:53,774 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720498 states. [2018-11-06 19:54:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720498 to 521142. [2018-11-06 19:54:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521142 states. [2018-11-06 19:54:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521142 states to 521142 states and 579669 transitions. [2018-11-06 19:54:09,505 INFO L78 Accepts]: Start accepts. Automaton has 521142 states and 579669 transitions. Word has length 372 [2018-11-06 19:54:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:09,506 INFO L480 AbstractCegarLoop]: Abstraction has 521142 states and 579669 transitions. [2018-11-06 19:54:09,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:54:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 521142 states and 579669 transitions. [2018-11-06 19:54:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-11-06 19:54:09,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:09,542 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-11-06 19:54:09,542 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:09,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:09,542 INFO L82 PathProgramCache]: Analyzing trace with hash -656143452, now seen corresponding path program 1 times [2018-11-06 19:54:09,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:09,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:09,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:09,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:09,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-06 19:54:09,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:09,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:09,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:09,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:09,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:09,784 INFO L87 Difference]: Start difference. First operand 521142 states and 579669 transitions. Second operand 4 states. [2018-11-06 19:54:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:15,873 INFO L93 Difference]: Finished difference Result 1051794 states and 1170526 transitions. [2018-11-06 19:54:15,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:54:15,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 401 [2018-11-06 19:54:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:16,477 INFO L225 Difference]: With dead ends: 1051794 [2018-11-06 19:54:16,478 INFO L226 Difference]: Without dead ends: 530654 [2018-11-06 19:54:16,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530654 states. [2018-11-06 19:54:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530654 to 522788. [2018-11-06 19:54:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522788 states. [2018-11-06 19:54:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522788 states to 522788 states and 580184 transitions. [2018-11-06 19:54:24,238 INFO L78 Accepts]: Start accepts. Automaton has 522788 states and 580184 transitions. Word has length 401 [2018-11-06 19:54:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:24,238 INFO L480 AbstractCegarLoop]: Abstraction has 522788 states and 580184 transitions. [2018-11-06 19:54:24,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:54:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 522788 states and 580184 transitions. [2018-11-06 19:54:24,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-11-06 19:54:24,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:24,288 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:54:24,288 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:24,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:24,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1619004822, now seen corresponding path program 1 times [2018-11-06 19:54:24,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:24,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:24,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:24,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-06 19:54:32,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:32,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:32,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:54:32,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:54:32,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:32,369 INFO L87 Difference]: Start difference. First operand 522788 states and 580184 transitions. Second operand 3 states. [2018-11-06 19:54:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:37,060 INFO L93 Difference]: Finished difference Result 1457648 states and 1614754 transitions. [2018-11-06 19:54:37,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:37,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 451 [2018-11-06 19:54:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:38,485 INFO L225 Difference]: With dead ends: 1457648 [2018-11-06 19:54:38,485 INFO L226 Difference]: Without dead ends: 934862 [2018-11-06 19:54:38,815 INFO L604 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-11-06 19:54:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934862 states. [2018-11-06 19:54:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934862 to 892015. [2018-11-06 19:54:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892015 states. [2018-11-06 19:54:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892015 states to 892015 states and 983556 transitions. [2018-11-06 19:54:53,452 INFO L78 Accepts]: Start accepts. Automaton has 892015 states and 983556 transitions. Word has length 451 [2018-11-06 19:54:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:53,453 INFO L480 AbstractCegarLoop]: Abstraction has 892015 states and 983556 transitions. [2018-11-06 19:54:53,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:54:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 892015 states and 983556 transitions. [2018-11-06 19:54:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-11-06 19:54:53,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:53,539 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:54:53,539 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:53,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:53,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1514659374, now seen corresponding path program 1 times [2018-11-06 19:54:53,540 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:53,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:53,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:53,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:53,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:53,985 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:54:54,402 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-11-06 19:55:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 337 proven. 29 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-06 19:55:03,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:55:03,213 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:55:03,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:03,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:55:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 256 proven. 115 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-06 19:55:03,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:55:03,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-11-06 19:55:03,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 19:55:03,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 19:55:03,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:55:03,754 INFO L87 Difference]: Start difference. First operand 892015 states and 983556 transitions. Second operand 12 states. [2018-11-06 19:55:04,553 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 20