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_label36_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:59:08,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:59:08,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:59:08,047 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:59:08,048 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:59:08,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:59:08,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:59:08,053 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:59:08,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:59:08,063 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:59:08,064 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:59:08,066 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:59:08,067 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:59:08,067 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:59:08,069 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:59:08,069 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:59:08,072 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:59:08,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:59:08,081 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:59:08,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:59:08,086 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:59:08,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:59:08,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:59:08,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:59:08,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:59:08,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:59:08,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:59:08,092 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:59:08,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:59:08,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:59:08,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:59:08,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:59:08,098 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:59:08,098 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:59:08,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:59:08,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:59:08,100 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:59:08,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:59:08,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:59:08,133 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:59:08,134 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:59:08,134 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:59:08,135 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:59:08,135 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:59:08,135 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:59:08,135 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:59:08,135 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:59:08,136 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:59:08,136 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:59:08,136 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:59:08,136 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:59:08,136 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:59:08,137 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:59:08,137 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:59:08,137 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:59:08,137 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:59:08,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:59:08,138 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:59:08,138 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:59:08,138 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:59:08,138 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:59:08,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:59:08,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:59:08,139 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:59:08,139 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:59:08,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:59:08,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:59:08,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:59:08,214 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:59:08,215 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:59:08,216 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label36_true-unreach-call.c [2018-10-24 14:59:08,286 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e3a2098df/7780699c13d7467ea22a61657443c9c6/FLAGd5b71c53d [2018-10-24 14:59:09,025 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:59:09,026 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label36_true-unreach-call.c [2018-10-24 14:59:09,051 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e3a2098df/7780699c13d7467ea22a61657443c9c6/FLAGd5b71c53d [2018-10-24 14:59:09,071 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e3a2098df/7780699c13d7467ea22a61657443c9c6 [2018-10-24 14:59:09,084 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:59:09,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:59:09,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:59:09,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:59:09,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:59:09,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:59:09" (1/1) ... [2018-10-24 14:59:09,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11290b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:09, skipping insertion in model container [2018-10-24 14:59:09,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:59:09" (1/1) ... [2018-10-24 14:59:09,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:59:09,220 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:59:09,963 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:59:09,970 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:59:10,366 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:59:10,392 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:59:10,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:10 WrapperNode [2018-10-24 14:59:10,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:59:10,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:59:10,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:59:10,396 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:59:10,406 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:59:10" (1/1) ... [2018-10-24 14:59:10,460 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:59:10" (1/1) ... [2018-10-24 14:59:10,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:59:10,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:59:10,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:59:10,724 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:59:10,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:10" (1/1) ... [2018-10-24 14:59:10,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:10" (1/1) ... [2018-10-24 14:59:10,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:10" (1/1) ... [2018-10-24 14:59:10,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:10" (1/1) ... [2018-10-24 14:59:10,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:10" (1/1) ... [2018-10-24 14:59:10,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:10" (1/1) ... [2018-10-24 14:59:10,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:10" (1/1) ... [2018-10-24 14:59:10,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:59:10,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:59:10,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:59:10,924 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:59:10,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:10" (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:59:10,997 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:59:10,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:59:10,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:59:16,166 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:59:16,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:59:16 BoogieIcfgContainer [2018-10-24 14:59:16,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:59:16,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:59:16,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:59:16,173 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:59:16,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:59:09" (1/3) ... [2018-10-24 14:59:16,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282ed3b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:59:16, skipping insertion in model container [2018-10-24 14:59:16,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:10" (2/3) ... [2018-10-24 14:59:16,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282ed3b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:59:16, skipping insertion in model container [2018-10-24 14:59:16,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:59:16" (3/3) ... [2018-10-24 14:59:16,177 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label36_true-unreach-call.c [2018-10-24 14:59:16,188 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:59:16,198 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:59:16,216 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:59:16,254 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:59:16,255 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:59:16,255 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:59:16,255 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:59:16,255 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:59:16,255 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:59:16,255 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:59:16,256 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:59:16,256 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:59:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:59:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-24 14:59:16,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:16,301 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] [2018-10-24 14:59:16,303 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:16,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1071522756, now seen corresponding path program 1 times [2018-10-24 14:59:16,310 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:16,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:16,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:16,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:16,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:17,341 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:59:17,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:17,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:17,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:17,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:17,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:17,371 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:59:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:20,861 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-24 14:59:20,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:20,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-24 14:59:20,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:20,889 INFO L225 Difference]: With dead ends: 1075 [2018-10-24 14:59:20,889 INFO L226 Difference]: Without dead ends: 765 [2018-10-24 14:59:20,895 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:59:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-24 14:59:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-24 14:59:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-24 14:59:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-24 14:59:20,987 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 180 [2018-10-24 14:59:20,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:20,989 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-24 14:59:20,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-24 14:59:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-24 14:59:20,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:20,996 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] [2018-10-24 14:59:20,997 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:20,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1664876221, now seen corresponding path program 1 times [2018-10-24 14:59:20,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:20,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:20,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:21,131 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:59:21,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:21,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:59:21,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:21,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:21,135 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-24 14:59:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:23,278 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-24 14:59:23,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:23,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-24 14:59:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:23,286 INFO L225 Difference]: With dead ends: 1465 [2018-10-24 14:59:23,286 INFO L226 Difference]: Without dead ends: 947 [2018-10-24 14:59:23,290 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:59:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-24 14:59:23,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-24 14:59:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-24 14:59:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-24 14:59:23,328 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 189 [2018-10-24 14:59:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:23,329 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-24 14:59:23,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-24 14:59:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-24 14:59:23,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:23,338 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] [2018-10-24 14:59:23,338 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:23,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1680988393, now seen corresponding path program 1 times [2018-10-24 14:59:23,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:23,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:23,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:23,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:23,571 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:59:23,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:23,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:23,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:23,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:23,574 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-24 14:59:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:26,485 INFO L93 Difference]: Finished difference Result 2693 states and 4423 transitions. [2018-10-24 14:59:26,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:26,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-24 14:59:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:26,498 INFO L225 Difference]: With dead ends: 2693 [2018-10-24 14:59:26,499 INFO L226 Difference]: Without dead ends: 1764 [2018-10-24 14:59:26,501 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:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-10-24 14:59:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1748. [2018-10-24 14:59:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2018-10-24 14:59:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2752 transitions. [2018-10-24 14:59:26,553 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2752 transitions. Word has length 197 [2018-10-24 14:59:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:26,555 INFO L481 AbstractCegarLoop]: Abstraction has 1748 states and 2752 transitions. [2018-10-24 14:59:26,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2752 transitions. [2018-10-24 14:59:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-24 14:59:26,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:26,564 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2018-10-24 14:59:26,565 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:26,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:26,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1712813493, now seen corresponding path program 1 times [2018-10-24 14:59:26,568 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:26,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:26,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:26,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:26,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:26,729 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:59:26,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:26,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:26,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:26,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:26,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:26,731 INFO L87 Difference]: Start difference. First operand 1748 states and 2752 transitions. Second operand 3 states. [2018-10-24 14:59:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:28,152 INFO L93 Difference]: Finished difference Result 5132 states and 8130 transitions. [2018-10-24 14:59:28,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:28,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-10-24 14:59:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:28,175 INFO L225 Difference]: With dead ends: 5132 [2018-10-24 14:59:28,175 INFO L226 Difference]: Without dead ends: 3386 [2018-10-24 14:59:28,180 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:28,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-10-24 14:59:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3385. [2018-10-24 14:59:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-24 14:59:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4962 transitions. [2018-10-24 14:59:28,260 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4962 transitions. Word has length 204 [2018-10-24 14:59:28,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:28,260 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4962 transitions. [2018-10-24 14:59:28,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4962 transitions. [2018-10-24 14:59:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-24 14:59:28,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:28,271 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 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] [2018-10-24 14:59:28,271 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:28,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash -634898385, now seen corresponding path program 1 times [2018-10-24 14:59:28,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:28,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:28,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:28,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:28,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:59:28,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:28,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:28,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:28,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:28,504 INFO L87 Difference]: Start difference. First operand 3385 states and 4962 transitions. Second operand 3 states. [2018-10-24 14:59:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:29,854 INFO L93 Difference]: Finished difference Result 10035 states and 14750 transitions. [2018-10-24 14:59:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:29,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-24 14:59:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:29,883 INFO L225 Difference]: With dead ends: 10035 [2018-10-24 14:59:29,883 INFO L226 Difference]: Without dead ends: 6652 [2018-10-24 14:59:29,890 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:59:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2018-10-24 14:59:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 6649. [2018-10-24 14:59:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-24 14:59:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8832 transitions. [2018-10-24 14:59:30,012 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8832 transitions. Word has length 211 [2018-10-24 14:59:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:30,013 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8832 transitions. [2018-10-24 14:59:30,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8832 transitions. [2018-10-24 14:59:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-24 14:59:30,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:30,028 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,029 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:30,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1018946693, now seen corresponding path program 1 times [2018-10-24 14:59:30,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:30,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:30,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:30,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:30,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:30,297 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:59:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:59:30,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:30,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:30,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:30,329 INFO L87 Difference]: Start difference. First operand 6649 states and 8832 transitions. Second operand 4 states. [2018-10-24 14:59:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:32,818 INFO L93 Difference]: Finished difference Result 13297 states and 17664 transitions. [2018-10-24 14:59:32,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:32,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-10-24 14:59:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:32,842 INFO L225 Difference]: With dead ends: 13297 [2018-10-24 14:59:32,843 INFO L226 Difference]: Without dead ends: 6650 [2018-10-24 14:59:32,851 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:59:32,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2018-10-24 14:59:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6649. [2018-10-24 14:59:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-24 14:59:32,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8345 transitions. [2018-10-24 14:59:32,973 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8345 transitions. Word has length 211 [2018-10-24 14:59:32,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:32,974 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8345 transitions. [2018-10-24 14:59:32,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8345 transitions. [2018-10-24 14:59:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-24 14:59:32,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:32,988 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:32,988 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:32,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:32,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1841420693, now seen corresponding path program 1 times [2018-10-24 14:59:32,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:32,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:32,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:32,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:32,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:59:33,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:33,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:59:33,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:33,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:33,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:33,179 INFO L87 Difference]: Start difference. First operand 6649 states and 8345 transitions. Second operand 3 states. [2018-10-24 14:59:34,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:34,235 INFO L93 Difference]: Finished difference Result 13264 states and 16645 transitions. [2018-10-24 14:59:34,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:34,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-24 14:59:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:34,260 INFO L225 Difference]: With dead ends: 13264 [2018-10-24 14:59:34,261 INFO L226 Difference]: Without dead ends: 6617 [2018-10-24 14:59:34,268 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:59:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-10-24 14:59:34,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6617. [2018-10-24 14:59:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2018-10-24 14:59:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 8118 transitions. [2018-10-24 14:59:34,365 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 8118 transitions. Word has length 218 [2018-10-24 14:59:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:34,366 INFO L481 AbstractCegarLoop]: Abstraction has 6617 states and 8118 transitions. [2018-10-24 14:59:34,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 8118 transitions. [2018-10-24 14:59:34,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-24 14:59:34,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:34,379 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,379 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:34,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:34,380 INFO L82 PathProgramCache]: Analyzing trace with hash -197633740, now seen corresponding path program 1 times [2018-10-24 14:59:34,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:34,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:34,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:34,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:34,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:59:34,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:34,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:59:34,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:34,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:34,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:34,548 INFO L87 Difference]: Start difference. First operand 6617 states and 8118 transitions. Second operand 3 states. [2018-10-24 14:59:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:36,061 INFO L93 Difference]: Finished difference Result 15690 states and 19149 transitions. [2018-10-24 14:59:36,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:36,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-10-24 14:59:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:36,079 INFO L225 Difference]: With dead ends: 15690 [2018-10-24 14:59:36,079 INFO L226 Difference]: Without dead ends: 9075 [2018-10-24 14:59:36,086 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:59:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9075 states. [2018-10-24 14:59:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9075 to 9074. [2018-10-24 14:59:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9074 states. [2018-10-24 14:59:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 10935 transitions. [2018-10-24 14:59:36,206 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 10935 transitions. Word has length 222 [2018-10-24 14:59:36,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:36,206 INFO L481 AbstractCegarLoop]: Abstraction has 9074 states and 10935 transitions. [2018-10-24 14:59:36,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 10935 transitions. [2018-10-24 14:59:36,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-24 14:59:36,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:36,224 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,224 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:36,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:36,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1273676320, now seen corresponding path program 1 times [2018-10-24 14:59:36,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:36,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:36,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:36,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:36,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:59:36,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:59:36,473 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:59:36,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:36,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:59:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:59:36,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:59:36,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 14:59:36,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:59:36,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:59:36,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:59:36,787 INFO L87 Difference]: Start difference. First operand 9074 states and 10935 transitions. Second operand 7 states. [2018-10-24 14:59:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:41,634 INFO L93 Difference]: Finished difference Result 34490 states and 42017 transitions. [2018-10-24 14:59:41,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 14:59:41,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2018-10-24 14:59:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:41,686 INFO L225 Difference]: With dead ends: 34490 [2018-10-24 14:59:41,686 INFO L226 Difference]: Without dead ends: 25418 [2018-10-24 14:59:41,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-24 14:59:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25418 states. [2018-10-24 14:59:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25418 to 25412. [2018-10-24 14:59:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25412 states. [2018-10-24 14:59:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25412 states to 25412 states and 28705 transitions. [2018-10-24 14:59:42,046 INFO L78 Accepts]: Start accepts. Automaton has 25412 states and 28705 transitions. Word has length 230 [2018-10-24 14:59:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:42,047 INFO L481 AbstractCegarLoop]: Abstraction has 25412 states and 28705 transitions. [2018-10-24 14:59:42,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:59:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 25412 states and 28705 transitions. [2018-10-24 14:59:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-24 14:59:42,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:42,088 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:42,089 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:42,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash 582135979, now seen corresponding path program 1 times [2018-10-24 14:59:42,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:42,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:42,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:42,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:42,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-24 14:59:42,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:42,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:42,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:42,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:42,361 INFO L87 Difference]: Start difference. First operand 25412 states and 28705 transitions. Second operand 4 states. [2018-10-24 14:59:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:44,685 INFO L93 Difference]: Finished difference Result 50218 states and 56784 transitions. [2018-10-24 14:59:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:44,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2018-10-24 14:59:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:44,731 INFO L225 Difference]: With dead ends: 50218 [2018-10-24 14:59:44,731 INFO L226 Difference]: Without dead ends: 24808 [2018-10-24 14:59:44,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24808 states. [2018-10-24 14:59:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24808 to 24797. [2018-10-24 14:59:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24797 states. [2018-10-24 14:59:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24797 states to 24797 states and 27813 transitions. [2018-10-24 14:59:45,080 INFO L78 Accepts]: Start accepts. Automaton has 24797 states and 27813 transitions. Word has length 321 [2018-10-24 14:59:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:45,081 INFO L481 AbstractCegarLoop]: Abstraction has 24797 states and 27813 transitions. [2018-10-24 14:59:45,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 24797 states and 27813 transitions. [2018-10-24 14:59:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-24 14:59:45,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:45,119 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:45,120 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:45,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:45,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1125602268, now seen corresponding path program 1 times [2018-10-24 14:59:45,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:45,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:45,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:45,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:45,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-24 14:59:45,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:45,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:45,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:45,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:45,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:45,489 INFO L87 Difference]: Start difference. First operand 24797 states and 27813 transitions. Second operand 4 states. [2018-10-24 14:59:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:47,719 INFO L93 Difference]: Finished difference Result 51849 states and 58266 transitions. [2018-10-24 14:59:47,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:47,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-10-24 14:59:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:47,756 INFO L225 Difference]: With dead ends: 51849 [2018-10-24 14:59:47,757 INFO L226 Difference]: Without dead ends: 27054 [2018-10-24 14:59:47,777 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:59:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27054 states. [2018-10-24 14:59:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27054 to 27047. [2018-10-24 14:59:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27047 states. [2018-10-24 14:59:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27047 states to 27047 states and 30335 transitions. [2018-10-24 14:59:48,095 INFO L78 Accepts]: Start accepts. Automaton has 27047 states and 30335 transitions. Word has length 342 [2018-10-24 14:59:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:48,095 INFO L481 AbstractCegarLoop]: Abstraction has 27047 states and 30335 transitions. [2018-10-24 14:59:48,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 27047 states and 30335 transitions. [2018-10-24 14:59:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-24 14:59:48,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:48,124 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:59:48,124 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:48,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:48,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1562798004, now seen corresponding path program 1 times [2018-10-24 14:59:48,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:48,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:48,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:48,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:48,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-24 14:59:48,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:48,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:48,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:48,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:48,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:48,383 INFO L87 Difference]: Start difference. First operand 27047 states and 30335 transitions. Second operand 3 states. [2018-10-24 14:59:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:49,975 INFO L93 Difference]: Finished difference Result 52660 states and 59076 transitions. [2018-10-24 14:59:49,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:49,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 363 [2018-10-24 14:59:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:50,009 INFO L225 Difference]: With dead ends: 52660 [2018-10-24 14:59:50,009 INFO L226 Difference]: Without dead ends: 25615 [2018-10-24 14:59:50,028 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:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25615 states. [2018-10-24 14:59:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25615 to 25612. [2018-10-24 14:59:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25612 states. [2018-10-24 14:59:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25612 states to 25612 states and 28117 transitions. [2018-10-24 14:59:50,314 INFO L78 Accepts]: Start accepts. Automaton has 25612 states and 28117 transitions. Word has length 363 [2018-10-24 14:59:50,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:50,315 INFO L481 AbstractCegarLoop]: Abstraction has 25612 states and 28117 transitions. [2018-10-24 14:59:50,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 25612 states and 28117 transitions. [2018-10-24 14:59:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-24 14:59:50,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:50,336 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,337 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:50,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash -921422517, now seen corresponding path program 1 times [2018-10-24 14:59:50,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:50,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:50,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:50,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:50,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-24 14:59:50,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:50,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:50,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:50,909 INFO L87 Difference]: Start difference. First operand 25612 states and 28117 transitions. Second operand 4 states. [2018-10-24 14:59:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:52,316 INFO L93 Difference]: Finished difference Result 99169 states and 109018 transitions. [2018-10-24 14:59:52,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:52,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2018-10-24 14:59:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:52,381 INFO L225 Difference]: With dead ends: 99169 [2018-10-24 14:59:52,381 INFO L226 Difference]: Without dead ends: 73559 [2018-10-24 14:59:52,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73559 states. [2018-10-24 14:59:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73559 to 48356. [2018-10-24 14:59:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48356 states. [2018-10-24 14:59:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48356 states to 48356 states and 53197 transitions. [2018-10-24 14:59:52,970 INFO L78 Accepts]: Start accepts. Automaton has 48356 states and 53197 transitions. Word has length 370 [2018-10-24 14:59:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:52,970 INFO L481 AbstractCegarLoop]: Abstraction has 48356 states and 53197 transitions. [2018-10-24 14:59:52,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 48356 states and 53197 transitions. [2018-10-24 14:59:52,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-24 14:59:52,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:52,992 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,993 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:52,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:52,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1816538621, now seen corresponding path program 1 times [2018-10-24 14:59:52,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:52,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:52,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:52,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:52,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:53,495 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:59:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-10-24 14:59:53,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:53,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:59:53,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:59:53,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:59:53,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:59:53,620 INFO L87 Difference]: Start difference. First operand 48356 states and 53197 transitions. Second operand 5 states. [2018-10-24 14:59:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:56,720 INFO L93 Difference]: Finished difference Result 134847 states and 148793 transitions. [2018-10-24 14:59:56,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:59:56,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2018-10-24 14:59:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:56,834 INFO L225 Difference]: With dead ends: 134847 [2018-10-24 14:59:56,834 INFO L226 Difference]: Without dead ends: 86493 [2018-10-24 14:59:56,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:59:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86493 states. [2018-10-24 14:59:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86493 to 84417. [2018-10-24 14:59:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84417 states. [2018-10-24 14:59:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84417 states to 84417 states and 92902 transitions. [2018-10-24 14:59:58,585 INFO L78 Accepts]: Start accepts. Automaton has 84417 states and 92902 transitions. Word has length 373 [2018-10-24 14:59:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:58,586 INFO L481 AbstractCegarLoop]: Abstraction has 84417 states and 92902 transitions. [2018-10-24 14:59:58,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:59:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 84417 states and 92902 transitions. [2018-10-24 14:59:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-24 14:59:58,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:58,614 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 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] [2018-10-24 14:59:58,614 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:58,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:58,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1602254634, now seen corresponding path program 1 times [2018-10-24 14:59:58,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:58,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:58,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:58,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:58,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-24 14:59:58,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:58,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:59:58,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:58,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:58,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:58,994 INFO L87 Difference]: Start difference. First operand 84417 states and 92902 transitions. Second operand 3 states. [2018-10-24 15:00:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:00,498 INFO L93 Difference]: Finished difference Result 199174 states and 218905 transitions. [2018-10-24 15:00:00,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:00,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2018-10-24 15:00:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:00,634 INFO L225 Difference]: With dead ends: 199174 [2018-10-24 15:00:00,635 INFO L226 Difference]: Without dead ends: 114759 [2018-10-24 15:00:00,694 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 15:00:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114759 states. [2018-10-24 15:00:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114759 to 114759. [2018-10-24 15:00:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114759 states. [2018-10-24 15:00:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114759 states to 114759 states and 125859 transitions. [2018-10-24 15:00:02,717 INFO L78 Accepts]: Start accepts. Automaton has 114759 states and 125859 transitions. Word has length 392 [2018-10-24 15:00:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:02,717 INFO L481 AbstractCegarLoop]: Abstraction has 114759 states and 125859 transitions. [2018-10-24 15:00:02,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 114759 states and 125859 transitions. [2018-10-24 15:00:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2018-10-24 15:00:02,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:02,784 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,785 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:02,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash 593917864, now seen corresponding path program 1 times [2018-10-24 15:00:02,785 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:02,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:02,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:02,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:02,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2018-10-24 15:00:03,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:03,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:03,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:03,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:03,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:03,336 INFO L87 Difference]: Start difference. First operand 114759 states and 125859 transitions. Second operand 3 states. [2018-10-24 15:00:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:04,439 INFO L93 Difference]: Finished difference Result 309033 states and 338482 transitions. [2018-10-24 15:00:04,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:04,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 693 [2018-10-24 15:00:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:04,612 INFO L225 Difference]: With dead ends: 309033 [2018-10-24 15:00:04,612 INFO L226 Difference]: Without dead ends: 194276 [2018-10-24 15:00:04,677 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:04,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194276 states. [2018-10-24 15:00:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194276 to 194274. [2018-10-24 15:00:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194274 states. [2018-10-24 15:00:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194274 states to 194274 states and 211398 transitions. [2018-10-24 15:00:07,703 INFO L78 Accepts]: Start accepts. Automaton has 194274 states and 211398 transitions. Word has length 693 [2018-10-24 15:00:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:07,704 INFO L481 AbstractCegarLoop]: Abstraction has 194274 states and 211398 transitions. [2018-10-24 15:00:07,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:07,704 INFO L276 IsEmpty]: Start isEmpty. Operand 194274 states and 211398 transitions. [2018-10-24 15:00:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2018-10-24 15:00:07,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:07,837 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,837 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:07,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:07,838 INFO L82 PathProgramCache]: Analyzing trace with hash 374868588, now seen corresponding path program 1 times [2018-10-24 15:00:07,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:07,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:07,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:07,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:07,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:08,444 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 15:00:08,654 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 15:00:08,917 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 15:00:09,141 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 15:00:09,473 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-24 15:00:09,755 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-24 15:00:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 732 proven. 29 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked. [2018-10-24 15:00:11,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:00:11,772 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 15:00:11,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:12,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:00:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2018-10-24 15:00:12,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:00:12,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2018-10-24 15:00:12,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 15:00:12,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 15:00:12,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-24 15:00:12,472 INFO L87 Difference]: Start difference. First operand 194274 states and 211398 transitions. Second operand 11 states. [2018-10-24 15:00:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:34,783 INFO L93 Difference]: Finished difference Result 1596964 states and 1736457 transitions. [2018-10-24 15:00:34,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-24 15:00:34,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 695 [2018-10-24 15:00:34,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:37,718 INFO L225 Difference]: With dead ends: 1596964 [2018-10-24 15:00:37,719 INFO L226 Difference]: Without dead ends: 1402680 [2018-10-24 15:00:38,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 694 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-24 15:00:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402680 states. [2018-10-24 15:01:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402680 to 1317555. [2018-10-24 15:01:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317555 states. [2018-10-24 15:01:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317555 states to 1317555 states and 1434262 transitions. [2018-10-24 15:01:14,690 INFO L78 Accepts]: Start accepts. Automaton has 1317555 states and 1434262 transitions. Word has length 695 [2018-10-24 15:01:14,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:14,691 INFO L481 AbstractCegarLoop]: Abstraction has 1317555 states and 1434262 transitions. [2018-10-24 15:01:14,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 15:01:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1317555 states and 1434262 transitions. [2018-10-24 15:01:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2018-10-24 15:01:15,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:15,711 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:15,712 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:15,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:15,712 INFO L82 PathProgramCache]: Analyzing trace with hash 460198062, now seen corresponding path program 1 times [2018-10-24 15:01:15,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:15,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:15,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:15,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:15,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:17,974 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 15:01:18,352 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2018-10-24 15:01:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 966 proven. 40 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-10-24 15:01:19,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:19,749 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 15:01:19,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:20,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 1143 proven. 0 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2018-10-24 15:01:20,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:20,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-10-24 15:01:20,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 15:01:20,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 15:01:20,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-10-24 15:01:20,595 INFO L87 Difference]: Start difference. First operand 1317555 states and 1434262 transitions. Second operand 14 states. [2018-10-24 15:01:33,759 WARN L179 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-10-24 15:02:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:23,845 INFO L93 Difference]: Finished difference Result 5254810 states and 5703022 transitions. [2018-10-24 15:02:23,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-24 15:02:23,846 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 799 [2018-10-24 15:02:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown