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_label39_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 18:21:45,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 18:21:45,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 18:21:45,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 18:21:45,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 18:21:45,334 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 18:21:45,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 18:21:45,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 18:21:45,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 18:21:45,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 18:21:45,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 18:21:45,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 18:21:45,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 18:21:45,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 18:21:45,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 18:21:45,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 18:21:45,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 18:21:45,348 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 18:21:45,350 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 18:21:45,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 18:21:45,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 18:21:45,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 18:21:45,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 18:21:45,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 18:21:45,357 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 18:21:45,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 18:21:45,359 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 18:21:45,360 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 18:21:45,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 18:21:45,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 18:21:45,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 18:21:45,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 18:21:45,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 18:21:45,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 18:21:45,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 18:21:45,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 18:21:45,365 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-26 18:21:45,385 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 18:21:45,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 18:21:45,387 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 18:21:45,387 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 18:21:45,388 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 18:21:45,388 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 18:21:45,388 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 18:21:45,389 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 18:21:45,389 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 18:21:45,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 18:21:45,390 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 18:21:45,390 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 18:21:45,390 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 18:21:45,391 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 18:21:45,391 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 18:21:45,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 18:21:45,392 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 18:21:45,392 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 18:21:45,392 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 18:21:45,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 18:21:45,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 18:21:45,393 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 18:21:45,393 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 18:21:45,393 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 18:21:45,394 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 18:21:45,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 18:21:45,394 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 18:21:45,394 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 18:21:45,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 18:21:45,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 18:21:45,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 18:21:45,458 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 18:21:45,459 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 18:21:45,460 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label39_false-unreach-call.c [2018-10-26 18:21:45,519 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f6b79b34/29ca80e48a184309bb6919d6e6483342/FLAG14a646bf6 [2018-10-26 18:21:46,129 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 18:21:46,130 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label39_false-unreach-call.c [2018-10-26 18:21:46,151 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f6b79b34/29ca80e48a184309bb6919d6e6483342/FLAG14a646bf6 [2018-10-26 18:21:46,171 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f6b79b34/29ca80e48a184309bb6919d6e6483342 [2018-10-26 18:21:46,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 18:21:46,184 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 18:21:46,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 18:21:46,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 18:21:46,189 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 18:21:46,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:21:46" (1/1) ... [2018-10-26 18:21:46,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cae6dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:46, skipping insertion in model container [2018-10-26 18:21:46,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:21:46" (1/1) ... [2018-10-26 18:21:46,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 18:21:46,305 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 18:21:47,012 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 18:21:47,018 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 18:21:47,325 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 18:21:47,350 INFO L193 MainTranslator]: Completed translation [2018-10-26 18:21:47,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47 WrapperNode [2018-10-26 18:21:47,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 18:21:47,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 18:21:47,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 18:21:47,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 18:21:47,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47" (1/1) ... [2018-10-26 18:21:47,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47" (1/1) ... [2018-10-26 18:21:47,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 18:21:47,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 18:21:47,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 18:21:47,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 18:21:47,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47" (1/1) ... [2018-10-26 18:21:47,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47" (1/1) ... [2018-10-26 18:21:47,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47" (1/1) ... [2018-10-26 18:21:47,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47" (1/1) ... [2018-10-26 18:21:47,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47" (1/1) ... [2018-10-26 18:21:47,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47" (1/1) ... [2018-10-26 18:21:47,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47" (1/1) ... [2018-10-26 18:21:47,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 18:21:47,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 18:21:47,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 18:21:47,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 18:21:47,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47" (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-26 18:21:47,864 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 18:21:47,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 18:21:47,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 18:21:53,204 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 18:21:53,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:21:53 BoogieIcfgContainer [2018-10-26 18:21:53,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 18:21:53,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 18:21:53,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 18:21:53,210 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 18:21:53,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 06:21:46" (1/3) ... [2018-10-26 18:21:53,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5d2e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 06:21:53, skipping insertion in model container [2018-10-26 18:21:53,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:47" (2/3) ... [2018-10-26 18:21:53,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5d2e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 06:21:53, skipping insertion in model container [2018-10-26 18:21:53,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:21:53" (3/3) ... [2018-10-26 18:21:53,215 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label39_false-unreach-call.c [2018-10-26 18:21:53,223 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 18:21:53,232 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 18:21:53,250 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 18:21:53,289 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 18:21:53,290 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 18:21:53,290 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 18:21:53,290 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 18:21:53,290 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 18:21:53,290 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 18:21:53,291 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 18:21:53,291 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 18:21:53,291 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 18:21:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 18:21:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-26 18:21:53,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:21:53,342 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] [2018-10-26 18:21:53,344 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:21:53,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:21:53,352 INFO L82 PathProgramCache]: Analyzing trace with hash 501319492, now seen corresponding path program 1 times [2018-10-26 18:21:53,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:21:53,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:21:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:53,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:21:53,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:21:54,271 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-26 18:21:54,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:21:54,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:21:54,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:21:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:21:54,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:21:54,300 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 18:21:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:21:57,273 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-26 18:21:57,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:21:57,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-10-26 18:21:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:21:57,302 INFO L225 Difference]: With dead ends: 1089 [2018-10-26 18:21:57,303 INFO L226 Difference]: Without dead ends: 779 [2018-10-26 18:21:57,309 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-26 18:21:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-26 18:21:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-26 18:21:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-26 18:21:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-26 18:21:57,396 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 148 [2018-10-26 18:21:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:21:57,397 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-26 18:21:57,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:21:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-26 18:21:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-26 18:21:57,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:21:57,404 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:21:57,404 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:21:57,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:21:57,405 INFO L82 PathProgramCache]: Analyzing trace with hash 653561013, now seen corresponding path program 1 times [2018-10-26 18:21:57,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:21:57,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:21:57,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:57,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:21:57,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:21:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:21:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 18:21:57,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:21:57,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:21:57,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:21:57,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:21:57,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:21:57,793 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-26 18:22:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:02,945 INFO L93 Difference]: Finished difference Result 1903 states and 3379 transitions. [2018-10-26 18:22:02,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:22:02,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-10-26 18:22:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:02,954 INFO L225 Difference]: With dead ends: 1903 [2018-10-26 18:22:02,954 INFO L226 Difference]: Without dead ends: 1390 [2018-10-26 18:22:02,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:02,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2018-10-26 18:22:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 927. [2018-10-26 18:22:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-26 18:22:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-26 18:22:03,002 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 154 [2018-10-26 18:22:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:03,002 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-26 18:22:03,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:22:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-26 18:22:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-26 18:22:03,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:03,007 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] [2018-10-26 18:22:03,007 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:03,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash -379248445, now seen corresponding path program 1 times [2018-10-26 18:22:03,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:03,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:03,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:03,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:03,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:03,119 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-26 18:22:03,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:03,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 18:22:03,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:22:03,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:22:03,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:03,121 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-26 18:22:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:04,910 INFO L93 Difference]: Finished difference Result 2684 states and 4465 transitions. [2018-10-26 18:22:04,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:22:04,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2018-10-26 18:22:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:04,921 INFO L225 Difference]: With dead ends: 2684 [2018-10-26 18:22:04,921 INFO L226 Difference]: Without dead ends: 1759 [2018-10-26 18:22:04,923 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-26 18:22:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2018-10-26 18:22:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1744. [2018-10-26 18:22:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2018-10-26 18:22:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2808 transitions. [2018-10-26 18:22:04,961 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2808 transitions. Word has length 157 [2018-10-26 18:22:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:04,962 INFO L481 AbstractCegarLoop]: Abstraction has 1744 states and 2808 transitions. [2018-10-26 18:22:04,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:22:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2808 transitions. [2018-10-26 18:22:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-26 18:22:04,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:04,967 INFO L375 BasicCegarLoop]: trace histogram [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-26 18:22:04,968 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:04,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:04,968 INFO L82 PathProgramCache]: Analyzing trace with hash 880913707, now seen corresponding path program 1 times [2018-10-26 18:22:04,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:04,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:04,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:04,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:04,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 18:22:05,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:05,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:22:05,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:22:05,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:22:05,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:05,089 INFO L87 Difference]: Start difference. First operand 1744 states and 2808 transitions. Second operand 4 states. [2018-10-26 18:22:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:08,049 INFO L93 Difference]: Finished difference Result 6800 states and 11033 transitions. [2018-10-26 18:22:08,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:22:08,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-10-26 18:22:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:08,080 INFO L225 Difference]: With dead ends: 6800 [2018-10-26 18:22:08,081 INFO L226 Difference]: Without dead ends: 5058 [2018-10-26 18:22:08,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5058 states. [2018-10-26 18:22:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5058 to 3383. [2018-10-26 18:22:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3383 states. [2018-10-26 18:22:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 5097 transitions. [2018-10-26 18:22:08,170 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 5097 transitions. Word has length 158 [2018-10-26 18:22:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:08,170 INFO L481 AbstractCegarLoop]: Abstraction has 3383 states and 5097 transitions. [2018-10-26 18:22:08,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:22:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 5097 transitions. [2018-10-26 18:22:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-26 18:22:08,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:08,177 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 18:22:08,177 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:08,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:08,177 INFO L82 PathProgramCache]: Analyzing trace with hash 629616030, now seen corresponding path program 1 times [2018-10-26 18:22:08,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:08,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:08,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:08,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:08,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 18:22:08,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:08,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 18:22:08,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:22:08,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:22:08,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:08,283 INFO L87 Difference]: Start difference. First operand 3383 states and 5097 transitions. Second operand 3 states. [2018-10-26 18:22:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:09,463 INFO L93 Difference]: Finished difference Result 8205 states and 12323 transitions. [2018-10-26 18:22:09,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:22:09,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-10-26 18:22:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:09,484 INFO L225 Difference]: With dead ends: 8205 [2018-10-26 18:22:09,484 INFO L226 Difference]: Without dead ends: 4824 [2018-10-26 18:22:09,490 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-26 18:22:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2018-10-26 18:22:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4823. [2018-10-26 18:22:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4823 states. [2018-10-26 18:22:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 7118 transitions. [2018-10-26 18:22:09,575 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 7118 transitions. Word has length 159 [2018-10-26 18:22:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:09,575 INFO L481 AbstractCegarLoop]: Abstraction has 4823 states and 7118 transitions. [2018-10-26 18:22:09,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:22:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 7118 transitions. [2018-10-26 18:22:09,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-26 18:22:09,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:09,584 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] [2018-10-26 18:22:09,584 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:09,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:09,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1893439127, now seen corresponding path program 1 times [2018-10-26 18:22:09,584 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:09,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:09,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:09,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:09,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:09,832 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-26 18:22:09,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:09,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:22:09,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:22:09,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:22:09,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:09,834 INFO L87 Difference]: Start difference. First operand 4823 states and 7118 transitions. Second operand 3 states. [2018-10-26 18:22:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:11,565 INFO L93 Difference]: Finished difference Result 9646 states and 14238 transitions. [2018-10-26 18:22:11,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:22:11,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2018-10-26 18:22:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:11,581 INFO L225 Difference]: With dead ends: 9646 [2018-10-26 18:22:11,581 INFO L226 Difference]: Without dead ends: 4825 [2018-10-26 18:22:11,587 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-26 18:22:11,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4825 states. [2018-10-26 18:22:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4825 to 4823. [2018-10-26 18:22:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4823 states. [2018-10-26 18:22:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 6572 transitions. [2018-10-26 18:22:11,666 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 6572 transitions. Word has length 165 [2018-10-26 18:22:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:11,667 INFO L481 AbstractCegarLoop]: Abstraction has 4823 states and 6572 transitions. [2018-10-26 18:22:11,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:22:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 6572 transitions. [2018-10-26 18:22:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-26 18:22:11,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:11,675 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-10-26 18:22:11,676 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:11,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1455980942, now seen corresponding path program 1 times [2018-10-26 18:22:11,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:11,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:11,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:11,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:12,003 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 18:22:12,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 18:22:12,004 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-26 18:22:12,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:12,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 18:22:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 18:22:12,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 18:22:12,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-26 18:22:12,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 18:22:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 18:22:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 18:22:12,325 INFO L87 Difference]: Start difference. First operand 4823 states and 6572 transitions. Second operand 7 states. [2018-10-26 18:22:12,517 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 18:22:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:21,008 INFO L93 Difference]: Finished difference Result 29114 states and 38952 transitions. [2018-10-26 18:22:21,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 18:22:21,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2018-10-26 18:22:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:21,078 INFO L225 Difference]: With dead ends: 29114 [2018-10-26 18:22:21,078 INFO L226 Difference]: Without dead ends: 24293 [2018-10-26 18:22:21,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-26 18:22:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24293 states. [2018-10-26 18:22:21,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24293 to 23064. [2018-10-26 18:22:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23064 states. [2018-10-26 18:22:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23064 states to 23064 states and 27063 transitions. [2018-10-26 18:22:21,554 INFO L78 Accepts]: Start accepts. Automaton has 23064 states and 27063 transitions. Word has length 167 [2018-10-26 18:22:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:21,555 INFO L481 AbstractCegarLoop]: Abstraction has 23064 states and 27063 transitions. [2018-10-26 18:22:21,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 18:22:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 23064 states and 27063 transitions. [2018-10-26 18:22:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 18:22:21,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:21,581 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:22:21,582 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:21,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:21,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1645098079, now seen corresponding path program 1 times [2018-10-26 18:22:21,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:21,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:21,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 18:22:21,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 18:22:21,942 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-26 18:22:22,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:22,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 18:22:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 18:22:22,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 18:22:22,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-26 18:22:22,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:22:22,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:22:22,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:22,226 INFO L87 Difference]: Start difference. First operand 23064 states and 27063 transitions. Second operand 4 states. [2018-10-26 18:22:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:23,830 INFO L93 Difference]: Finished difference Result 89546 states and 105262 transitions. [2018-10-26 18:22:23,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:22:23,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-26 18:22:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:23,923 INFO L225 Difference]: With dead ends: 89546 [2018-10-26 18:22:23,923 INFO L226 Difference]: Without dead ends: 66484 [2018-10-26 18:22:23,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66484 states. [2018-10-26 18:22:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66484 to 45683. [2018-10-26 18:22:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45683 states. [2018-10-26 18:22:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45683 states to 45683 states and 53584 transitions. [2018-10-26 18:22:24,714 INFO L78 Accepts]: Start accepts. Automaton has 45683 states and 53584 transitions. Word has length 180 [2018-10-26 18:22:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:24,714 INFO L481 AbstractCegarLoop]: Abstraction has 45683 states and 53584 transitions. [2018-10-26 18:22:24,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:22:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 45683 states and 53584 transitions. [2018-10-26 18:22:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-26 18:22:24,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:24,756 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 18:22:24,756 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:24,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:24,756 INFO L82 PathProgramCache]: Analyzing trace with hash -742748129, now seen corresponding path program 1 times [2018-10-26 18:22:24,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:24,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:24,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 18:22:24,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:24,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:22:24,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:22:24,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:22:24,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:24,906 INFO L87 Difference]: Start difference. First operand 45683 states and 53584 transitions. Second operand 3 states. [2018-10-26 18:22:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:27,333 INFO L93 Difference]: Finished difference Result 102992 states and 122311 transitions. [2018-10-26 18:22:27,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:22:27,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-10-26 18:22:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:27,441 INFO L225 Difference]: With dead ends: 102992 [2018-10-26 18:22:27,441 INFO L226 Difference]: Without dead ends: 57311 [2018-10-26 18:22:27,485 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-26 18:22:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57311 states. [2018-10-26 18:22:28,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57311 to 57305. [2018-10-26 18:22:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57305 states. [2018-10-26 18:22:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57305 states to 57305 states and 65491 transitions. [2018-10-26 18:22:28,426 INFO L78 Accepts]: Start accepts. Automaton has 57305 states and 65491 transitions. Word has length 201 [2018-10-26 18:22:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:28,426 INFO L481 AbstractCegarLoop]: Abstraction has 57305 states and 65491 transitions. [2018-10-26 18:22:28,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:22:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 57305 states and 65491 transitions. [2018-10-26 18:22:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-26 18:22:28,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:28,466 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 18:22:28,466 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:28,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1113812726, now seen corresponding path program 1 times [2018-10-26 18:22:28,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:28,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:28,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:28,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 18:22:28,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:28,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 18:22:28,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:22:28,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:22:28,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:28,616 INFO L87 Difference]: Start difference. First operand 57305 states and 65491 transitions. Second operand 3 states. [2018-10-26 18:22:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:30,122 INFO L93 Difference]: Finished difference Result 113318 states and 129513 transitions. [2018-10-26 18:22:30,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:22:30,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-10-26 18:22:30,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:30,217 INFO L225 Difference]: With dead ends: 113318 [2018-10-26 18:22:30,217 INFO L226 Difference]: Without dead ends: 56015 [2018-10-26 18:22:30,254 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-26 18:22:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56015 states. [2018-10-26 18:22:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56015 to 51925. [2018-10-26 18:22:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51925 states. [2018-10-26 18:22:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51925 states to 51925 states and 59090 transitions. [2018-10-26 18:22:30,816 INFO L78 Accepts]: Start accepts. Automaton has 51925 states and 59090 transitions. Word has length 209 [2018-10-26 18:22:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:30,816 INFO L481 AbstractCegarLoop]: Abstraction has 51925 states and 59090 transitions. [2018-10-26 18:22:30,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:22:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 51925 states and 59090 transitions. [2018-10-26 18:22:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-26 18:22:30,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:30,840 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 18:22:30,840 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:30,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:30,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1036642004, now seen corresponding path program 1 times [2018-10-26 18:22:30,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:30,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:30,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:30,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 18:22:31,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:31,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 18:22:31,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:22:31,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:22:31,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:31,866 INFO L87 Difference]: Start difference. First operand 51925 states and 59090 transitions. Second operand 4 states. [2018-10-26 18:22:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:34,137 INFO L93 Difference]: Finished difference Result 112416 states and 129178 transitions. [2018-10-26 18:22:34,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:22:34,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 280 [2018-10-26 18:22:34,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:34,215 INFO L225 Difference]: With dead ends: 112416 [2018-10-26 18:22:34,215 INFO L226 Difference]: Without dead ends: 60493 [2018-10-26 18:22:34,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-26 18:22:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60493 states. [2018-10-26 18:22:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60493 to 55387. [2018-10-26 18:22:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55387 states. [2018-10-26 18:22:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55387 states to 55387 states and 63179 transitions. [2018-10-26 18:22:34,830 INFO L78 Accepts]: Start accepts. Automaton has 55387 states and 63179 transitions. Word has length 280 [2018-10-26 18:22:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:34,831 INFO L481 AbstractCegarLoop]: Abstraction has 55387 states and 63179 transitions. [2018-10-26 18:22:34,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:22:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 55387 states and 63179 transitions. [2018-10-26 18:22:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-26 18:22:34,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:34,858 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:22:34,858 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:34,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:34,858 INFO L82 PathProgramCache]: Analyzing trace with hash -548332425, now seen corresponding path program 1 times [2018-10-26 18:22:34,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:34,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:34,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:34,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:34,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 18:22:35,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:35,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 18:22:35,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:22:35,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:22:35,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:35,173 INFO L87 Difference]: Start difference. First operand 55387 states and 63179 transitions. Second operand 3 states. [2018-10-26 18:22:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:36,480 INFO L93 Difference]: Finished difference Result 148720 states and 169032 transitions. [2018-10-26 18:22:36,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:22:36,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2018-10-26 18:22:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:36,591 INFO L225 Difference]: With dead ends: 148720 [2018-10-26 18:22:36,591 INFO L226 Difference]: Without dead ends: 93335 [2018-10-26 18:22:36,641 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-26 18:22:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93335 states. [2018-10-26 18:22:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93335 to 93332. [2018-10-26 18:22:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93332 states. [2018-10-26 18:22:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93332 states to 93332 states and 105815 transitions. [2018-10-26 18:22:38,040 INFO L78 Accepts]: Start accepts. Automaton has 93332 states and 105815 transitions. Word has length 302 [2018-10-26 18:22:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:38,041 INFO L481 AbstractCegarLoop]: Abstraction has 93332 states and 105815 transitions. [2018-10-26 18:22:38,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:22:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 93332 states and 105815 transitions. [2018-10-26 18:22:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-26 18:22:38,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:38,101 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-26 18:22:38,101 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:38,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1060290557, now seen corresponding path program 1 times [2018-10-26 18:22:38,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:38,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:38,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:38,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:38,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 18:22:38,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:38,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 18:22:38,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:22:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:22:38,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:38,682 INFO L87 Difference]: Start difference. First operand 93332 states and 105815 transitions. Second operand 4 states. [2018-10-26 18:22:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:42,221 INFO L93 Difference]: Finished difference Result 186668 states and 211638 transitions. [2018-10-26 18:22:42,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:22:42,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2018-10-26 18:22:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:42,319 INFO L225 Difference]: With dead ends: 186668 [2018-10-26 18:22:42,319 INFO L226 Difference]: Without dead ends: 93338 [2018-10-26 18:22:42,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:22:42,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93338 states. [2018-10-26 18:22:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93338 to 93332. [2018-10-26 18:22:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93332 states. [2018-10-26 18:22:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93332 states to 93332 states and 102844 transitions. [2018-10-26 18:22:44,069 INFO L78 Accepts]: Start accepts. Automaton has 93332 states and 102844 transitions. Word has length 389 [2018-10-26 18:22:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:44,070 INFO L481 AbstractCegarLoop]: Abstraction has 93332 states and 102844 transitions. [2018-10-26 18:22:44,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 18:22:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 93332 states and 102844 transitions. [2018-10-26 18:22:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-26 18:22:44,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:44,109 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 18:22:44,109 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:44,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash 140313734, now seen corresponding path program 1 times [2018-10-26 18:22:44,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:44,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2018-10-26 18:22:44,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:44,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 18:22:44,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 18:22:44,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 18:22:44,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 18:22:44,440 INFO L87 Difference]: Start difference. First operand 93332 states and 102844 transitions. Second operand 5 states. [2018-10-26 18:22:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:47,383 INFO L93 Difference]: Finished difference Result 257683 states and 284346 transitions. [2018-10-26 18:22:47,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 18:22:47,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 406 [2018-10-26 18:22:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:47,546 INFO L225 Difference]: With dead ends: 257683 [2018-10-26 18:22:47,546 INFO L226 Difference]: Without dead ends: 164353 [2018-10-26 18:22:47,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 18:22:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164353 states. [2018-10-26 18:22:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164353 to 156504. [2018-10-26 18:22:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156504 states. [2018-10-26 18:22:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156504 states to 156504 states and 171756 transitions. [2018-10-26 18:22:50,158 INFO L78 Accepts]: Start accepts. Automaton has 156504 states and 171756 transitions. Word has length 406 [2018-10-26 18:22:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:50,158 INFO L481 AbstractCegarLoop]: Abstraction has 156504 states and 171756 transitions. [2018-10-26 18:22:50,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 18:22:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 156504 states and 171756 transitions. [2018-10-26 18:22:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-26 18:22:50,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:50,201 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 18:22:50,202 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:50,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:50,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1264213576, now seen corresponding path program 1 times [2018-10-26 18:22:50,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:50,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:50,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:50,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:50,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 18:22:50,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:22:50,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 18:22:50,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 18:22:50,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 18:22:50,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 18:22:50,580 INFO L87 Difference]: Start difference. First operand 156504 states and 171756 transitions. Second operand 3 states. [2018-10-26 18:22:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:22:53,259 INFO L93 Difference]: Finished difference Result 301719 states and 331127 transitions. [2018-10-26 18:22:53,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 18:22:53,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 411 [2018-10-26 18:22:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:22:53,393 INFO L225 Difference]: With dead ends: 301719 [2018-10-26 18:22:53,393 INFO L226 Difference]: Without dead ends: 145217 [2018-10-26 18:22:53,460 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-26 18:22:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145217 states. [2018-10-26 18:22:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145217 to 145213. [2018-10-26 18:22:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145213 states. [2018-10-26 18:22:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145213 states to 145213 states and 156235 transitions. [2018-10-26 18:22:56,312 INFO L78 Accepts]: Start accepts. Automaton has 145213 states and 156235 transitions. Word has length 411 [2018-10-26 18:22:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:22:56,312 INFO L481 AbstractCegarLoop]: Abstraction has 145213 states and 156235 transitions. [2018-10-26 18:22:56,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 18:22:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 145213 states and 156235 transitions. [2018-10-26 18:22:56,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-26 18:22:56,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:22:56,356 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:22:56,357 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:22:56,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:22:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash -777549419, now seen corresponding path program 1 times [2018-10-26 18:22:56,357 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:22:56,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:22:56,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:56,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:22:56,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:22:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:22:57,345 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-10-26 18:23:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 417 proven. 173 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 18:23:01,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 18:23:01,763 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-26 18:23:01,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:23:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:23:01,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 18:23:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 561 proven. 29 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 18:23:03,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 18:23:03,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2018-10-26 18:23:03,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 18:23:03,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 18:23:03,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-10-26 18:23:03,037 INFO L87 Difference]: Start difference. First operand 145213 states and 156235 transitions. Second operand 14 states. [2018-10-26 18:23:03,195 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-10-26 18:23:04,222 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-10-26 18:23:07,634 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-10-26 18:23:17,827 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-10-26 18:23:19,583 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-10-26 18:23:22,966 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-10-26 18:23:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:23:24,731 INFO L93 Difference]: Finished difference Result 859342 states and 922608 transitions. [2018-10-26 18:23:24,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-26 18:23:24,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 474 [2018-10-26 18:23:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:23:25,858 INFO L225 Difference]: With dead ends: 859342 [2018-10-26 18:23:25,858 INFO L226 Difference]: Without dead ends: 714131 [2018-10-26 18:23:26,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 470 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=595, Invalid=1661, Unknown=0, NotChecked=0, Total=2256 [2018-10-26 18:23:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714131 states. [2018-10-26 18:23:36,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714131 to 678837. [2018-10-26 18:23:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678837 states. [2018-10-26 18:23:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678837 states to 678837 states and 728507 transitions. [2018-10-26 18:23:37,162 INFO L78 Accepts]: Start accepts. Automaton has 678837 states and 728507 transitions. Word has length 474 [2018-10-26 18:23:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:23:37,163 INFO L481 AbstractCegarLoop]: Abstraction has 678837 states and 728507 transitions. [2018-10-26 18:23:37,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 18:23:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 678837 states and 728507 transitions. [2018-10-26 18:23:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-10-26 18:23:37,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:23:37,309 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 18:23:37,309 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:23:37,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:23:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash -999745126, now seen corresponding path program 1 times [2018-10-26 18:23:37,310 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:23:37,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:23:37,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:37,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:23:37,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:23:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:23:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 385 proven. 63 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-10-26 18:23:39,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 18:23:39,555 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 18:23:39,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:23:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:23:39,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 18:23:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-10-26 18:23:40,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 18:23:40,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-26 18:23:40,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 18:23:40,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 18:23:40,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-26 18:23:40,023 INFO L87 Difference]: Start difference. First operand 678837 states and 728507 transitions. Second operand 9 states. [2018-10-26 18:23:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:23:59,294 INFO L93 Difference]: Finished difference Result 1711031 states and 1839132 transitions. [2018-10-26 18:23:59,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 18:23:59,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 475 [2018-10-26 18:23:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:24:00,454 INFO L225 Difference]: With dead ends: 1711031 [2018-10-26 18:24:00,454 INFO L226 Difference]: Without dead ends: 1032196 [2018-10-26 18:24:00,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-10-26 18:24:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032196 states. [2018-10-26 18:24:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032196 to 918908. [2018-10-26 18:24:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918908 states. [2018-10-26 18:24:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918908 states to 918908 states and 977035 transitions. [2018-10-26 18:24:15,398 INFO L78 Accepts]: Start accepts. Automaton has 918908 states and 977035 transitions. Word has length 475 [2018-10-26 18:24:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 18:24:15,398 INFO L481 AbstractCegarLoop]: Abstraction has 918908 states and 977035 transitions. [2018-10-26 18:24:15,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 18:24:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 918908 states and 977035 transitions. [2018-10-26 18:24:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-10-26 18:24:24,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 18:24:24,378 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 18:24:24,379 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 18:24:24,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 18:24:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1544941289, now seen corresponding path program 1 times [2018-10-26 18:24:24,379 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 18:24:24,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 18:24:24,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:24:24,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 18:24:24,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 18:24:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 18:24:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-10-26 18:24:24,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 18:24:24,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 18:24:24,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 18:24:24,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 18:24:24,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 18:24:24,766 INFO L87 Difference]: Start difference. First operand 918908 states and 977035 transitions. Second operand 4 states. [2018-10-26 18:24:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 18:24:37,238 INFO L93 Difference]: Finished difference Result 2325709 states and 2469648 transitions. [2018-10-26 18:24:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 18:24:37,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 485 [2018-10-26 18:24:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 18:24:38,985 INFO L225 Difference]: With dead ends: 2325709 [2018-10-26 18:24:38,985 INFO L226 Difference]: Without dead ends: 1397783 [2018-10-26 18:24:39,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-26 18:24:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397783 states. Received shutdown request... [2018-10-26 18:25:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397783 to 1125248. [2018-10-26 18:25:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125248 states. [2018-10-26 18:25:16,520 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 18:25:16,525 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 18:25:16,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 06:25:16 BoogieIcfgContainer [2018-10-26 18:25:16,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 18:25:16,527 INFO L168 Benchmark]: Toolchain (without parser) took 210343.75 ms. Allocated memory was 1.5 GB in the beginning and 7.2 GB in the end (delta: 5.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.6 GB). Peak memory consumption was 6.4 GB. Max. memory is 7.1 GB. [2018-10-26 18:25:16,528 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 18:25:16,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1166.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2018-10-26 18:25:16,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 313.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 770.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -896.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-26 18:25:16,530 INFO L168 Benchmark]: Boogie Preprocessor took 130.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-26 18:25:16,531 INFO L168 Benchmark]: RCFGBuilder took 5407.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 269.0 MB). Peak memory consumption was 269.0 MB. Max. memory is 7.1 GB. [2018-10-26 18:25:16,532 INFO L168 Benchmark]: TraceAbstraction took 203320.52 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 6.2 GB. Max. memory is 7.1 GB. [2018-10-26 18:25:16,540 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1166.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 313.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 770.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -896.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5407.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 269.0 MB). Peak memory consumption was 269.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203320.52 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 6.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1476]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1476). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 203.2s OverallTime, 18 OverallIterations, 8 TraceHistogramMax, 102.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5617 SDtfs, 16640 SDslu, 5920 SDs, 0 SdLazy, 30341 SolverSat, 5820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1420 GetRequests, 1315 SyntacticMatches, 10 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=918908occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 75.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 190096 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 6216 NumberOfCodeBlocks, 6216 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6194 ConstructedInterpolants, 0 QuantifiedInterpolants, 11960323 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2327 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 22 InterpolantComputations, 17 PerfectInterpolantSequences, 5293/5572 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown