/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label16.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:33:52,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:33:52,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:33:52,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:33:52,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:33:52,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:33:52,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:33:52,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:33:52,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:33:52,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:33:52,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:33:52,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:33:52,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:33:52,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:33:52,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:33:52,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:33:52,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:33:52,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:33:52,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:33:52,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:33:52,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:33:52,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:33:52,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:33:52,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:33:52,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:33:52,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:33:52,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:33:52,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:33:52,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:33:52,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:33:52,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:33:52,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:33:52,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:33:52,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:33:52,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:33:52,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:33:52,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:33:52,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:33:52,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:33:52,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:33:52,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:33:52,330 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:33:52,345 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:33:52,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:33:52,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:33:52,347 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:33:52,347 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:33:52,347 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:33:52,347 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:33:52,347 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:33:52,348 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:33:52,348 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:33:52,348 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:33:52,348 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:33:52,348 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:33:52,349 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:33:52,349 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:33:52,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:33:52,350 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:33:52,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:33:52,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:33:52,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:33:52,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:33:52,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:33:52,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:33:52,351 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:33:52,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:33:52,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:33:52,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:33:52,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:33:52,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:33:52,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:33:52,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:33:52,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:33:52,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:33:52,353 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:33:52,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:33:52,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:33:52,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:33:52,354 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:33:52,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:33:52,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:33:52,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:33:52,648 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:33:52,648 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:33:52,649 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label16.c [2019-11-23 23:33:52,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a812386a/76a09908eee544388bbbe6babd583dec/FLAG5fcd75b4d [2019-11-23 23:33:53,377 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:33:53,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label16.c [2019-11-23 23:33:53,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a812386a/76a09908eee544388bbbe6babd583dec/FLAG5fcd75b4d [2019-11-23 23:33:53,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a812386a/76a09908eee544388bbbe6babd583dec [2019-11-23 23:33:53,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:33:53,529 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:33:53,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:53,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:33:53,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:33:53,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:53" (1/1) ... [2019-11-23 23:33:53,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41437b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:53, skipping insertion in model container [2019-11-23 23:33:53,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:53" (1/1) ... [2019-11-23 23:33:53,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:33:53,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:33:54,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:54,398 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:33:54,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:54,720 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:33:54,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54 WrapperNode [2019-11-23 23:33:54,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:54,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:54,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:33:54,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:33:54,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54" (1/1) ... [2019-11-23 23:33:54,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54" (1/1) ... [2019-11-23 23:33:54,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:54,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:33:54,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:33:54,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:33:54,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54" (1/1) ... [2019-11-23 23:33:54,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54" (1/1) ... [2019-11-23 23:33:54,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54" (1/1) ... [2019-11-23 23:33:54,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54" (1/1) ... [2019-11-23 23:33:54,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54" (1/1) ... [2019-11-23 23:33:54,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54" (1/1) ... [2019-11-23 23:33:54,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54" (1/1) ... [2019-11-23 23:33:54,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:33:54,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:33:54,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:33:54,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:33:55,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-11-23 23:33:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:33:55,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:33:58,003 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:33:58,003 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:33:58,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:58 BoogieIcfgContainer [2019-11-23 23:33:58,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:33:58,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:33:58,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:33:58,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:33:58,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:33:53" (1/3) ... [2019-11-23 23:33:58,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16aad1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:58, skipping insertion in model container [2019-11-23 23:33:58,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:54" (2/3) ... [2019-11-23 23:33:58,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16aad1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:58, skipping insertion in model container [2019-11-23 23:33:58,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:58" (3/3) ... [2019-11-23 23:33:58,013 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label16.c [2019-11-23 23:33:58,023 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:33:58,031 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:33:58,044 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:33:58,073 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:33:58,074 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:33:58,074 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:33:58,074 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:33:58,074 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:33:58,074 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:33:58,074 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:33:58,075 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:33:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:33:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:33:58,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:58,124 INFO L410 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] [2019-11-23 23:33:58,125 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:58,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1467447519, now seen corresponding path program 1 times [2019-11-23 23:33:58,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:58,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904986012] [2019-11-23 23:33:58,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:58,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904986012] [2019-11-23 23:33:58,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:58,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:58,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310464487] [2019-11-23 23:33:58,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:58,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:58,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:58,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:58,892 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:34:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:00,637 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:34:00,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:00,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:34:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:00,660 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:34:00,660 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:34:00,667 INFO L630 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 [2019-11-23 23:34:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:34:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-11-23 23:34:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:34:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 515 transitions. [2019-11-23 23:34:00,730 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 515 transitions. Word has length 143 [2019-11-23 23:34:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:00,731 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 515 transitions. [2019-11-23 23:34:00,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 515 transitions. [2019-11-23 23:34:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:34:00,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:00,736 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:34:00,736 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:00,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:00,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1977874496, now seen corresponding path program 1 times [2019-11-23 23:34:00,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:00,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924175314] [2019-11-23 23:34:00,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:00,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924175314] [2019-11-23 23:34:00,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:00,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:00,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549996575] [2019-11-23 23:34:00,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:00,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:00,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:00,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:00,872 INFO L87 Difference]: Start difference. First operand 289 states and 515 transitions. Second operand 3 states. [2019-11-23 23:34:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:01,914 INFO L93 Difference]: Finished difference Result 863 states and 1542 transitions. [2019-11-23 23:34:01,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:01,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:34:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:01,918 INFO L225 Difference]: With dead ends: 863 [2019-11-23 23:34:01,919 INFO L226 Difference]: Without dead ends: 575 [2019-11-23 23:34:01,921 INFO L630 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 [2019-11-23 23:34:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-11-23 23:34:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-11-23 23:34:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:34:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1000 transitions. [2019-11-23 23:34:01,957 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1000 transitions. Word has length 151 [2019-11-23 23:34:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:01,958 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1000 transitions. [2019-11-23 23:34:01,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1000 transitions. [2019-11-23 23:34:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:34:01,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:01,964 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:34:01,964 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:01,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash 351582973, now seen corresponding path program 1 times [2019-11-23 23:34:01,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:01,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396617460] [2019-11-23 23:34:01,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:02,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396617460] [2019-11-23 23:34:02,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:02,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:02,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080117434] [2019-11-23 23:34:02,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:02,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:02,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:02,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:02,164 INFO L87 Difference]: Start difference. First operand 575 states and 1000 transitions. Second operand 3 states. [2019-11-23 23:34:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:03,067 INFO L93 Difference]: Finished difference Result 1721 states and 2997 transitions. [2019-11-23 23:34:03,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:03,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 23:34:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:03,075 INFO L225 Difference]: With dead ends: 1721 [2019-11-23 23:34:03,075 INFO L226 Difference]: Without dead ends: 1147 [2019-11-23 23:34:03,077 INFO L630 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 [2019-11-23 23:34:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2019-11-23 23:34:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2019-11-23 23:34:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-23 23:34:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1929 transitions. [2019-11-23 23:34:03,120 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1929 transitions. Word has length 158 [2019-11-23 23:34:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:03,120 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1929 transitions. [2019-11-23 23:34:03,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1929 transitions. [2019-11-23 23:34:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 23:34:03,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:03,127 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:03,127 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:03,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1321517535, now seen corresponding path program 1 times [2019-11-23 23:34:03,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:03,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298661377] [2019-11-23 23:34:03,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:03,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298661377] [2019-11-23 23:34:03,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:03,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:03,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111836360] [2019-11-23 23:34:03,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:03,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:03,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:03,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:03,249 INFO L87 Difference]: Start difference. First operand 1147 states and 1929 transitions. Second operand 3 states. [2019-11-23 23:34:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:04,169 INFO L93 Difference]: Finished difference Result 3437 states and 5784 transitions. [2019-11-23 23:34:04,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:04,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-23 23:34:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:04,182 INFO L225 Difference]: With dead ends: 3437 [2019-11-23 23:34:04,182 INFO L226 Difference]: Without dead ends: 2291 [2019-11-23 23:34:04,185 INFO L630 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 [2019-11-23 23:34:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2019-11-23 23:34:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2019-11-23 23:34:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-11-23 23:34:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3537 transitions. [2019-11-23 23:34:04,243 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3537 transitions. Word has length 164 [2019-11-23 23:34:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:04,244 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 3537 transitions. [2019-11-23 23:34:04,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3537 transitions. [2019-11-23 23:34:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-23 23:34:04,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:04,250 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:04,250 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:04,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:04,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1805095859, now seen corresponding path program 1 times [2019-11-23 23:34:04,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:04,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715024678] [2019-11-23 23:34:04,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 23:34:04,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715024678] [2019-11-23 23:34:04,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:04,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:04,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148741096] [2019-11-23 23:34:04,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:04,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:04,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:04,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:04,334 INFO L87 Difference]: Start difference. First operand 2291 states and 3537 transitions. Second operand 3 states. [2019-11-23 23:34:05,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:05,277 INFO L93 Difference]: Finished difference Result 6869 states and 10608 transitions. [2019-11-23 23:34:05,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:05,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-23 23:34:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:05,301 INFO L225 Difference]: With dead ends: 6869 [2019-11-23 23:34:05,301 INFO L226 Difference]: Without dead ends: 4579 [2019-11-23 23:34:05,306 INFO L630 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 [2019-11-23 23:34:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2019-11-23 23:34:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 4579. [2019-11-23 23:34:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4579 states. [2019-11-23 23:34:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 6271 transitions. [2019-11-23 23:34:05,406 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 6271 transitions. Word has length 168 [2019-11-23 23:34:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:05,406 INFO L462 AbstractCegarLoop]: Abstraction has 4579 states and 6271 transitions. [2019-11-23 23:34:05,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:05,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 6271 transitions. [2019-11-23 23:34:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 23:34:05,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:05,416 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:05,416 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:05,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1226754914, now seen corresponding path program 1 times [2019-11-23 23:34:05,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:05,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377001065] [2019-11-23 23:34:05,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:05,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377001065] [2019-11-23 23:34:05,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:05,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:05,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626960635] [2019-11-23 23:34:05,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:05,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:05,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:05,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:05,500 INFO L87 Difference]: Start difference. First operand 4579 states and 6271 transitions. Second operand 4 states. [2019-11-23 23:34:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:06,972 INFO L93 Difference]: Finished difference Result 13306 states and 18553 transitions. [2019-11-23 23:34:06,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:06,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-23 23:34:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:07,009 INFO L225 Difference]: With dead ends: 13306 [2019-11-23 23:34:07,009 INFO L226 Difference]: Without dead ends: 8728 [2019-11-23 23:34:07,016 INFO L630 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 [2019-11-23 23:34:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2019-11-23 23:34:07,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 6438. [2019-11-23 23:34:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6438 states. [2019-11-23 23:34:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6438 states to 6438 states and 8651 transitions. [2019-11-23 23:34:07,170 INFO L78 Accepts]: Start accepts. Automaton has 6438 states and 8651 transitions. Word has length 173 [2019-11-23 23:34:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:07,171 INFO L462 AbstractCegarLoop]: Abstraction has 6438 states and 8651 transitions. [2019-11-23 23:34:07,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6438 states and 8651 transitions. [2019-11-23 23:34:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-23 23:34:07,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:07,186 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:07,186 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1350376054, now seen corresponding path program 1 times [2019-11-23 23:34:07,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:07,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311085833] [2019-11-23 23:34:07,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 23:34:07,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311085833] [2019-11-23 23:34:07,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:07,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:07,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657530546] [2019-11-23 23:34:07,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:07,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:07,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:07,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:07,293 INFO L87 Difference]: Start difference. First operand 6438 states and 8651 transitions. Second operand 3 states. [2019-11-23 23:34:07,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:07,782 INFO L93 Difference]: Finished difference Result 11874 states and 15993 transitions. [2019-11-23 23:34:07,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:07,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-23 23:34:07,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:07,802 INFO L225 Difference]: With dead ends: 11874 [2019-11-23 23:34:07,802 INFO L226 Difference]: Without dead ends: 5437 [2019-11-23 23:34:07,809 INFO L630 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 [2019-11-23 23:34:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2019-11-23 23:34:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 5437. [2019-11-23 23:34:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5437 states. [2019-11-23 23:34:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5437 states to 5437 states and 7105 transitions. [2019-11-23 23:34:07,908 INFO L78 Accepts]: Start accepts. Automaton has 5437 states and 7105 transitions. Word has length 186 [2019-11-23 23:34:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:07,909 INFO L462 AbstractCegarLoop]: Abstraction has 5437 states and 7105 transitions. [2019-11-23 23:34:07,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 5437 states and 7105 transitions. [2019-11-23 23:34:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 23:34:07,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:07,918 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:07,919 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:07,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2095502984, now seen corresponding path program 1 times [2019-11-23 23:34:07,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:07,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206468105] [2019-11-23 23:34:07,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:08,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206468105] [2019-11-23 23:34:08,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:08,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:08,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937685168] [2019-11-23 23:34:08,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:08,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:08,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:08,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:08,074 INFO L87 Difference]: Start difference. First operand 5437 states and 7105 transitions. Second operand 3 states. [2019-11-23 23:34:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:08,998 INFO L93 Difference]: Finished difference Result 12732 states and 16820 transitions. [2019-11-23 23:34:08,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:08,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-23 23:34:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:09,022 INFO L225 Difference]: With dead ends: 12732 [2019-11-23 23:34:09,023 INFO L226 Difference]: Without dead ends: 7296 [2019-11-23 23:34:09,029 INFO L630 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 [2019-11-23 23:34:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7296 states. [2019-11-23 23:34:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7296 to 7296. [2019-11-23 23:34:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7296 states. [2019-11-23 23:34:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 8992 transitions. [2019-11-23 23:34:09,135 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 8992 transitions. Word has length 194 [2019-11-23 23:34:09,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:09,136 INFO L462 AbstractCegarLoop]: Abstraction has 7296 states and 8992 transitions. [2019-11-23 23:34:09,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 8992 transitions. [2019-11-23 23:34:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-23 23:34:09,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:09,150 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:34:09,150 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:09,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1306454027, now seen corresponding path program 1 times [2019-11-23 23:34:09,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:09,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979893794] [2019-11-23 23:34:09,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 23:34:09,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979893794] [2019-11-23 23:34:09,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:09,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:09,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410899278] [2019-11-23 23:34:09,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:09,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:09,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:09,270 INFO L87 Difference]: Start difference. First operand 7296 states and 8992 transitions. Second operand 3 states. [2019-11-23 23:34:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:10,417 INFO L93 Difference]: Finished difference Result 17880 states and 22081 transitions. [2019-11-23 23:34:10,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:10,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-11-23 23:34:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:10,439 INFO L225 Difference]: With dead ends: 17880 [2019-11-23 23:34:10,439 INFO L226 Difference]: Without dead ends: 10585 [2019-11-23 23:34:10,448 INFO L630 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 [2019-11-23 23:34:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10585 states. [2019-11-23 23:34:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10585 to 10585. [2019-11-23 23:34:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10585 states. [2019-11-23 23:34:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10585 states to 10585 states and 12853 transitions. [2019-11-23 23:34:10,612 INFO L78 Accepts]: Start accepts. Automaton has 10585 states and 12853 transitions. Word has length 222 [2019-11-23 23:34:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:10,612 INFO L462 AbstractCegarLoop]: Abstraction has 10585 states and 12853 transitions. [2019-11-23 23:34:10,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10585 states and 12853 transitions. [2019-11-23 23:34:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-23 23:34:10,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:10,633 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:10,633 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash -326065362, now seen corresponding path program 1 times [2019-11-23 23:34:10,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:10,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801122307] [2019-11-23 23:34:10,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 23:34:10,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801122307] [2019-11-23 23:34:10,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:10,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:10,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820465297] [2019-11-23 23:34:10,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:10,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:10,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:10,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:10,829 INFO L87 Difference]: Start difference. First operand 10585 states and 12853 transitions. Second operand 4 states. [2019-11-23 23:34:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:11,912 INFO L93 Difference]: Finished difference Result 23745 states and 29031 transitions. [2019-11-23 23:34:11,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:11,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-11-23 23:34:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:11,942 INFO L225 Difference]: With dead ends: 23745 [2019-11-23 23:34:11,943 INFO L226 Difference]: Without dead ends: 13161 [2019-11-23 23:34:11,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13161 states. [2019-11-23 23:34:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13161 to 11157. [2019-11-23 23:34:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11157 states. [2019-11-23 23:34:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11157 states to 11157 states and 13641 transitions. [2019-11-23 23:34:12,213 INFO L78 Accepts]: Start accepts. Automaton has 11157 states and 13641 transitions. Word has length 228 [2019-11-23 23:34:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:12,213 INFO L462 AbstractCegarLoop]: Abstraction has 11157 states and 13641 transitions. [2019-11-23 23:34:12,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11157 states and 13641 transitions. [2019-11-23 23:34:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-23 23:34:12,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:12,230 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:12,230 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1191567524, now seen corresponding path program 1 times [2019-11-23 23:34:12,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:12,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318663959] [2019-11-23 23:34:12,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 23:34:12,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318663959] [2019-11-23 23:34:12,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:12,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:34:12,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114518355] [2019-11-23 23:34:12,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:34:12,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:12,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:34:12,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:34:12,418 INFO L87 Difference]: Start difference. First operand 11157 states and 13641 transitions. Second operand 5 states. [2019-11-23 23:34:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:13,979 INFO L93 Difference]: Finished difference Result 32897 states and 39997 transitions. [2019-11-23 23:34:13,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:34:13,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2019-11-23 23:34:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:14,017 INFO L225 Difference]: With dead ends: 32897 [2019-11-23 23:34:14,017 INFO L226 Difference]: Without dead ends: 21741 [2019-11-23 23:34:14,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:34:14,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21741 states. [2019-11-23 23:34:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21741 to 21739. [2019-11-23 23:34:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21739 states. [2019-11-23 23:34:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21739 states to 21739 states and 26304 transitions. [2019-11-23 23:34:15,025 INFO L78 Accepts]: Start accepts. Automaton has 21739 states and 26304 transitions. Word has length 242 [2019-11-23 23:34:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:15,025 INFO L462 AbstractCegarLoop]: Abstraction has 21739 states and 26304 transitions. [2019-11-23 23:34:15,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:34:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 21739 states and 26304 transitions. [2019-11-23 23:34:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-11-23 23:34:15,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:15,047 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:15,047 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:15,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:15,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1984927060, now seen corresponding path program 1 times [2019-11-23 23:34:15,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:15,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440094951] [2019-11-23 23:34:15,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:15,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440094951] [2019-11-23 23:34:15,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:15,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:15,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877799828] [2019-11-23 23:34:15,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:15,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:15,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:15,222 INFO L87 Difference]: Start difference. First operand 21739 states and 26304 transitions. Second operand 4 states. [2019-11-23 23:34:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:16,651 INFO L93 Difference]: Finished difference Result 45050 states and 54615 transitions. [2019-11-23 23:34:16,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:16,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2019-11-23 23:34:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:16,679 INFO L225 Difference]: With dead ends: 45050 [2019-11-23 23:34:16,679 INFO L226 Difference]: Without dead ends: 23312 [2019-11-23 23:34:16,698 INFO L630 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 [2019-11-23 23:34:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23312 states. [2019-11-23 23:34:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23312 to 22883. [2019-11-23 23:34:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-11-23 23:34:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 27703 transitions. [2019-11-23 23:34:17,131 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 27703 transitions. Word has length 249 [2019-11-23 23:34:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:17,131 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 27703 transitions. [2019-11-23 23:34:17,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 27703 transitions. [2019-11-23 23:34:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 23:34:17,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:17,147 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:17,147 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:17,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1882270487, now seen corresponding path program 1 times [2019-11-23 23:34:17,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:17,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771629258] [2019-11-23 23:34:17,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:17,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771629258] [2019-11-23 23:34:17,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:17,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:17,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998955428] [2019-11-23 23:34:17,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:17,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:17,348 INFO L87 Difference]: Start difference. First operand 22883 states and 27703 transitions. Second operand 4 states. [2019-11-23 23:34:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:18,414 INFO L93 Difference]: Finished difference Result 45765 states and 55405 transitions. [2019-11-23 23:34:18,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:18,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-23 23:34:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:18,436 INFO L225 Difference]: With dead ends: 45765 [2019-11-23 23:34:18,437 INFO L226 Difference]: Without dead ends: 22883 [2019-11-23 23:34:18,450 INFO L630 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 [2019-11-23 23:34:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22883 states. [2019-11-23 23:34:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22883 to 22883. [2019-11-23 23:34:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-11-23 23:34:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 27307 transitions. [2019-11-23 23:34:18,919 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 27307 transitions. Word has length 252 [2019-11-23 23:34:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:18,919 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 27307 transitions. [2019-11-23 23:34:18,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 27307 transitions. [2019-11-23 23:34:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-23 23:34:18,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:18,930 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:34:18,930 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash -929794377, now seen corresponding path program 1 times [2019-11-23 23:34:18,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:18,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747186168] [2019-11-23 23:34:18,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:19,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747186168] [2019-11-23 23:34:19,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:19,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:19,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160384422] [2019-11-23 23:34:19,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:19,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:19,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:19,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:19,066 INFO L87 Difference]: Start difference. First operand 22883 states and 27307 transitions. Second operand 3 states. [2019-11-23 23:34:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:20,008 INFO L93 Difference]: Finished difference Result 46337 states and 55140 transitions. [2019-11-23 23:34:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:20,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-23 23:34:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:20,028 INFO L225 Difference]: With dead ends: 46337 [2019-11-23 23:34:20,028 INFO L226 Difference]: Without dead ends: 23455 [2019-11-23 23:34:20,041 INFO L630 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 [2019-11-23 23:34:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23455 states. [2019-11-23 23:34:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23455 to 22311. [2019-11-23 23:34:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22311 states. [2019-11-23 23:34:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22311 states to 22311 states and 25842 transitions. [2019-11-23 23:34:20,279 INFO L78 Accepts]: Start accepts. Automaton has 22311 states and 25842 transitions. Word has length 269 [2019-11-23 23:34:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:20,279 INFO L462 AbstractCegarLoop]: Abstraction has 22311 states and 25842 transitions. [2019-11-23 23:34:20,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 22311 states and 25842 transitions. [2019-11-23 23:34:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-23 23:34:20,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:20,287 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:34:20,287 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:20,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1796674349, now seen corresponding path program 1 times [2019-11-23 23:34:20,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:20,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046351813] [2019-11-23 23:34:20,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:20,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046351813] [2019-11-23 23:34:20,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84932167] [2019-11-23 23:34:20,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:21,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:34:21,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:21,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:34:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:21,232 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:21,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:34:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:21,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1665848] [2019-11-23 23:34:21,426 INFO L159 IcfgInterpreter]: Started Sifa with 145 locations of interest [2019-11-23 23:34:21,426 INFO L166 IcfgInterpreter]: Building call graph [2019-11-23 23:34:21,433 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-23 23:34:21,443 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-23 23:34:21,443 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-23 23:34:22,805 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-11-23 23:34:23,010 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 160 [2019-11-23 23:34:48,263 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 22 [2019-11-23 23:34:48,505 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5820 conjuctions. This might take some time... [2019-11-23 23:34:48,849 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 22 [2019-11-23 23:34:49,089 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5820 conjuctions. This might take some time... [2019-11-23 23:34:49,464 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 22 [2019-11-23 23:34:49,716 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5820 conjuctions. This might take some time... [2019-11-23 23:34:59,519 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-23 23:35:01,907 WARN L192 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 231 DAG size of output: 203 [2019-11-23 23:35:04,254 WARN L192 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 232 DAG size of output: 206 [2019-11-23 23:35:06,732 WARN L192 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 234 DAG size of output: 204 [2019-11-23 23:35:07,189 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-11-23 23:35:08,822 WARN L192 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 172 [2019-11-23 23:35:10,809 WARN L192 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 195 DAG size of output: 169 [2019-11-23 23:35:12,621 WARN L192 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 193 DAG size of output: 163 [2019-11-23 23:35:13,662 WARN L192 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 166 [2019-11-23 23:35:14,620 WARN L192 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 164 [2019-11-23 23:35:15,625 WARN L192 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 166