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_label20_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:57:02,952 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:57:02,954 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:57:02,971 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:57:02,971 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:57:02,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:57:02,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:57:02,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:57:02,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:57:02,980 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:57:02,983 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:57:02,983 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:57:02,984 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:57:02,985 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:57:02,994 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:57:02,999 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:57:03,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:57:03,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:57:03,007 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:57:03,009 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:57:03,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:57:03,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:57:03,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:57:03,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:57:03,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:57:03,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:57:03,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:57:03,021 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:57:03,022 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:57:03,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:57:03,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:57:03,027 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:57:03,028 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:57:03,028 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:57:03,030 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:57:03,031 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:57:03,031 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:57:03,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:57:03,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:57:03,061 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:57:03,061 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:57:03,061 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:57:03,062 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:57:03,063 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:57:03,063 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:57:03,063 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:57:03,063 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:57:03,063 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:57:03,064 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:57:03,064 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:57:03,064 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:57:03,064 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:57:03,064 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:57:03,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:57:03,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:57:03,066 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:57:03,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:57:03,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:57:03,067 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:57:03,067 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:57:03,067 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:57:03,068 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:57:03,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:57:03,068 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:57:03,069 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:57:03,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:57:03,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:57:03,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:57:03,167 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:57:03,168 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:57:03,168 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label20_true-unreach-call.c [2018-10-24 14:57:03,233 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c3ee33283/41f6953ba45448d89899d8d10ff6c612/FLAG2e64f8f6f [2018-10-24 14:57:03,944 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:57:03,945 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label20_true-unreach-call.c [2018-10-24 14:57:03,969 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c3ee33283/41f6953ba45448d89899d8d10ff6c612/FLAG2e64f8f6f [2018-10-24 14:57:03,987 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c3ee33283/41f6953ba45448d89899d8d10ff6c612 [2018-10-24 14:57:04,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:57:04,002 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:57:04,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:04,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:57:04,007 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:57:04,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:03" (1/1) ... [2018-10-24 14:57:04,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e73589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:04, skipping insertion in model container [2018-10-24 14:57:04,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:03" (1/1) ... [2018-10-24 14:57:04,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:57:04,126 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:57:04,823 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:04,828 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:57:05,132 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:05,168 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:57:05,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:05 WrapperNode [2018-10-24 14:57:05,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:05,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:05,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:57:05,171 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:57:05,183 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:57:05" (1/1) ... [2018-10-24 14:57:05,226 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:57:05" (1/1) ... [2018-10-24 14:57:05,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:05,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:57:05,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:57:05,504 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:57:05,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:05" (1/1) ... [2018-10-24 14:57:05,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:05" (1/1) ... [2018-10-24 14:57:05,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:05" (1/1) ... [2018-10-24 14:57:05,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:05" (1/1) ... [2018-10-24 14:57:05,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:05" (1/1) ... [2018-10-24 14:57:05,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:05" (1/1) ... [2018-10-24 14:57:05,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:05" (1/1) ... [2018-10-24 14:57:05,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:57:05,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:57:05,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:57:05,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:57:05,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:05" (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:57:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:57:05,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:57:05,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:57:11,051 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:57:11,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:11 BoogieIcfgContainer [2018-10-24 14:57:11,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:57:11,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:57:11,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:57:11,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:57:11,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:57:03" (1/3) ... [2018-10-24 14:57:11,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f61016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:11, skipping insertion in model container [2018-10-24 14:57:11,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:05" (2/3) ... [2018-10-24 14:57:11,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f61016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:11, skipping insertion in model container [2018-10-24 14:57:11,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:11" (3/3) ... [2018-10-24 14:57:11,062 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label20_true-unreach-call.c [2018-10-24 14:57:11,073 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:57:11,086 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:57:11,105 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:57:11,143 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:57:11,143 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:57:11,144 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:57:11,144 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:57:11,144 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:57:11,144 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:57:11,144 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:57:11,145 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:57:11,145 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:57:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:57:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-24 14:57:11,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:11,201 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:11,203 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:11,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:11,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2132905468, now seen corresponding path program 1 times [2018-10-24 14:57:11,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:11,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:11,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:11,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:11,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:12,219 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:57:12,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:12,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:12,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:12,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:12,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:12,257 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:57:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:15,756 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-24 14:57:15,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:15,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-10-24 14:57:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:15,791 INFO L225 Difference]: With dead ends: 1075 [2018-10-24 14:57:15,791 INFO L226 Difference]: Without dead ends: 765 [2018-10-24 14:57:15,796 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:57:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-24 14:57:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-24 14:57:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-24 14:57:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-24 14:57:15,895 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 196 [2018-10-24 14:57:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:15,896 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-24 14:57:15,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-24 14:57:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-24 14:57:15,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:15,903 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:15,903 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:15,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash 481259907, now seen corresponding path program 1 times [2018-10-24 14:57:15,904 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:15,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:15,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:15,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:15,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:16,068 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:57:16,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:16,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:16,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:16,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:16,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:16,071 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-24 14:57:18,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:18,053 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-24 14:57:18,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:18,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-24 14:57:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:18,060 INFO L225 Difference]: With dead ends: 1465 [2018-10-24 14:57:18,060 INFO L226 Difference]: Without dead ends: 947 [2018-10-24 14:57:18,064 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:57:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-24 14:57:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-24 14:57:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-24 14:57:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-24 14:57:18,115 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 205 [2018-10-24 14:57:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:18,115 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-24 14:57:18,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-24 14:57:18,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-24 14:57:18,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:18,123 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:18,123 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:18,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash 561737559, now seen corresponding path program 1 times [2018-10-24 14:57:18,125 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:18,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:18,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:18,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:18,444 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:57:18,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:18,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:18,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:18,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:18,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:18,446 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-24 14:57:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:21,172 INFO L93 Difference]: Finished difference Result 2683 states and 4400 transitions. [2018-10-24 14:57:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:21,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-10-24 14:57:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:21,183 INFO L225 Difference]: With dead ends: 2683 [2018-10-24 14:57:21,183 INFO L226 Difference]: Without dead ends: 1754 [2018-10-24 14:57:21,186 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:57:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-10-24 14:57:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1753. [2018-10-24 14:57:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-10-24 14:57:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2648 transitions. [2018-10-24 14:57:21,224 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2648 transitions. Word has length 213 [2018-10-24 14:57:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:21,225 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2648 transitions. [2018-10-24 14:57:21,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2648 transitions. [2018-10-24 14:57:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-24 14:57:21,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:21,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:21,232 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:21,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:21,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1378145821, now seen corresponding path program 1 times [2018-10-24 14:57:21,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:21,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:21,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:21,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:21,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:21,385 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:57:21,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:21,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:21,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:21,387 INFO L87 Difference]: Start difference. First operand 1753 states and 2648 transitions. Second operand 3 states. [2018-10-24 14:57:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:22,928 INFO L93 Difference]: Finished difference Result 5139 states and 7808 transitions. [2018-10-24 14:57:22,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:22,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-10-24 14:57:22,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:22,946 INFO L225 Difference]: With dead ends: 5139 [2018-10-24 14:57:22,946 INFO L226 Difference]: Without dead ends: 3388 [2018-10-24 14:57:22,950 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:57:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2018-10-24 14:57:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3385. [2018-10-24 14:57:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-24 14:57:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4616 transitions. [2018-10-24 14:57:23,033 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4616 transitions. Word has length 220 [2018-10-24 14:57:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:23,034 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4616 transitions. [2018-10-24 14:57:23,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4616 transitions. [2018-10-24 14:57:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-24 14:57:23,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:23,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:23,045 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:23,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash 864161103, now seen corresponding path program 1 times [2018-10-24 14:57:23,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:23,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:23,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:23,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:23,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:23,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:23,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:23,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:23,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:23,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:23,533 INFO L87 Difference]: Start difference. First operand 3385 states and 4616 transitions. Second operand 4 states. [2018-10-24 14:57:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:26,191 INFO L93 Difference]: Finished difference Result 13365 states and 18287 transitions. [2018-10-24 14:57:26,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:26,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2018-10-24 14:57:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:26,228 INFO L225 Difference]: With dead ends: 13365 [2018-10-24 14:57:26,228 INFO L226 Difference]: Without dead ends: 9982 [2018-10-24 14:57:26,235 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:57:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9982 states. [2018-10-24 14:57:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9982 to 6649. [2018-10-24 14:57:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-24 14:57:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8879 transitions. [2018-10-24 14:57:26,366 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8879 transitions. Word has length 223 [2018-10-24 14:57:26,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:26,367 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8879 transitions. [2018-10-24 14:57:26,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8879 transitions. [2018-10-24 14:57:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-24 14:57:26,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:26,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:26,382 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:26,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:26,384 INFO L82 PathProgramCache]: Analyzing trace with hash 190389150, now seen corresponding path program 1 times [2018-10-24 14:57:26,384 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:26,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:26,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:26,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:26,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:26,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:26,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:26,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:26,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:26,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:26,549 INFO L87 Difference]: Start difference. First operand 6649 states and 8879 transitions. Second operand 4 states. [2018-10-24 14:57:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:28,455 INFO L93 Difference]: Finished difference Result 16563 states and 22621 transitions. [2018-10-24 14:57:28,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:28,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-10-24 14:57:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:28,489 INFO L225 Difference]: With dead ends: 16563 [2018-10-24 14:57:28,489 INFO L226 Difference]: Without dead ends: 9916 [2018-10-24 14:57:28,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9916 states. [2018-10-24 14:57:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9916 to 9913. [2018-10-24 14:57:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9913 states. [2018-10-24 14:57:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9913 states to 9913 states and 12603 transitions. [2018-10-24 14:57:28,649 INFO L78 Accepts]: Start accepts. Automaton has 9913 states and 12603 transitions. Word has length 224 [2018-10-24 14:57:28,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:28,650 INFO L481 AbstractCegarLoop]: Abstraction has 9913 states and 12603 transitions. [2018-10-24 14:57:28,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 9913 states and 12603 transitions. [2018-10-24 14:57:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-24 14:57:28,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:28,668 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:28,669 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:28,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2062478070, now seen corresponding path program 1 times [2018-10-24 14:57:28,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:28,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:28,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:28,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:28,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:28,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:28,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:28,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:28,820 INFO L87 Difference]: Start difference. First operand 9913 states and 12603 transitions. Second operand 3 states. [2018-10-24 14:57:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:30,571 INFO L93 Difference]: Finished difference Result 24787 states and 31363 transitions. [2018-10-24 14:57:30,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:30,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-10-24 14:57:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:30,602 INFO L225 Difference]: With dead ends: 24787 [2018-10-24 14:57:30,602 INFO L226 Difference]: Without dead ends: 14876 [2018-10-24 14:57:30,612 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:57:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14876 states. [2018-10-24 14:57:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14876 to 14871. [2018-10-24 14:57:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14871 states. [2018-10-24 14:57:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14871 states to 14871 states and 18725 transitions. [2018-10-24 14:57:30,813 INFO L78 Accepts]: Start accepts. Automaton has 14871 states and 18725 transitions. Word has length 225 [2018-10-24 14:57:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:30,813 INFO L481 AbstractCegarLoop]: Abstraction has 14871 states and 18725 transitions. [2018-10-24 14:57:30,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 14871 states and 18725 transitions. [2018-10-24 14:57:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-24 14:57:30,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:30,840 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:30,840 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:30,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:30,841 INFO L82 PathProgramCache]: Analyzing trace with hash -811081506, now seen corresponding path program 1 times [2018-10-24 14:57:30,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:30,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:30,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:31,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:57:31,105 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:57:31,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:31,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:57:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:31,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:57:31,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 14:57:31,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:57:31,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:57:31,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:57:31,377 INFO L87 Difference]: Start difference. First operand 14871 states and 18725 transitions. Second operand 6 states. [2018-10-24 14:57:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:37,331 INFO L93 Difference]: Finished difference Result 72482 states and 90983 transitions. [2018-10-24 14:57:37,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:57:37,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 233 [2018-10-24 14:57:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:37,426 INFO L225 Difference]: With dead ends: 72482 [2018-10-24 14:57:37,426 INFO L226 Difference]: Without dead ends: 57613 [2018-10-24 14:57:37,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 236 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:57:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57613 states. [2018-10-24 14:57:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57613 to 57322. [2018-10-24 14:57:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57322 states. [2018-10-24 14:57:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57322 states to 57322 states and 67495 transitions. [2018-10-24 14:57:38,193 INFO L78 Accepts]: Start accepts. Automaton has 57322 states and 67495 transitions. Word has length 233 [2018-10-24 14:57:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:38,193 INFO L481 AbstractCegarLoop]: Abstraction has 57322 states and 67495 transitions. [2018-10-24 14:57:38,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:57:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 57322 states and 67495 transitions. [2018-10-24 14:57:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-24 14:57:38,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:38,252 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:38,252 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:38,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:38,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1878846867, now seen corresponding path program 1 times [2018-10-24 14:57:38,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:38,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:38,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:38,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 14:57:38,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:38,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:38,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:38,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:38,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:38,425 INFO L87 Difference]: Start difference. First operand 57322 states and 67495 transitions. Second operand 3 states. [2018-10-24 14:57:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:39,636 INFO L93 Difference]: Finished difference Result 113324 states and 133252 transitions. [2018-10-24 14:57:39,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:39,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2018-10-24 14:57:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:39,723 INFO L225 Difference]: With dead ends: 113324 [2018-10-24 14:57:39,723 INFO L226 Difference]: Without dead ends: 56004 [2018-10-24 14:57:39,776 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:57:39,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56004 states. [2018-10-24 14:57:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56004 to 56004. [2018-10-24 14:57:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56004 states. [2018-10-24 14:57:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56004 states to 56004 states and 64260 transitions. [2018-10-24 14:57:40,821 INFO L78 Accepts]: Start accepts. Automaton has 56004 states and 64260 transitions. Word has length 248 [2018-10-24 14:57:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:40,821 INFO L481 AbstractCegarLoop]: Abstraction has 56004 states and 64260 transitions. [2018-10-24 14:57:40,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 56004 states and 64260 transitions. [2018-10-24 14:57:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-24 14:57:40,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:40,848 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:57:40,848 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:40,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash 714838033, now seen corresponding path program 1 times [2018-10-24 14:57:40,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:40,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:40,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:40,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:40,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:41,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:41,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:41,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:41,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:41,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:41,065 INFO L87 Difference]: Start difference. First operand 56004 states and 64260 transitions. Second operand 4 states. [2018-10-24 14:57:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:43,438 INFO L93 Difference]: Finished difference Result 126724 states and 145678 transitions. [2018-10-24 14:57:43,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:43,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2018-10-24 14:57:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:43,529 INFO L225 Difference]: With dead ends: 126724 [2018-10-24 14:57:43,530 INFO L226 Difference]: Without dead ends: 70722 [2018-10-24 14:57:43,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70722 states. [2018-10-24 14:57:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70722 to 69483. [2018-10-24 14:57:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69483 states. [2018-10-24 14:57:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69483 states to 69483 states and 78479 transitions. [2018-10-24 14:57:44,986 INFO L78 Accepts]: Start accepts. Automaton has 69483 states and 78479 transitions. Word has length 307 [2018-10-24 14:57:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:44,986 INFO L481 AbstractCegarLoop]: Abstraction has 69483 states and 78479 transitions. [2018-10-24 14:57:44,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 69483 states and 78479 transitions. [2018-10-24 14:57:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-24 14:57:45,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:45,014 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:45,014 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:45,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash -976902293, now seen corresponding path program 1 times [2018-10-24 14:57:45,015 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:45,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:45,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:45,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:45,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:45,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:45,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:45,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:45,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:45,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:45,313 INFO L87 Difference]: Start difference. First operand 69483 states and 78479 transitions. Second operand 4 states. [2018-10-24 14:57:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:47,001 INFO L93 Difference]: Finished difference Result 139191 states and 157209 transitions. [2018-10-24 14:57:47,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:47,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-10-24 14:57:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:47,072 INFO L225 Difference]: With dead ends: 139191 [2018-10-24 14:57:47,072 INFO L226 Difference]: Without dead ends: 69710 [2018-10-24 14:57:47,114 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:57:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69710 states. [2018-10-24 14:57:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69710 to 69483. [2018-10-24 14:57:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69483 states. [2018-10-24 14:57:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69483 states to 69483 states and 78077 transitions. [2018-10-24 14:57:47,740 INFO L78 Accepts]: Start accepts. Automaton has 69483 states and 78077 transitions. Word has length 308 [2018-10-24 14:57:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:47,741 INFO L481 AbstractCegarLoop]: Abstraction has 69483 states and 78077 transitions. [2018-10-24 14:57:47,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 69483 states and 78077 transitions. [2018-10-24 14:57:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-24 14:57:47,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:47,770 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:47,770 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:47,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1729129238, now seen corresponding path program 1 times [2018-10-24 14:57:47,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:47,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:47,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:48,198 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:57:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:48,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:48,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:48,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:48,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:48,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:48,308 INFO L87 Difference]: Start difference. First operand 69483 states and 78077 transitions. Second operand 4 states. [2018-10-24 14:57:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:51,234 INFO L93 Difference]: Finished difference Result 266066 states and 298852 transitions. [2018-10-24 14:57:51,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:51,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2018-10-24 14:57:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:52,321 INFO L225 Difference]: With dead ends: 266066 [2018-10-24 14:57:52,321 INFO L226 Difference]: Without dead ends: 196585 [2018-10-24 14:57:52,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196585 states. [2018-10-24 14:57:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196585 to 128124. [2018-10-24 14:57:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128124 states. [2018-10-24 14:57:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128124 states to 128124 states and 143871 transitions. [2018-10-24 14:57:53,809 INFO L78 Accepts]: Start accepts. Automaton has 128124 states and 143871 transitions. Word has length 328 [2018-10-24 14:57:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:53,810 INFO L481 AbstractCegarLoop]: Abstraction has 128124 states and 143871 transitions. [2018-10-24 14:57:53,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 128124 states and 143871 transitions. [2018-10-24 14:57:53,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-24 14:57:53,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:53,837 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:53,837 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:53,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:53,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1848161845, now seen corresponding path program 1 times [2018-10-24 14:57:53,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:53,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:53,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:53,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:53,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:54,291 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 14:57:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 14:57:54,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:54,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:54,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:54,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:54,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:54,502 INFO L87 Difference]: Start difference. First operand 128124 states and 143871 transitions. Second operand 4 states. [2018-10-24 14:57:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:58,576 INFO L93 Difference]: Finished difference Result 375960 states and 421631 transitions. [2018-10-24 14:57:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:58,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2018-10-24 14:57:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:58,868 INFO L225 Difference]: With dead ends: 375960 [2018-10-24 14:57:58,869 INFO L226 Difference]: Without dead ends: 247838 [2018-10-24 14:57:58,956 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:57:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247838 states. [2018-10-24 14:58:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247838 to 247834. [2018-10-24 14:58:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247834 states. [2018-10-24 14:58:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247834 states to 247834 states and 277625 transitions. [2018-10-24 14:58:02,695 INFO L78 Accepts]: Start accepts. Automaton has 247834 states and 277625 transitions. Word has length 350 [2018-10-24 14:58:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:02,695 INFO L481 AbstractCegarLoop]: Abstraction has 247834 states and 277625 transitions. [2018-10-24 14:58:02,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 247834 states and 277625 transitions. [2018-10-24 14:58:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-24 14:58:02,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:02,745 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:02,745 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:02,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1357701147, now seen corresponding path program 1 times [2018-10-24 14:58:02,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:02,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:02,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:02,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:02,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 174 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:58:03,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:58:03,234 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:58:03,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:03,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:58:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 14:58:03,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:58:03,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 14:58:03,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:58:03,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:58:03,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:58:03,573 INFO L87 Difference]: Start difference. First operand 247834 states and 277625 transitions. Second operand 7 states. [2018-10-24 14:58:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:15,338 INFO L93 Difference]: Finished difference Result 587529 states and 661295 transitions. [2018-10-24 14:58:15,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 14:58:15,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 359 [2018-10-24 14:58:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:15,864 INFO L225 Difference]: With dead ends: 587529 [2018-10-24 14:58:15,864 INFO L226 Difference]: Without dead ends: 339697 [2018-10-24 14:58:16,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-10-24 14:58:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339697 states. [2018-10-24 14:58:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339697 to 328120. [2018-10-24 14:58:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328120 states. [2018-10-24 14:58:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328120 states to 328120 states and 362537 transitions. [2018-10-24 14:58:26,911 INFO L78 Accepts]: Start accepts. Automaton has 328120 states and 362537 transitions. Word has length 359 [2018-10-24 14:58:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:26,912 INFO L481 AbstractCegarLoop]: Abstraction has 328120 states and 362537 transitions. [2018-10-24 14:58:26,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:58:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 328120 states and 362537 transitions. [2018-10-24 14:58:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-24 14:58:27,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:27,031 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:27,031 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:27,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1334160662, now seen corresponding path program 1 times [2018-10-24 14:58:27,032 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:27,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:27,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-24 14:58:27,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:27,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:27,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:27,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:27,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:27,337 INFO L87 Difference]: Start difference. First operand 328120 states and 362537 transitions. Second operand 3 states. [2018-10-24 14:58:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:31,823 INFO L93 Difference]: Finished difference Result 635793 states and 703466 transitions. [2018-10-24 14:58:31,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:31,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2018-10-24 14:58:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:32,265 INFO L225 Difference]: With dead ends: 635793 [2018-10-24 14:58:32,265 INFO L226 Difference]: Without dead ends: 307675 [2018-10-24 14:58:32,464 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:58:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307675 states. [2018-10-24 14:58:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307675 to 305791. [2018-10-24 14:58:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305791 states. [2018-10-24 14:58:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305791 states to 305791 states and 332074 transitions. [2018-10-24 14:58:37,575 INFO L78 Accepts]: Start accepts. Automaton has 305791 states and 332074 transitions. Word has length 383 [2018-10-24 14:58:37,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:37,576 INFO L481 AbstractCegarLoop]: Abstraction has 305791 states and 332074 transitions. [2018-10-24 14:58:37,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:58:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 305791 states and 332074 transitions. [2018-10-24 14:58:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-24 14:58:37,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:37,643 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:37,644 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:37,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:37,644 INFO L82 PathProgramCache]: Analyzing trace with hash 611533469, now seen corresponding path program 1 times [2018-10-24 14:58:37,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:37,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:37,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:38,146 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 14:58:38,351 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:58:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 14:58:38,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:38,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 14:58:38,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:58:38,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:58:38,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:58:38,455 INFO L87 Difference]: Start difference. First operand 305791 states and 332074 transitions. Second operand 5 states. [2018-10-24 14:58:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:44,245 INFO L93 Difference]: Finished difference Result 675128 states and 733051 transitions. [2018-10-24 14:58:44,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:58:44,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 418 [2018-10-24 14:58:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:46,372 INFO L225 Difference]: With dead ends: 675128 [2018-10-24 14:58:46,373 INFO L226 Difference]: Without dead ends: 369339 [2018-10-24 14:58:46,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:58:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369339 states. [2018-10-24 14:58:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369339 to 324031. [2018-10-24 14:58:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324031 states. [2018-10-24 14:58:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324031 states to 324031 states and 353570 transitions. [2018-10-24 14:58:57,219 INFO L78 Accepts]: Start accepts. Automaton has 324031 states and 353570 transitions. Word has length 418 [2018-10-24 14:58:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:57,220 INFO L481 AbstractCegarLoop]: Abstraction has 324031 states and 353570 transitions. [2018-10-24 14:58:57,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:58:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 324031 states and 353570 transitions. [2018-10-24 14:58:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-10-24 14:58:57,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:57,294 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:57,294 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:57,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:57,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1047361035, now seen corresponding path program 1 times [2018-10-24 14:58:57,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:57,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:57,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:57,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:57,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-24 14:58:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:57,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:58:57,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:57,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:57,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:57,857 INFO L87 Difference]: Start difference. First operand 324031 states and 353570 transitions. Second operand 4 states. [2018-10-24 14:59:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:03,665 INFO L93 Difference]: Finished difference Result 794483 states and 864241 transitions. [2018-10-24 14:59:03,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:03,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 437 [2018-10-24 14:59:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:04,178 INFO L225 Difference]: With dead ends: 794483 [2018-10-24 14:59:04,179 INFO L226 Difference]: Without dead ends: 470454 [2018-10-24 14:59:04,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470454 states. [2018-10-24 14:59:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470454 to 394029. [2018-10-24 14:59:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394029 states. [2018-10-24 14:59:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394029 states to 394029 states and 427048 transitions. [2018-10-24 14:59:11,926 INFO L78 Accepts]: Start accepts. Automaton has 394029 states and 427048 transitions. Word has length 437 [2018-10-24 14:59:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:11,926 INFO L481 AbstractCegarLoop]: Abstraction has 394029 states and 427048 transitions. [2018-10-24 14:59:11,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 394029 states and 427048 transitions. [2018-10-24 14:59:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-10-24 14:59:12,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:12,007 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:12,008 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:12,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:12,008 INFO L82 PathProgramCache]: Analyzing trace with hash -291768363, now seen corresponding path program 1 times [2018-10-24 14:59:12,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:12,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:12,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:12,556 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:59:12,885 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-10-24 14:59:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 347 proven. 55 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-24 14:59:13,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:59:13,560 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:59:13,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:13,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:59:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-10-24 14:59:13,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:59:13,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-24 14:59:13,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 14:59:13,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 14:59:13,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:59:13,909 INFO L87 Difference]: Start difference. First operand 394029 states and 427048 transitions. Second operand 10 states. [2018-10-24 14:59:14,468 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 14:59:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:26,720 INFO L93 Difference]: Finished difference Result 914684 states and 991511 transitions. [2018-10-24 14:59:26,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 14:59:26,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 454 [2018-10-24 14:59:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:27,463 INFO L225 Difference]: With dead ends: 914684 [2018-10-24 14:59:27,464 INFO L226 Difference]: Without dead ends: 520657 [2018-10-24 14:59:28,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 461 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2018-10-24 14:59:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520657 states. [2018-10-24 14:59:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520657 to 489901. [2018-10-24 14:59:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489901 states. [2018-10-24 14:59:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489901 states to 489901 states and 529092 transitions. [2018-10-24 14:59:43,086 INFO L78 Accepts]: Start accepts. Automaton has 489901 states and 529092 transitions. Word has length 454 [2018-10-24 14:59:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:43,086 INFO L481 AbstractCegarLoop]: Abstraction has 489901 states and 529092 transitions. [2018-10-24 14:59:43,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 14:59:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 489901 states and 529092 transitions. [2018-10-24 14:59:43,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-10-24 14:59:43,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:43,188 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:43,189 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:43,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:43,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1550698709, now seen corresponding path program 1 times [2018-10-24 14:59:43,189 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:43,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:43,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:43,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:43,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-24 14:59:43,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:43,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:43,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:43,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:43,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:43,553 INFO L87 Difference]: Start difference. First operand 489901 states and 529092 transitions. Second operand 3 states. [2018-10-24 14:59:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:51,376 INFO L93 Difference]: Finished difference Result 1267466 states and 1365727 transitions. [2018-10-24 14:59:51,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:51,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 465 [2018-10-24 14:59:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:52,386 INFO L225 Difference]: With dead ends: 1267466 [2018-10-24 14:59:52,386 INFO L226 Difference]: Without dead ends: 777567 [2018-10-24 14:59:52,551 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:59:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777567 states. [2018-10-24 15:00:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777567 to 721230. [2018-10-24 15:00:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721230 states. [2018-10-24 15:00:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721230 states to 721230 states and 775648 transitions. [2018-10-24 15:00:03,905 INFO L78 Accepts]: Start accepts. Automaton has 721230 states and 775648 transitions. Word has length 465 [2018-10-24 15:00:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:03,906 INFO L481 AbstractCegarLoop]: Abstraction has 721230 states and 775648 transitions. [2018-10-24 15:00:03,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 721230 states and 775648 transitions. [2018-10-24 15:00:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-24 15:00:05,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:05,858 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:00:05,858 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:05,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:05,859 INFO L82 PathProgramCache]: Analyzing trace with hash -48158721, now seen corresponding path program 1 times [2018-10-24 15:00:05,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:05,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:05,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:05,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-24 15:00:06,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:06,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:06,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:06,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:06,228 INFO L87 Difference]: Start difference. First operand 721230 states and 775648 transitions. Second operand 3 states. [2018-10-24 15:00:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:21,732 INFO L93 Difference]: Finished difference Result 1956732 states and 2102620 transitions. [2018-10-24 15:00:21,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:21,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 466 [2018-10-24 15:00:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:23,160 INFO L225 Difference]: With dead ends: 1956732 [2018-10-24 15:00:23,160 INFO L226 Difference]: Without dead ends: 1174415 [2018-10-24 15:00:23,492 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 15:00:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174415 states. Received shutdown request... [2018-10-24 15:00:24,551 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:00:24,555 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:00:24,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:00:24 BoogieIcfgContainer [2018-10-24 15:00:24,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:00:24,557 INFO L168 Benchmark]: Toolchain (without parser) took 200555.90 ms. Allocated memory was 1.5 GB in the beginning and 6.1 GB in the end (delta: 4.6 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:24,558 INFO L168 Benchmark]: CDTParser took 0.22 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 15:00:24,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1166.40 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 15:00:24,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 332.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -852.8 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:24,560 INFO L168 Benchmark]: Boogie Preprocessor took 120.86 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:24,561 INFO L168 Benchmark]: RCFGBuilder took 5427.61 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: 254.1 MB). Peak memory consumption was 254.1 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:24,562 INFO L168 Benchmark]: TraceAbstraction took 193502.10 ms. Allocated memory was 2.3 GB in the beginning and 6.1 GB in the end (delta: 3.8 GB). Free memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:24,567 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.22 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 1166.40 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 332.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -852.8 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.86 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5427.61 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: 254.1 MB). Peak memory consumption was 254.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 193502.10 ms. Allocated memory was 2.3 GB in the beginning and 6.1 GB in the end (delta: 3.8 GB). Free memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1620]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1620). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 193.4s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 109.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6310 SDtfs, 14484 SDslu, 4314 SDs, 0 SdLazy, 27790 SolverSat, 5378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1155 GetRequests, 1086 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=721230occurred 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: 70.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 296115 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 7308 NumberOfCodeBlocks, 7308 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 7285 ConstructedInterpolants, 0 QuantifiedInterpolants, 7345331 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1754 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 4306/4378 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown