java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label09_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 13:17:05,471 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 13:17:05,473 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 13:17:05,484 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 13:17:05,485 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 13:17:05,486 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 13:17:05,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 13:17:05,489 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 13:17:05,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 13:17:05,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 13:17:05,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 13:17:05,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 13:17:05,494 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 13:17:05,496 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 13:17:05,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 13:17:05,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 13:17:05,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 13:17:05,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 13:17:05,513 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 13:17:05,515 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 13:17:05,516 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 13:17:05,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 13:17:05,523 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 13:17:05,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 13:17:05,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 13:17:05,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 13:17:05,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 13:17:05,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 13:17:05,527 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 13:17:05,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 13:17:05,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 13:17:05,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 13:17:05,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 13:17:05,532 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 13:17:05,534 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 13:17:05,535 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 13:17:05,535 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 13:17:05,562 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 13:17:05,563 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 13:17:05,563 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 13:17:05,564 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 13:17:05,564 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 13:17:05,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 13:17:05,567 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 13:17:05,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 13:17:05,567 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 13:17:05,567 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 13:17:05,568 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 13:17:05,568 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 13:17:05,568 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 13:17:05,568 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 13:17:05,569 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 13:17:05,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 13:17:05,569 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 13:17:05,569 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 13:17:05,570 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 13:17:05,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:17:05,570 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 13:17:05,570 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 13:17:05,570 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 13:17:05,571 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 13:17:05,571 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 13:17:05,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 13:17:05,571 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 13:17:05,572 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 13:17:05,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 13:17:05,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 13:17:05,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 13:17:05,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 13:17:05,657 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 13:17:05,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label09_false-unreach-call.c [2018-10-24 13:17:05,718 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6fab61e1c/82212f2a3115464eb0a21609bcb4055d/FLAG2bdd15ed6 [2018-10-24 13:17:06,334 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 13:17:06,337 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label09_false-unreach-call.c [2018-10-24 13:17:06,361 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6fab61e1c/82212f2a3115464eb0a21609bcb4055d/FLAG2bdd15ed6 [2018-10-24 13:17:06,382 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6fab61e1c/82212f2a3115464eb0a21609bcb4055d [2018-10-24 13:17:06,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 13:17:06,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 13:17:06,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:06,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 13:17:06,404 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 13:17:06,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:06" (1/1) ... [2018-10-24 13:17:06,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@773f6349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:06, skipping insertion in model container [2018-10-24 13:17:06,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:06" (1/1) ... [2018-10-24 13:17:06,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 13:17:06,515 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 13:17:07,239 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:07,245 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 13:17:07,565 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:07,591 INFO L193 MainTranslator]: Completed translation [2018-10-24 13:17:07,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07 WrapperNode [2018-10-24 13:17:07,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:07,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:07,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 13:17:07,594 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 13:17:07,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07" (1/1) ... [2018-10-24 13:17:07,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07" (1/1) ... [2018-10-24 13:17:07,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:07,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 13:17:07,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 13:17:07,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 13:17:07,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07" (1/1) ... [2018-10-24 13:17:07,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07" (1/1) ... [2018-10-24 13:17:07,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07" (1/1) ... [2018-10-24 13:17:07,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07" (1/1) ... [2018-10-24 13:17:07,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07" (1/1) ... [2018-10-24 13:17:07,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07" (1/1) ... [2018-10-24 13:17:08,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07" (1/1) ... [2018-10-24 13:17:08,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 13:17:08,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 13:17:08,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 13:17:08,035 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 13:17:08,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:17:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 13:17:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 13:17:08,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 13:17:13,715 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 13:17:13,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:13 BoogieIcfgContainer [2018-10-24 13:17:13,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 13:17:13,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 13:17:13,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 13:17:13,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 13:17:13,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:17:06" (1/3) ... [2018-10-24 13:17:13,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be62fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:13, skipping insertion in model container [2018-10-24 13:17:13,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:07" (2/3) ... [2018-10-24 13:17:13,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be62fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:13, skipping insertion in model container [2018-10-24 13:17:13,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:13" (3/3) ... [2018-10-24 13:17:13,727 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label09_false-unreach-call.c [2018-10-24 13:17:13,738 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 13:17:13,751 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 13:17:13,769 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 13:17:13,807 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 13:17:13,808 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 13:17:13,809 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 13:17:13,809 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 13:17:13,809 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 13:17:13,809 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 13:17:13,809 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 13:17:13,809 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 13:17:13,810 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 13:17:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 13:17:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-24 13:17:13,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:13,854 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] [2018-10-24 13:17:13,857 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:13,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1638960046, now seen corresponding path program 1 times [2018-10-24 13:17:13,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:13,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:13,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:13,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:13,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:14,760 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 13:17:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:14,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:14,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:14,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:14,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:14,866 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 13:17:18,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:18,364 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-10-24 13:17:18,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:18,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-10-24 13:17:18,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:18,396 INFO L225 Difference]: With dead ends: 1072 [2018-10-24 13:17:18,396 INFO L226 Difference]: Without dead ends: 762 [2018-10-24 13:17:18,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-24 13:17:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-10-24 13:17:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-24 13:17:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-10-24 13:17:18,495 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 149 [2018-10-24 13:17:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:18,496 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-10-24 13:17:18,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-10-24 13:17:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-24 13:17:18,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:18,502 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:18,502 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:18,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:18,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1214440191, now seen corresponding path program 1 times [2018-10-24 13:17:18,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:18,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:18,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:18,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:18,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:18,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:18,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:18,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:18,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:18,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:18,834 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-10-24 13:17:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:22,530 INFO L93 Difference]: Finished difference Result 1917 states and 3253 transitions. [2018-10-24 13:17:22,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:22,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-10-24 13:17:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:22,540 INFO L225 Difference]: With dead ends: 1917 [2018-10-24 13:17:22,541 INFO L226 Difference]: Without dead ends: 1401 [2018-10-24 13:17:22,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-10-24 13:17:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 933. [2018-10-24 13:17:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-24 13:17:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-10-24 13:17:22,594 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 155 [2018-10-24 13:17:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:22,594 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-10-24 13:17:22,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-10-24 13:17:22,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-24 13:17:22,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:22,600 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] [2018-10-24 13:17:22,600 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:22,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1128204979, now seen corresponding path program 1 times [2018-10-24 13:17:22,601 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:22,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:22,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:22,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:22,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:22,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:22,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:22,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:22,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:22,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:22,713 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-10-24 13:17:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:26,046 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-10-24 13:17:26,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:26,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2018-10-24 13:17:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:26,057 INFO L225 Difference]: With dead ends: 2699 [2018-10-24 13:17:26,058 INFO L226 Difference]: Without dead ends: 1768 [2018-10-24 13:17:26,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-24 13:17:26,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-10-24 13:17:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-24 13:17:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-24 13:17:26,101 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 158 [2018-10-24 13:17:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:26,101 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-24 13:17:26,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-24 13:17:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-24 13:17:26,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:26,107 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-10-24 13:17:26,107 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:26,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:26,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1150975335, now seen corresponding path program 1 times [2018-10-24 13:17:26,108 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:26,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:26,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:26,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:26,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 13:17:26,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:26,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:26,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:26,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:26,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:26,258 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-10-24 13:17:27,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:27,560 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-10-24 13:17:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:27,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-10-24 13:17:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:27,582 INFO L225 Difference]: With dead ends: 4329 [2018-10-24 13:17:27,582 INFO L226 Difference]: Without dead ends: 2580 [2018-10-24 13:17:27,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-10-24 13:17:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-10-24 13:17:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-10-24 13:17:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-10-24 13:17:27,650 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 166 [2018-10-24 13:17:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:27,650 INFO L481 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-10-24 13:17:27,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-10-24 13:17:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 13:17:27,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:27,658 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:27,659 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:27,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash -687490482, now seen corresponding path program 1 times [2018-10-24 13:17:27,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:27,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:27,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:27,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 13:17:27,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:27,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:27,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:27,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:27,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:27,802 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-10-24 13:17:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:28,366 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-10-24 13:17:28,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:28,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-10-24 13:17:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:28,398 INFO L225 Difference]: With dead ends: 7713 [2018-10-24 13:17:28,398 INFO L226 Difference]: Without dead ends: 5136 [2018-10-24 13:17:28,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-10-24 13:17:28,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-10-24 13:17:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-10-24 13:17:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-10-24 13:17:28,508 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 172 [2018-10-24 13:17:28,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:28,508 INFO L481 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-10-24 13:17:28,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-10-24 13:17:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-24 13:17:28,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:28,518 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:28,518 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:28,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:28,520 INFO L82 PathProgramCache]: Analyzing trace with hash 541571989, now seen corresponding path program 1 times [2018-10-24 13:17:28,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:28,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:28,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:28,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:28,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-24 13:17:28,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:17:28,887 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:17:28,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:29,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:17:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 13:17:29,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:17:29,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-24 13:17:29,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:29,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:29,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:29,113 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-10-24 13:17:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:31,318 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-10-24 13:17:31,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:31,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-10-24 13:17:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:31,405 INFO L225 Difference]: With dead ends: 20487 [2018-10-24 13:17:31,405 INFO L226 Difference]: Without dead ends: 15356 [2018-10-24 13:17:31,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-10-24 13:17:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-10-24 13:17:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-10-24 13:17:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-10-24 13:17:31,660 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 181 [2018-10-24 13:17:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:31,660 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-10-24 13:17:31,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-10-24 13:17:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-24 13:17:31,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:31,675 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:31,675 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:31,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash -387527722, now seen corresponding path program 1 times [2018-10-24 13:17:31,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:31,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:31,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:31,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:31,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:32,240 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 13:17:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:32,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:32,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:17:32,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 13:17:32,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 13:17:32,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:17:32,297 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-10-24 13:17:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:35,310 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-10-24 13:17:35,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 13:17:35,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2018-10-24 13:17:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:35,350 INFO L225 Difference]: With dead ends: 23029 [2018-10-24 13:17:35,350 INFO L226 Difference]: Without dead ends: 12802 [2018-10-24 13:17:35,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:17:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-10-24 13:17:35,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-10-24 13:17:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-10-24 13:17:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-10-24 13:17:35,570 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 189 [2018-10-24 13:17:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:35,571 INFO L481 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-10-24 13:17:35,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 13:17:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-10-24 13:17:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-24 13:17:35,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:35,588 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:35,589 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:35,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1239035318, now seen corresponding path program 1 times [2018-10-24 13:17:35,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:35,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:35,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:36,093 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 13:17:36,343 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 13:17:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:36,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:17:36,630 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:17:36,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:36,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:17:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:17:36,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:17:36,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 13:17:36,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 13:17:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 13:17:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 13:17:36,824 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 7 states. [2018-10-24 13:17:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:43,723 INFO L93 Difference]: Finished difference Result 58087 states and 84612 transitions. [2018-10-24 13:17:43,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 13:17:43,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2018-10-24 13:17:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:43,792 INFO L225 Difference]: With dead ends: 58087 [2018-10-24 13:17:43,792 INFO L226 Difference]: Without dead ends: 47044 [2018-10-24 13:17:43,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-24 13:17:43,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47044 states. [2018-10-24 13:17:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47044 to 45802. [2018-10-24 13:17:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45802 states. [2018-10-24 13:17:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45802 states to 45802 states and 56728 transitions. [2018-10-24 13:17:44,574 INFO L78 Accepts]: Start accepts. Automaton has 45802 states and 56728 transitions. Word has length 199 [2018-10-24 13:17:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:44,574 INFO L481 AbstractCegarLoop]: Abstraction has 45802 states and 56728 transitions. [2018-10-24 13:17:44,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 13:17:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 45802 states and 56728 transitions. [2018-10-24 13:17:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-24 13:17:44,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:44,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:44,614 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:44,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1403738294, now seen corresponding path program 1 times [2018-10-24 13:17:44,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:44,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:44,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:44,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:44,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-24 13:17:44,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:44,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:44,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:44,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:44,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:44,765 INFO L87 Difference]: Start difference. First operand 45802 states and 56728 transitions. Second operand 3 states. [2018-10-24 13:17:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:47,293 INFO L93 Difference]: Finished difference Result 105278 states and 132483 transitions. [2018-10-24 13:17:47,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:47,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-24 13:17:47,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:47,379 INFO L225 Difference]: With dead ends: 105278 [2018-10-24 13:17:47,379 INFO L226 Difference]: Without dead ends: 59478 [2018-10-24 13:17:47,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59478 states. [2018-10-24 13:17:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59478 to 59470. [2018-10-24 13:17:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59470 states. [2018-10-24 13:17:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59470 states to 59470 states and 70980 transitions. [2018-10-24 13:17:48,062 INFO L78 Accepts]: Start accepts. Automaton has 59470 states and 70980 transitions. Word has length 211 [2018-10-24 13:17:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:48,063 INFO L481 AbstractCegarLoop]: Abstraction has 59470 states and 70980 transitions. [2018-10-24 13:17:48,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 59470 states and 70980 transitions. [2018-10-24 13:17:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-24 13:17:48,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:48,105 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:48,105 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:48,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:48,106 INFO L82 PathProgramCache]: Analyzing trace with hash -423272014, now seen corresponding path program 1 times [2018-10-24 13:17:48,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:48,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:48,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:48,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:48,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 13:17:48,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:48,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:48,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:48,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:48,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:48,689 INFO L87 Difference]: Start difference. First operand 59470 states and 70980 transitions. Second operand 3 states. [2018-10-24 13:17:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:49,634 INFO L93 Difference]: Finished difference Result 116382 states and 139036 transitions. [2018-10-24 13:17:49,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:49,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2018-10-24 13:17:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:49,693 INFO L225 Difference]: With dead ends: 116382 [2018-10-24 13:17:49,693 INFO L226 Difference]: Without dead ends: 56914 [2018-10-24 13:17:49,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56914 states. [2018-10-24 13:17:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56914 to 56914. [2018-10-24 13:17:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56914 states. [2018-10-24 13:17:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56914 states to 56914 states and 66991 transitions. [2018-10-24 13:17:50,286 INFO L78 Accepts]: Start accepts. Automaton has 56914 states and 66991 transitions. Word has length 232 [2018-10-24 13:17:50,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:50,287 INFO L481 AbstractCegarLoop]: Abstraction has 56914 states and 66991 transitions. [2018-10-24 13:17:50,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 56914 states and 66991 transitions. [2018-10-24 13:17:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-24 13:17:50,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:50,310 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:50,311 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:50,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash 65700242, now seen corresponding path program 1 times [2018-10-24 13:17:50,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:50,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:50,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:50,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:50,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:50,550 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:17:50,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:50,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:50,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:50,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:50,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:50,551 INFO L87 Difference]: Start difference. First operand 56914 states and 66991 transitions. Second operand 4 states. [2018-10-24 13:17:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:52,915 INFO L93 Difference]: Finished difference Result 164183 states and 193655 transitions. [2018-10-24 13:17:52,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:52,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2018-10-24 13:17:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:53,037 INFO L225 Difference]: With dead ends: 164183 [2018-10-24 13:17:53,037 INFO L226 Difference]: Without dead ends: 107271 [2018-10-24 13:17:53,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107271 states. [2018-10-24 13:17:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107271 to 107269. [2018-10-24 13:17:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107269 states. [2018-10-24 13:17:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107269 states to 107269 states and 126518 transitions. [2018-10-24 13:17:54,083 INFO L78 Accepts]: Start accepts. Automaton has 107269 states and 126518 transitions. Word has length 252 [2018-10-24 13:17:54,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:54,084 INFO L481 AbstractCegarLoop]: Abstraction has 107269 states and 126518 transitions. [2018-10-24 13:17:54,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 107269 states and 126518 transitions. [2018-10-24 13:17:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-24 13:17:54,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:54,104 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:54,104 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:54,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash -508054516, now seen corresponding path program 1 times [2018-10-24 13:17:54,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:54,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:54,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-24 13:17:54,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:54,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:54,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:54,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:54,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:54,478 INFO L87 Difference]: Start difference. First operand 107269 states and 126518 transitions. Second operand 4 states. [2018-10-24 13:17:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:57,201 INFO L93 Difference]: Finished difference Result 342982 states and 403342 transitions. [2018-10-24 13:17:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:57,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2018-10-24 13:17:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:58,683 INFO L225 Difference]: With dead ends: 342982 [2018-10-24 13:17:58,683 INFO L226 Difference]: Without dead ends: 235715 [2018-10-24 13:17:58,735 INFO L605 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-10-24 13:17:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235715 states. [2018-10-24 13:18:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235715 to 176416. [2018-10-24 13:18:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176416 states. [2018-10-24 13:18:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176416 states to 176416 states and 206181 transitions. [2018-10-24 13:18:00,753 INFO L78 Accepts]: Start accepts. Automaton has 176416 states and 206181 transitions. Word has length 290 [2018-10-24 13:18:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:00,753 INFO L481 AbstractCegarLoop]: Abstraction has 176416 states and 206181 transitions. [2018-10-24 13:18:00,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 176416 states and 206181 transitions. [2018-10-24 13:18:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-24 13:18:00,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:00,788 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:00,789 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:00,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:00,789 INFO L82 PathProgramCache]: Analyzing trace with hash 181568895, now seen corresponding path program 1 times [2018-10-24 13:18:00,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:00,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:00,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:00,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:00,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 13:18:01,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:01,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:18:01,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:01,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:01,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:01,095 INFO L87 Difference]: Start difference. First operand 176416 states and 206181 transitions. Second operand 3 states. [2018-10-24 13:18:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:04,470 INFO L93 Difference]: Finished difference Result 492155 states and 576041 transitions. [2018-10-24 13:18:04,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:04,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-10-24 13:18:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:04,891 INFO L225 Difference]: With dead ends: 492155 [2018-10-24 13:18:04,891 INFO L226 Difference]: Without dead ends: 315741 [2018-10-24 13:18:05,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315741 states. [2018-10-24 13:18:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315741 to 315735. [2018-10-24 13:18:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315735 states. [2018-10-24 13:18:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315735 states to 315735 states and 369658 transitions. [2018-10-24 13:18:09,988 INFO L78 Accepts]: Start accepts. Automaton has 315735 states and 369658 transitions. Word has length 303 [2018-10-24 13:18:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:09,989 INFO L481 AbstractCegarLoop]: Abstraction has 315735 states and 369658 transitions. [2018-10-24 13:18:09,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 315735 states and 369658 transitions. [2018-10-24 13:18:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-24 13:18:10,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:10,027 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:10,027 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:10,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:10,028 INFO L82 PathProgramCache]: Analyzing trace with hash -839453957, now seen corresponding path program 1 times [2018-10-24 13:18:10,028 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:10,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:10,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:10,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:10,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 200 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 13:18:10,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:18:10,393 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:18:10,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:10,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:18:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-24 13:18:10,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:18:10,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 13:18:10,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 13:18:10,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 13:18:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:18:10,638 INFO L87 Difference]: Start difference. First operand 315735 states and 369658 transitions. Second operand 5 states. [2018-10-24 13:18:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:19,961 INFO L93 Difference]: Finished difference Result 648344 states and 761187 transitions. [2018-10-24 13:18:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:19,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 311 [2018-10-24 13:18:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:20,432 INFO L225 Difference]: With dead ends: 648344 [2018-10-24 13:18:20,432 INFO L226 Difference]: Without dead ends: 332611 [2018-10-24 13:18:20,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:18:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332611 states. [2018-10-24 13:18:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332611 to 317091. [2018-10-24 13:18:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317091 states. [2018-10-24 13:18:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317091 states to 317091 states and 367632 transitions. [2018-10-24 13:18:26,163 INFO L78 Accepts]: Start accepts. Automaton has 317091 states and 367632 transitions. Word has length 311 [2018-10-24 13:18:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:26,164 INFO L481 AbstractCegarLoop]: Abstraction has 317091 states and 367632 transitions. [2018-10-24 13:18:26,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 13:18:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 317091 states and 367632 transitions. [2018-10-24 13:18:26,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-24 13:18:26,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:26,202 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-24 13:18:26,202 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:26,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash 491571747, now seen corresponding path program 1 times [2018-10-24 13:18:26,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:26,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:26,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:26,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:26,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-10-24 13:18:26,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:26,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:18:26,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:26,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:26,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:26,462 INFO L87 Difference]: Start difference. First operand 317091 states and 367632 transitions. Second operand 3 states. [2018-10-24 13:18:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:31,138 INFO L93 Difference]: Finished difference Result 634164 states and 735246 transitions. [2018-10-24 13:18:31,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:31,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2018-10-24 13:18:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:31,615 INFO L225 Difference]: With dead ends: 634164 [2018-10-24 13:18:31,615 INFO L226 Difference]: Without dead ends: 317075 [2018-10-24 13:18:31,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317075 states. [2018-10-24 13:18:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317075 to 317075. [2018-10-24 13:18:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317075 states. [2018-10-24 13:18:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317075 states to 317075 states and 367600 transitions. [2018-10-24 13:18:36,876 INFO L78 Accepts]: Start accepts. Automaton has 317075 states and 367600 transitions. Word has length 342 [2018-10-24 13:18:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:36,876 INFO L481 AbstractCegarLoop]: Abstraction has 317075 states and 367600 transitions. [2018-10-24 13:18:36,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 317075 states and 367600 transitions. [2018-10-24 13:18:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-24 13:18:36,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:36,912 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:18:36,913 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:36,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:36,913 INFO L82 PathProgramCache]: Analyzing trace with hash 977755767, now seen corresponding path program 1 times [2018-10-24 13:18:36,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:36,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:36,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-10-24 13:18:37,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:37,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:37,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:37,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:37,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:37,154 INFO L87 Difference]: Start difference. First operand 317075 states and 367600 transitions. Second operand 3 states. [2018-10-24 13:18:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:44,190 INFO L93 Difference]: Finished difference Result 600564 states and 695026 transitions. [2018-10-24 13:18:44,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:44,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2018-10-24 13:18:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:44,511 INFO L225 Difference]: With dead ends: 600564 [2018-10-24 13:18:44,511 INFO L226 Difference]: Without dead ends: 283491 [2018-10-24 13:18:44,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283491 states. [2018-10-24 13:18:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283491 to 283483. [2018-10-24 13:18:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283483 states. [2018-10-24 13:18:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283483 states to 283483 states and 315764 transitions. [2018-10-24 13:18:49,321 INFO L78 Accepts]: Start accepts. Automaton has 283483 states and 315764 transitions. Word has length 351 [2018-10-24 13:18:49,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:49,321 INFO L481 AbstractCegarLoop]: Abstraction has 283483 states and 315764 transitions. [2018-10-24 13:18:49,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 283483 states and 315764 transitions. [2018-10-24 13:18:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-24 13:18:49,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:49,367 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:18:49,367 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:49,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash -272507335, now seen corresponding path program 1 times [2018-10-24 13:18:49,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:49,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:49,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:49,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-10-24 13:18:49,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:49,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:49,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:49,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:49,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:49,718 INFO L87 Difference]: Start difference. First operand 283483 states and 315764 transitions. Second operand 4 states. [2018-10-24 13:18:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:53,123 INFO L93 Difference]: Finished difference Result 565808 states and 630708 transitions. [2018-10-24 13:18:53,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:53,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 358 [2018-10-24 13:18:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:53,474 INFO L225 Difference]: With dead ends: 565808 [2018-10-24 13:18:53,475 INFO L226 Difference]: Without dead ends: 282327 [2018-10-24 13:18:54,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282327 states. [2018-10-24 13:18:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282327 to 278993. [2018-10-24 13:18:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278993 states. [2018-10-24 13:18:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278993 states to 278993 states and 307155 transitions. [2018-10-24 13:18:58,487 INFO L78 Accepts]: Start accepts. Automaton has 278993 states and 307155 transitions. Word has length 358 [2018-10-24 13:18:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:58,488 INFO L481 AbstractCegarLoop]: Abstraction has 278993 states and 307155 transitions. [2018-10-24 13:18:58,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 278993 states and 307155 transitions. [2018-10-24 13:18:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-24 13:18:58,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:58,520 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:58,520 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:58,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:58,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1584353577, now seen corresponding path program 1 times [2018-10-24 13:18:58,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:58,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:58,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:58,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:58,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-24 13:18:58,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:58,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:18:58,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:58,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:58,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:58,867 INFO L87 Difference]: Start difference. First operand 278993 states and 307155 transitions. Second operand 4 states. [2018-10-24 13:19:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:02,729 INFO L93 Difference]: Finished difference Result 524999 states and 577635 transitions. [2018-10-24 13:19:02,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:19:02,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2018-10-24 13:19:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:03,047 INFO L225 Difference]: With dead ends: 524999 [2018-10-24 13:19:03,047 INFO L226 Difference]: Without dead ends: 246008 [2018-10-24 13:19:03,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246008 states. [2018-10-24 13:19:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246008 to 245992. [2018-10-24 13:19:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245992 states. [2018-10-24 13:19:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245992 states to 245992 states and 266429 transitions. [2018-10-24 13:19:07,198 INFO L78 Accepts]: Start accepts. Automaton has 245992 states and 266429 transitions. Word has length 371 [2018-10-24 13:19:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:07,199 INFO L481 AbstractCegarLoop]: Abstraction has 245992 states and 266429 transitions. [2018-10-24 13:19:07,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:19:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 245992 states and 266429 transitions. [2018-10-24 13:19:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-24 13:19:07,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:07,270 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 13:19:07,270 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:07,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:07,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1548582743, now seen corresponding path program 1 times [2018-10-24 13:19:07,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:07,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:07,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:07,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:07,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-10-24 13:19:08,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:19:08,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:19:08,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:19:08,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:19:08,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:08,717 INFO L87 Difference]: Start difference. First operand 245992 states and 266429 transitions. Second operand 4 states. [2018-10-24 13:19:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:12,353 INFO L93 Difference]: Finished difference Result 488924 states and 529642 transitions. [2018-10-24 13:19:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:19:12,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 464 [2018-10-24 13:19:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:12,606 INFO L225 Difference]: With dead ends: 488924 [2018-10-24 13:19:12,606 INFO L226 Difference]: Without dead ends: 242934 [2018-10-24 13:19:12,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242934 states. [2018-10-24 13:19:20,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242934 to 242918. [2018-10-24 13:19:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242918 states. [2018-10-24 13:19:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242918 states to 242918 states and 260054 transitions. [2018-10-24 13:19:21,030 INFO L78 Accepts]: Start accepts. Automaton has 242918 states and 260054 transitions. Word has length 464 [2018-10-24 13:19:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:21,030 INFO L481 AbstractCegarLoop]: Abstraction has 242918 states and 260054 transitions. [2018-10-24 13:19:21,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:19:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 242918 states and 260054 transitions. [2018-10-24 13:19:21,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-24 13:19:21,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:21,106 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:19:21,106 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:21,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:21,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1908180572, now seen corresponding path program 1 times [2018-10-24 13:19:21,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:21,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:21,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:21,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:21,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 439 proven. 173 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 13:19:22,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:19:22,842 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:19:22,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:23,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:19:23,493 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-24 13:19:23,947 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-24 13:19:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 583 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 13:19:25,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 13:19:25,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2018-10-24 13:19:25,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 13:19:25,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 13:19:25,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-10-24 13:19:25,293 INFO L87 Difference]: Start difference. First operand 242918 states and 260054 transitions. Second operand 14 states. [2018-10-24 13:19:25,508 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-10-24 13:19:33,284 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-10-24 13:19:44,443 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-10-24 13:19:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:51,762 INFO L93 Difference]: Finished difference Result 1246156 states and 1329612 transitions. [2018-10-24 13:19:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-24 13:19:51,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 486 [2018-10-24 13:19:51,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:54,199 INFO L225 Difference]: With dead ends: 1246156 [2018-10-24 13:19:54,200 INFO L226 Difference]: Without dead ends: 1003240 [2018-10-24 13:19:54,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 482 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=595, Invalid=1661, Unknown=0, NotChecked=0, Total=2256 [2018-10-24 13:19:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003240 states. [2018-10-24 13:20:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003240 to 891046. [2018-10-24 13:20:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891046 states. [2018-10-24 13:20:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891046 states to 891046 states and 953593 transitions. [2018-10-24 13:20:10,988 INFO L78 Accepts]: Start accepts. Automaton has 891046 states and 953593 transitions. Word has length 486 [2018-10-24 13:20:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:20:10,989 INFO L481 AbstractCegarLoop]: Abstraction has 891046 states and 953593 transitions. [2018-10-24 13:20:10,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 13:20:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 891046 states and 953593 transitions. [2018-10-24 13:20:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-10-24 13:20:11,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:20:11,088 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:20:11,088 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:20:11,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:20:11,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1489684767, now seen corresponding path program 1 times [2018-10-24 13:20:11,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:20:11,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:20:11,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:20:11,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:20:11,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:20:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:20:11,578 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 13:20:11,825 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2018-10-24 13:20:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 407 proven. 63 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-24 13:20:20,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:20:20,806 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:20:20,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:20:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:20:21,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:20:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-24 13:20:21,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:20:21,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 13:20:21,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 13:20:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 13:20:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-24 13:20:21,520 INFO L87 Difference]: Start difference. First operand 891046 states and 953593 transitions. Second operand 9 states. Received shutdown request... [2018-10-24 13:20:33,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 13:20:33,990 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 13:20:33,997 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 13:20:33,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:20:33 BoogieIcfgContainer [2018-10-24 13:20:33,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 13:20:33,998 INFO L168 Benchmark]: Toolchain (without parser) took 207603.03 ms. Allocated memory was 1.5 GB in the beginning and 6.1 GB in the end (delta: 4.6 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-24 13:20:34,000 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 13:20:34,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1193.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:34,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 317.22 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 730.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -851.5 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:34,002 INFO L168 Benchmark]: Boogie Preprocessor took 123.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:34,002 INFO L168 Benchmark]: RCFGBuilder took 5681.20 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 255.0 MB). Peak memory consumption was 255.0 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:34,003 INFO L168 Benchmark]: TraceAbstraction took 200280.47 ms. Allocated memory was 2.2 GB in the beginning and 6.1 GB in the end (delta: 3.9 GB). Free memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-24 13:20:34,008 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1193.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 317.22 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 730.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -851.5 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5681.20 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 255.0 MB). Peak memory consumption was 255.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 200280.47 ms. Allocated memory was 2.2 GB in the beginning and 6.1 GB in the end (delta: 3.9 GB). Free memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1479]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1479). Cancelled while BasicCegarLoop was constructing difference of abstraction (891046states) and FLOYD_HOARE automaton (currently 15 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (1162819 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 200.1s OverallTime, 21 OverallIterations, 8 TraceHistogramMax, 117.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5341 SDtfs, 18876 SDslu, 5671 SDs, 0 SdLazy, 34421 SolverSat, 5987 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1793 GetRequests, 1683 SyntacticMatches, 9 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=891046occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 58.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 199262 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 7491 NumberOfCodeBlocks, 7491 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 7465 ConstructedInterpolants, 0 QuantifiedInterpolants, 12656903 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2961 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 6344/6631 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown