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_label12_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:53:54,647 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:53:54,650 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:53:54,662 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:53:54,662 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:53:54,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:53:54,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:53:54,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:53:54,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:53:54,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:53:54,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:53:54,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:53:54,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:53:54,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:53:54,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:53:54,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:53:54,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:53:54,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:53:54,678 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:53:54,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:53:54,681 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:53:54,682 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:53:54,685 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:53:54,685 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:53:54,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:53:54,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:53:54,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:53:54,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:53:54,690 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:53:54,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:53:54,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:53:54,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:53:54,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:53:54,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:53:54,693 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:53:54,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:53:54,694 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:53:54,710 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:53:54,710 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:53:54,711 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:53:54,711 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:53:54,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:53:54,712 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:53:54,713 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:53:54,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:53:54,713 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:53:54,713 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:53:54,714 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:53:54,714 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:53:54,714 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:53:54,714 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:53:54,715 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:53:54,715 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:53:54,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:53:54,715 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:53:54,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:53:54,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:54,716 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:53:54,716 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:53:54,717 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:53:54,717 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:53:54,717 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:53:54,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:53:54,717 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:53:54,718 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:53:54,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:53:54,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:53:54,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:53:54,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:53:54,779 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:53:54,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label12_true-unreach-call.c [2018-10-24 14:53:54,835 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/01b18e01a/5251d74a33624824a3e088a7b1e2d17b/FLAG077193b90 [2018-10-24 14:53:55,470 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:53:55,471 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label12_true-unreach-call.c [2018-10-24 14:53:55,491 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/01b18e01a/5251d74a33624824a3e088a7b1e2d17b/FLAG077193b90 [2018-10-24 14:53:55,506 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/01b18e01a/5251d74a33624824a3e088a7b1e2d17b [2018-10-24 14:53:55,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:53:55,518 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:53:55,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:55,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:53:55,523 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:53:55,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:55" (1/1) ... [2018-10-24 14:53:55,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bedfbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:55, skipping insertion in model container [2018-10-24 14:53:55,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:55" (1/1) ... [2018-10-24 14:53:55,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:53:55,639 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:53:56,387 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:56,392 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:53:56,709 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:56,732 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:53:56,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56 WrapperNode [2018-10-24 14:53:56,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:56,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:56,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:53:56,735 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:53:56,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:56,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:57,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:53:57,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:53:57,035 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:53:57,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:53:57,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:53:57,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:53:57,166 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:53:57,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:53:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:53:57,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:54:03,054 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:54:03,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:54:03 BoogieIcfgContainer [2018-10-24 14:54:03,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:54:03,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:54:03,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:54:03,060 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:54:03,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:53:55" (1/3) ... [2018-10-24 14:54:03,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721fb068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:54:03, skipping insertion in model container [2018-10-24 14:54:03,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (2/3) ... [2018-10-24 14:54:03,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721fb068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:54:03, skipping insertion in model container [2018-10-24 14:54:03,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:54:03" (3/3) ... [2018-10-24 14:54:03,064 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label12_true-unreach-call.c [2018-10-24 14:54:03,074 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:54:03,083 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:54:03,101 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:54:03,138 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:54:03,139 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:54:03,140 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:54:03,140 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:54:03,140 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:54:03,140 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:54:03,140 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:54:03,140 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:54:03,141 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:54:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:54:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-24 14:54:03,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:03,187 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:03,189 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:03,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:03,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2121673340, now seen corresponding path program 1 times [2018-10-24 14:54:03,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:03,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:03,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:03,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:03,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:04,053 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:54:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:04,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:04,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:04,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:04,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:04,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:04,176 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:54:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:07,904 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-10-24 14:54:07,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:07,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-10-24 14:54:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:07,931 INFO L225 Difference]: With dead ends: 1072 [2018-10-24 14:54:07,932 INFO L226 Difference]: Without dead ends: 762 [2018-10-24 14:54:07,937 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 14:54:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-24 14:54:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-10-24 14:54:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-24 14:54:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-10-24 14:54:08,034 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 164 [2018-10-24 14:54:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:08,035 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-10-24 14:54:08,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:08,035 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-10-24 14:54:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-24 14:54:08,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:08,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:08,042 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:08,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:08,043 INFO L82 PathProgramCache]: Analyzing trace with hash -252847883, now seen corresponding path program 1 times [2018-10-24 14:54:08,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:08,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:08,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:08,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:08,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:08,284 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 14:54:08,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:08,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:08,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:08,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:08,288 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-10-24 14:54:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:11,158 INFO L93 Difference]: Finished difference Result 1918 states and 3253 transitions. [2018-10-24 14:54:11,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:11,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-10-24 14:54:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:11,168 INFO L225 Difference]: With dead ends: 1918 [2018-10-24 14:54:11,169 INFO L226 Difference]: Without dead ends: 1402 [2018-10-24 14:54:11,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-10-24 14:54:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 933. [2018-10-24 14:54:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-24 14:54:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-10-24 14:54:11,209 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 170 [2018-10-24 14:54:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:11,210 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-10-24 14:54:11,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-10-24 14:54:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-24 14:54:11,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:11,217 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:11,218 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:11,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1895862531, now seen corresponding path program 1 times [2018-10-24 14:54:11,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:11,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:11,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:11,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:11,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:11,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:11,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:11,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:11,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:11,338 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-10-24 14:54:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:13,863 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-10-24 14:54:13,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:13,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-10-24 14:54:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:13,874 INFO L225 Difference]: With dead ends: 2699 [2018-10-24 14:54:13,874 INFO L226 Difference]: Without dead ends: 1768 [2018-10-24 14:54:13,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-24 14:54:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-10-24 14:54:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-24 14:54:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-24 14:54:13,916 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 173 [2018-10-24 14:54:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:13,916 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-24 14:54:13,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-24 14:54:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-24 14:54:13,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:13,922 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:13,922 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:13,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:13,923 INFO L82 PathProgramCache]: Analyzing trace with hash 407532060, now seen corresponding path program 1 times [2018-10-24 14:54:13,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:13,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:13,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:13,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:13,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:14,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:14,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:14,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:14,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:14,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:14,130 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 4 states. [2018-10-24 14:54:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:17,309 INFO L93 Difference]: Finished difference Result 6814 states and 10581 transitions. [2018-10-24 14:54:17,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:17,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-24 14:54:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:17,334 INFO L225 Difference]: With dead ends: 6814 [2018-10-24 14:54:17,335 INFO L226 Difference]: Without dead ends: 5065 [2018-10-24 14:54:17,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2018-10-24 14:54:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 3388. [2018-10-24 14:54:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-10-24 14:54:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4947 transitions. [2018-10-24 14:54:17,422 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4947 transitions. Word has length 180 [2018-10-24 14:54:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:17,423 INFO L481 AbstractCegarLoop]: Abstraction has 3388 states and 4947 transitions. [2018-10-24 14:54:17,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4947 transitions. [2018-10-24 14:54:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-24 14:54:17,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:17,431 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:17,431 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:17,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1147609385, now seen corresponding path program 1 times [2018-10-24 14:54:17,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:17,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:17,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:17,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:17,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:17,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:17,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:17,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:17,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:17,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:17,677 INFO L87 Difference]: Start difference. First operand 3388 states and 4947 transitions. Second operand 3 states. [2018-10-24 14:54:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:19,232 INFO L93 Difference]: Finished difference Result 6782 states and 9907 transitions. [2018-10-24 14:54:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:19,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2018-10-24 14:54:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:19,250 INFO L225 Difference]: With dead ends: 6782 [2018-10-24 14:54:19,250 INFO L226 Difference]: Without dead ends: 3396 [2018-10-24 14:54:19,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2018-10-24 14:54:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3388. [2018-10-24 14:54:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-10-24 14:54:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4647 transitions. [2018-10-24 14:54:19,319 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4647 transitions. Word has length 181 [2018-10-24 14:54:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:19,320 INFO L481 AbstractCegarLoop]: Abstraction has 3388 states and 4647 transitions. [2018-10-24 14:54:19,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4647 transitions. [2018-10-24 14:54:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-24 14:54:19,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:19,328 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:19,328 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:19,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1815897247, now seen corresponding path program 1 times [2018-10-24 14:54:19,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:19,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:19,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:19,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:19,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:19,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:19,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:19,468 INFO L87 Difference]: Start difference. First operand 3388 states and 4647 transitions. Second operand 3 states. [2018-10-24 14:54:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:20,987 INFO L93 Difference]: Finished difference Result 10041 states and 13801 transitions. [2018-10-24 14:54:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:20,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-24 14:54:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:21,010 INFO L225 Difference]: With dead ends: 10041 [2018-10-24 14:54:21,011 INFO L226 Difference]: Without dead ends: 6655 [2018-10-24 14:54:21,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6655 states. [2018-10-24 14:54:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6655 to 6652. [2018-10-24 14:54:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6652 states. [2018-10-24 14:54:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 8357 transitions. [2018-10-24 14:54:21,134 INFO L78 Accepts]: Start accepts. Automaton has 6652 states and 8357 transitions. Word has length 188 [2018-10-24 14:54:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:21,135 INFO L481 AbstractCegarLoop]: Abstraction has 6652 states and 8357 transitions. [2018-10-24 14:54:21,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 6652 states and 8357 transitions. [2018-10-24 14:54:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-24 14:54:21,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:21,148 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:21,148 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:21,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1150111061, now seen corresponding path program 1 times [2018-10-24 14:54:21,149 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:21,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:21,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:54:21,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:21,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:21,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:21,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:21,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:21,329 INFO L87 Difference]: Start difference. First operand 6652 states and 8357 transitions. Second operand 3 states. [2018-10-24 14:54:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:22,246 INFO L93 Difference]: Finished difference Result 13270 states and 16669 transitions. [2018-10-24 14:54:22,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:22,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-24 14:54:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:22,274 INFO L225 Difference]: With dead ends: 13270 [2018-10-24 14:54:22,274 INFO L226 Difference]: Without dead ends: 6620 [2018-10-24 14:54:22,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6620 states. [2018-10-24 14:54:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6620 to 6620. [2018-10-24 14:54:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2018-10-24 14:54:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 8174 transitions. [2018-10-24 14:54:22,415 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 8174 transitions. Word has length 202 [2018-10-24 14:54:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:22,416 INFO L481 AbstractCegarLoop]: Abstraction has 6620 states and 8174 transitions. [2018-10-24 14:54:22,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 8174 transitions. [2018-10-24 14:54:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-24 14:54:22,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:22,430 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:22,431 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:22,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash 328527330, now seen corresponding path program 1 times [2018-10-24 14:54:22,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:22,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:22,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:22,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:22,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:22,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:22,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:22,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:22,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:22,710 INFO L87 Difference]: Start difference. First operand 6620 states and 8174 transitions. Second operand 3 states. [2018-10-24 14:54:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:24,134 INFO L93 Difference]: Finished difference Result 16094 states and 20196 transitions. [2018-10-24 14:54:24,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:24,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-10-24 14:54:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:24,160 INFO L225 Difference]: With dead ends: 16094 [2018-10-24 14:54:24,161 INFO L226 Difference]: Without dead ends: 9476 [2018-10-24 14:54:24,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9476 states. [2018-10-24 14:54:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9476 to 9476. [2018-10-24 14:54:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9476 states. [2018-10-24 14:54:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9476 states to 9476 states and 11228 transitions. [2018-10-24 14:54:24,298 INFO L78 Accepts]: Start accepts. Automaton has 9476 states and 11228 transitions. Word has length 213 [2018-10-24 14:54:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:24,298 INFO L481 AbstractCegarLoop]: Abstraction has 9476 states and 11228 transitions. [2018-10-24 14:54:24,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 9476 states and 11228 transitions. [2018-10-24 14:54:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-24 14:54:24,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:24,314 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:24,314 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:24,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1054277103, now seen corresponding path program 1 times [2018-10-24 14:54:24,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:24,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:24,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:24,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:24,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:24,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:24,531 INFO L87 Difference]: Start difference. First operand 9476 states and 11228 transitions. Second operand 5 states. [2018-10-24 14:54:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:26,811 INFO L93 Difference]: Finished difference Result 30652 states and 36094 transitions. [2018-10-24 14:54:26,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:54:26,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2018-10-24 14:54:26,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:26,856 INFO L225 Difference]: With dead ends: 30652 [2018-10-24 14:54:26,856 INFO L226 Difference]: Without dead ends: 21178 [2018-10-24 14:54:26,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21178 states. [2018-10-24 14:54:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21178 to 21173. [2018-10-24 14:54:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21173 states. [2018-10-24 14:54:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21173 states to 21173 states and 24847 transitions. [2018-10-24 14:54:27,154 INFO L78 Accepts]: Start accepts. Automaton has 21173 states and 24847 transitions. Word has length 236 [2018-10-24 14:54:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:27,155 INFO L481 AbstractCegarLoop]: Abstraction has 21173 states and 24847 transitions. [2018-10-24 14:54:27,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 21173 states and 24847 transitions. [2018-10-24 14:54:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-24 14:54:27,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:27,178 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:27,178 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:27,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:27,178 INFO L82 PathProgramCache]: Analyzing trace with hash 743334218, now seen corresponding path program 1 times [2018-10-24 14:54:27,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:27,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:27,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:27,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:27,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:27,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:27,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:27,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:27,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:27,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:27,602 INFO L87 Difference]: Start difference. First operand 21173 states and 24847 transitions. Second operand 4 states. [2018-10-24 14:54:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:29,825 INFO L93 Difference]: Finished difference Result 69748 states and 80897 transitions. [2018-10-24 14:54:29,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:29,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2018-10-24 14:54:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:29,911 INFO L225 Difference]: With dead ends: 69748 [2018-10-24 14:54:29,911 INFO L226 Difference]: Without dead ends: 48577 [2018-10-24 14:54:29,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48577 states. [2018-10-24 14:54:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48577 to 35450. [2018-10-24 14:54:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35450 states. [2018-10-24 14:54:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35450 states to 35450 states and 40732 transitions. [2018-10-24 14:54:30,501 INFO L78 Accepts]: Start accepts. Automaton has 35450 states and 40732 transitions. Word has length 240 [2018-10-24 14:54:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:30,502 INFO L481 AbstractCegarLoop]: Abstraction has 35450 states and 40732 transitions. [2018-10-24 14:54:30,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 35450 states and 40732 transitions. [2018-10-24 14:54:30,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-24 14:54:30,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:30,526 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:30,526 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:30,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:30,527 INFO L82 PathProgramCache]: Analyzing trace with hash -772333302, now seen corresponding path program 1 times [2018-10-24 14:54:30,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:30,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:30,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:30,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:30,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:30,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:30,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:30,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:30,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:30,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:30,871 INFO L87 Difference]: Start difference. First operand 35450 states and 40732 transitions. Second operand 4 states. [2018-10-24 14:54:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:32,391 INFO L93 Difference]: Finished difference Result 70283 states and 80770 transitions. [2018-10-24 14:54:32,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:32,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2018-10-24 14:54:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:32,444 INFO L225 Difference]: With dead ends: 70283 [2018-10-24 14:54:32,444 INFO L226 Difference]: Without dead ends: 34835 [2018-10-24 14:54:32,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34835 states. [2018-10-24 14:54:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34835 to 34835. [2018-10-24 14:54:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34835 states. [2018-10-24 14:54:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34835 states to 34835 states and 38420 transitions. [2018-10-24 14:54:33,284 INFO L78 Accepts]: Start accepts. Automaton has 34835 states and 38420 transitions. Word has length 255 [2018-10-24 14:54:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:33,284 INFO L481 AbstractCegarLoop]: Abstraction has 34835 states and 38420 transitions. [2018-10-24 14:54:33,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 34835 states and 38420 transitions. [2018-10-24 14:54:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-24 14:54:33,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:33,308 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:33,308 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:33,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1969189059, now seen corresponding path program 1 times [2018-10-24 14:54:33,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:33,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:33,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 14:54:33,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:33,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:33,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:33,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:33,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:33,556 INFO L87 Difference]: Start difference. First operand 34835 states and 38420 transitions. Second operand 3 states. [2018-10-24 14:54:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:34,466 INFO L93 Difference]: Finished difference Result 69667 states and 76837 transitions. [2018-10-24 14:54:34,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:34,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2018-10-24 14:54:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:34,498 INFO L225 Difference]: With dead ends: 69667 [2018-10-24 14:54:34,499 INFO L226 Difference]: Without dead ends: 34834 [2018-10-24 14:54:34,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34834 states. [2018-10-24 14:54:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34834 to 34834. [2018-10-24 14:54:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34834 states. [2018-10-24 14:54:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34834 states to 34834 states and 38418 transitions. [2018-10-24 14:54:34,920 INFO L78 Accepts]: Start accepts. Automaton has 34834 states and 38418 transitions. Word has length 268 [2018-10-24 14:54:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:34,921 INFO L481 AbstractCegarLoop]: Abstraction has 34834 states and 38418 transitions. [2018-10-24 14:54:34,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 34834 states and 38418 transitions. [2018-10-24 14:54:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-24 14:54:34,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:34,938 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:34,939 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:34,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:34,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1847525715, now seen corresponding path program 1 times [2018-10-24 14:54:34,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:34,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:34,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:34,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:34,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-24 14:54:35,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:35,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:35,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:35,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:35,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:35,320 INFO L87 Difference]: Start difference. First operand 34834 states and 38418 transitions. Second operand 4 states. [2018-10-24 14:54:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:38,052 INFO L93 Difference]: Finished difference Result 126434 states and 138909 transitions. [2018-10-24 14:54:38,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:38,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-10-24 14:54:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:38,142 INFO L225 Difference]: With dead ends: 126434 [2018-10-24 14:54:38,142 INFO L226 Difference]: Without dead ends: 91602 [2018-10-24 14:54:38,166 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 14:54:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91602 states. [2018-10-24 14:54:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91602 to 91598. [2018-10-24 14:54:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91598 states. [2018-10-24 14:54:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91598 states to 91598 states and 100372 transitions. [2018-10-24 14:54:39,130 INFO L78 Accepts]: Start accepts. Automaton has 91598 states and 100372 transitions. Word has length 284 [2018-10-24 14:54:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:39,130 INFO L481 AbstractCegarLoop]: Abstraction has 91598 states and 100372 transitions. [2018-10-24 14:54:39,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 91598 states and 100372 transitions. [2018-10-24 14:54:39,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-24 14:54:39,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:39,142 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:39,142 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:39,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:39,142 INFO L82 PathProgramCache]: Analyzing trace with hash -657631533, now seen corresponding path program 1 times [2018-10-24 14:54:39,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:39,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:39,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:39,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:39,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-24 14:54:39,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:39,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:39,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:39,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:39,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:39,484 INFO L87 Difference]: Start difference. First operand 91598 states and 100372 transitions. Second operand 4 states. [2018-10-24 14:54:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:41,676 INFO L93 Difference]: Finished difference Result 187108 states and 205228 transitions. [2018-10-24 14:54:41,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:41,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-10-24 14:54:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:41,782 INFO L225 Difference]: With dead ends: 187108 [2018-10-24 14:54:41,782 INFO L226 Difference]: Without dead ends: 95512 [2018-10-24 14:54:41,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:41,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95512 states. [2018-10-24 14:54:43,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95512 to 95483. [2018-10-24 14:54:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95483 states. [2018-10-24 14:54:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95483 states to 95483 states and 104575 transitions. [2018-10-24 14:54:43,687 INFO L78 Accepts]: Start accepts. Automaton has 95483 states and 104575 transitions. Word has length 284 [2018-10-24 14:54:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:43,688 INFO L481 AbstractCegarLoop]: Abstraction has 95483 states and 104575 transitions. [2018-10-24 14:54:43,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 95483 states and 104575 transitions. [2018-10-24 14:54:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-24 14:54:43,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:43,703 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:43,703 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:43,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1393560831, now seen corresponding path program 1 times [2018-10-24 14:54:43,704 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:43,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:43,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-24 14:54:44,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:44,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:44,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:44,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:44,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:44,106 INFO L87 Difference]: Start difference. First operand 95483 states and 104575 transitions. Second operand 5 states. [2018-10-24 14:54:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:47,161 INFO L93 Difference]: Finished difference Result 285047 states and 311846 transitions. [2018-10-24 14:54:47,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:54:47,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 313 [2018-10-24 14:54:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:47,388 INFO L225 Difference]: With dead ends: 285047 [2018-10-24 14:54:47,388 INFO L226 Difference]: Without dead ends: 189566 [2018-10-24 14:54:47,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:47,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189566 states. [2018-10-24 14:54:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189566 to 178242. [2018-10-24 14:54:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178242 states. [2018-10-24 14:54:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178242 states to 178242 states and 194148 transitions. [2018-10-24 14:54:50,569 INFO L78 Accepts]: Start accepts. Automaton has 178242 states and 194148 transitions. Word has length 313 [2018-10-24 14:54:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:50,569 INFO L481 AbstractCegarLoop]: Abstraction has 178242 states and 194148 transitions. [2018-10-24 14:54:50,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 178242 states and 194148 transitions. [2018-10-24 14:54:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-24 14:54:50,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:50,589 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:50,589 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:50,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:50,589 INFO L82 PathProgramCache]: Analyzing trace with hash -814992243, now seen corresponding path program 1 times [2018-10-24 14:54:50,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:50,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:50,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:50,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:50,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:50,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:50,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:50,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:50,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:50,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:50,929 INFO L87 Difference]: Start difference. First operand 178242 states and 194148 transitions. Second operand 4 states. [2018-10-24 14:54:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:55,183 INFO L93 Difference]: Finished difference Result 359539 states and 391686 transitions. [2018-10-24 14:54:55,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:55,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2018-10-24 14:54:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:55,415 INFO L225 Difference]: With dead ends: 359539 [2018-10-24 14:54:55,416 INFO L226 Difference]: Without dead ends: 181297 [2018-10-24 14:54:55,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181297 states. [2018-10-24 14:54:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181297 to 181289. [2018-10-24 14:54:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181289 states. [2018-10-24 14:54:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181289 states to 181289 states and 195449 transitions. [2018-10-24 14:54:57,707 INFO L78 Accepts]: Start accepts. Automaton has 181289 states and 195449 transitions. Word has length 316 [2018-10-24 14:54:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:57,707 INFO L481 AbstractCegarLoop]: Abstraction has 181289 states and 195449 transitions. [2018-10-24 14:54:57,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 181289 states and 195449 transitions. [2018-10-24 14:54:57,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-24 14:54:57,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:57,723 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:57,724 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:57,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:57,724 INFO L82 PathProgramCache]: Analyzing trace with hash -337771774, now seen corresponding path program 1 times [2018-10-24 14:54:57,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:57,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:57,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:57,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:57,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-24 14:54:57,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:57,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:57,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:57,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:57,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:57,963 INFO L87 Difference]: Start difference. First operand 181289 states and 195449 transitions. Second operand 3 states. [2018-10-24 14:55:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:02,686 INFO L93 Difference]: Finished difference Result 450467 states and 485283 transitions. [2018-10-24 14:55:02,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:02,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2018-10-24 14:55:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:03,015 INFO L225 Difference]: With dead ends: 450467 [2018-10-24 14:55:03,016 INFO L226 Difference]: Without dead ends: 269180 [2018-10-24 14:55:03,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269180 states. [2018-10-24 14:55:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269180 to 258721. [2018-10-24 14:55:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258721 states. [2018-10-24 14:55:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258721 states to 258721 states and 278761 transitions. [2018-10-24 14:55:11,558 INFO L78 Accepts]: Start accepts. Automaton has 258721 states and 278761 transitions. Word has length 325 [2018-10-24 14:55:11,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:11,558 INFO L481 AbstractCegarLoop]: Abstraction has 258721 states and 278761 transitions. [2018-10-24 14:55:11,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:55:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 258721 states and 278761 transitions. [2018-10-24 14:55:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-24 14:55:11,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:11,578 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:55:11,578 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:11,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:11,578 INFO L82 PathProgramCache]: Analyzing trace with hash 632149206, now seen corresponding path program 1 times [2018-10-24 14:55:11,579 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:11,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:11,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:11,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:11,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 143 proven. 4 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-24 14:55:11,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:55:11,930 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:55:11,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:12,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:55:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-10-24 14:55:12,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:55:12,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 14:55:12,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:55:12,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:55:12,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:55:12,256 INFO L87 Difference]: Start difference. First operand 258721 states and 278761 transitions. Second operand 6 states. [2018-10-24 14:55:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:23,731 INFO L93 Difference]: Finished difference Result 1152439 states and 1239561 transitions. [2018-10-24 14:55:23,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:55:23,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 333 [2018-10-24 14:55:23,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:25,053 INFO L225 Difference]: With dead ends: 1152439 [2018-10-24 14:55:25,054 INFO L226 Difference]: Without dead ends: 893720 [2018-10-24 14:55:25,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:55:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893720 states. [2018-10-24 14:55:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893720 to 888151. [2018-10-24 14:55:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888151 states. [2018-10-24 14:55:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888151 states to 888151 states and 949667 transitions. [2018-10-24 14:55:52,757 INFO L78 Accepts]: Start accepts. Automaton has 888151 states and 949667 transitions. Word has length 333 [2018-10-24 14:55:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:52,757 INFO L481 AbstractCegarLoop]: Abstraction has 888151 states and 949667 transitions. [2018-10-24 14:55:52,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:55:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 888151 states and 949667 transitions. [2018-10-24 14:55:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-24 14:55:52,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:52,781 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:55:52,781 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:52,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:52,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1755498419, now seen corresponding path program 1 times [2018-10-24 14:55:52,782 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:52,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:52,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:52,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:52,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-24 14:55:53,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:53,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:53,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:55:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:55:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:53,391 INFO L87 Difference]: Start difference. First operand 888151 states and 949667 transitions. Second operand 4 states. [2018-10-24 14:56:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:09,240 INFO L93 Difference]: Finished difference Result 2486026 states and 2654736 transitions. [2018-10-24 14:56:09,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:09,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2018-10-24 14:56:09,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:13,394 INFO L225 Difference]: With dead ends: 2486026 [2018-10-24 14:56:13,394 INFO L226 Difference]: Without dead ends: 1557107 [2018-10-24 14:56:13,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557107 states. [2018-10-24 14:56:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557107 to 1446950. [2018-10-24 14:56:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446950 states. [2018-10-24 14:56:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446950 states to 1446950 states and 1533753 transitions. [2018-10-24 14:56:57,546 INFO L78 Accepts]: Start accepts. Automaton has 1446950 states and 1533753 transitions. Word has length 334 [2018-10-24 14:56:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:57,546 INFO L481 AbstractCegarLoop]: Abstraction has 1446950 states and 1533753 transitions. [2018-10-24 14:56:57,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1446950 states and 1533753 transitions. [2018-10-24 14:56:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-24 14:56:57,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:57,555 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:57,556 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:57,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1403475232, now seen corresponding path program 1 times [2018-10-24 14:56:57,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:57,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:57,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:57,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:56:57,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:57,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:57,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:57,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:57,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:57,941 INFO L87 Difference]: Start difference. First operand 1446950 states and 1533753 transitions. Second operand 3 states. Received shutdown request... [2018-10-24 14:57:11,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:11,581 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:57:11,586 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:57:11,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:57:11 BoogieIcfgContainer [2018-10-24 14:57:11,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:57:11,588 INFO L168 Benchmark]: Toolchain (without parser) took 196070.64 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.5 GB). Free memory was 1.4 GB in the beginning and 4.8 GB in the end (delta: -3.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-24 14:57:11,589 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:57:11,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1214.32 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 14:57:11,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 299.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -881.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:11,591 INFO L168 Benchmark]: Boogie Preprocessor took 130.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:11,592 INFO L168 Benchmark]: RCFGBuilder took 5890.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 272.5 MB). Peak memory consumption was 272.5 MB. Max. memory is 7.1 GB. [2018-10-24 14:57:11,593 INFO L168 Benchmark]: TraceAbstraction took 188530.55 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 4.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-24 14:57:11,598 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1214.32 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 299.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -881.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5890.38 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 272.5 MB). Peak memory consumption was 272.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188530.55 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 4.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1524]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (1446950states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (466285 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 188.4s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 90.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4853 SDtfs, 11723 SDslu, 3437 SDs, 0 SdLazy, 20118 SolverSat, 3640 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 359 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1446950occurred in iteration=19, 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: 90.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 153100 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 5326 NumberOfCodeBlocks, 5326 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5305 ConstructedInterpolants, 0 QuantifiedInterpolants, 3060499 SizeOfPredicates, 0 NumberOfNonLiveVariables, 675 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 2821/2825 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown