/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/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:48:35,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:48:35,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:48:35,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:48:35,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:48:35,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:48:35,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:48:35,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:48:35,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:48:35,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:48:35,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:48:35,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:48:35,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:48:35,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:48:35,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:48:35,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:48:35,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:48:35,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:48:35,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:48:35,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:48:35,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:48:35,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:48:35,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:48:35,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:48:35,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:48:35,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:48:35,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:48:35,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:48:35,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:48:35,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:48:35,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:48:35,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:48:35,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:48:35,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:48:35,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:48:35,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:48:35,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:48:35,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:48:35,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:48:35,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:48:35,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:48:35,299 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-24 05:48:35,319 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:48:35,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:48:35,321 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:48:35,321 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:48:35,321 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:48:35,321 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:48:35,321 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:48:35,322 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:48:35,322 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:48:35,322 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:48:35,323 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:48:35,323 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:48:35,323 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:48:35,324 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:48:35,324 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:48:35,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:48:35,325 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:48:35,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:48:35,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:48:35,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:48:35,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:48:35,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:48:35,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:48:35,326 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:48:35,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:48:35,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:48:35,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:48:35,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:48:35,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:48:35,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:48:35,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:48:35,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:48:35,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:48:35,329 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:48:35,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:48:35,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:48:35,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:48:35,330 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:48:35,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:48:35,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:48:35,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:48:35,620 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:48:35,620 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:48:35,621 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-24 05:48:35,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7849f8d41/421ce86808934076b60c699acd165d59/FLAG8a0862c3b [2019-11-24 05:48:36,254 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:48:36,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-24 05:48:36,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7849f8d41/421ce86808934076b60c699acd165d59/FLAG8a0862c3b [2019-11-24 05:48:36,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7849f8d41/421ce86808934076b60c699acd165d59 [2019-11-24 05:48:36,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:48:36,472 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:48:36,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:48:36,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:48:36,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:48:36,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:48:36" (1/1) ... [2019-11-24 05:48:36,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f904b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:36, skipping insertion in model container [2019-11-24 05:48:36,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:48:36" (1/1) ... [2019-11-24 05:48:36,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:48:36,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:48:37,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:48:37,345 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:48:37,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:48:37,588 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:48:37,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37 WrapperNode [2019-11-24 05:48:37,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:48:37,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:48:37,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:48:37,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:48:37,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37" (1/1) ... [2019-11-24 05:48:37,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37" (1/1) ... [2019-11-24 05:48:37,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:48:37,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:48:37,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:48:37,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:48:37,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37" (1/1) ... [2019-11-24 05:48:37,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37" (1/1) ... [2019-11-24 05:48:37,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37" (1/1) ... [2019-11-24 05:48:37,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37" (1/1) ... [2019-11-24 05:48:37,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37" (1/1) ... [2019-11-24 05:48:37,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37" (1/1) ... [2019-11-24 05:48:37,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37" (1/1) ... [2019-11-24 05:48:37,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:48:37,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:48:37,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:48:37,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:48:37,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37" (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-24 05:48:37,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:48:37,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:48:40,848 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:48:40,848 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:48:40,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:48:40 BoogieIcfgContainer [2019-11-24 05:48:40,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:48:40,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:48:40,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:48:40,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:48:40,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:48:36" (1/3) ... [2019-11-24 05:48:40,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6476f287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:48:40, skipping insertion in model container [2019-11-24 05:48:40,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:37" (2/3) ... [2019-11-24 05:48:40,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6476f287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:48:40, skipping insertion in model container [2019-11-24 05:48:40,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:48:40" (3/3) ... [2019-11-24 05:48:40,862 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-24 05:48:40,872 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:48:40,883 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 05:48:40,896 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 05:48:40,931 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:48:40,932 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:48:40,932 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:48:40,932 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:48:40,932 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:48:40,932 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:48:40,932 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:48:40,932 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:48:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2019-11-24 05:48:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-24 05:48:40,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:40,970 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] [2019-11-24 05:48:40,971 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:40,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:40,976 INFO L82 PathProgramCache]: Analyzing trace with hash 584471438, now seen corresponding path program 1 times [2019-11-24 05:48:40,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:40,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904747998] [2019-11-24 05:48:40,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:41,878 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-24 05:48:41,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904747998] [2019-11-24 05:48:41,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:41,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:41,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802669774] [2019-11-24 05:48:41,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:41,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:41,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:41,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:41,904 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 5 states. [2019-11-24 05:48:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:42,092 INFO L93 Difference]: Finished difference Result 810 states and 1423 transitions. [2019-11-24 05:48:42,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:42,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-11-24 05:48:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:42,112 INFO L225 Difference]: With dead ends: 810 [2019-11-24 05:48:42,112 INFO L226 Difference]: Without dead ends: 557 [2019-11-24 05:48:42,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-11-24 05:48:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 536. [2019-11-24 05:48:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-24 05:48:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 715 transitions. [2019-11-24 05:48:42,219 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 715 transitions. Word has length 117 [2019-11-24 05:48:42,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:42,219 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 715 transitions. [2019-11-24 05:48:42,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 715 transitions. [2019-11-24 05:48:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-24 05:48:42,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:42,226 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] [2019-11-24 05:48:42,228 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:42,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:42,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1784320080, now seen corresponding path program 1 times [2019-11-24 05:48:42,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:42,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357816908] [2019-11-24 05:48:42,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:42,383 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-24 05:48:42,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357816908] [2019-11-24 05:48:42,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:42,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:42,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897524881] [2019-11-24 05:48:42,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:42,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:42,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:42,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:42,388 INFO L87 Difference]: Start difference. First operand 536 states and 715 transitions. Second operand 3 states. [2019-11-24 05:48:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:42,489 INFO L93 Difference]: Finished difference Result 1184 states and 1615 transitions. [2019-11-24 05:48:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:42,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-24 05:48:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:42,493 INFO L225 Difference]: With dead ends: 1184 [2019-11-24 05:48:42,494 INFO L226 Difference]: Without dead ends: 713 [2019-11-24 05:48:42,496 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-24 05:48:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-24 05:48:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 645. [2019-11-24 05:48:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-11-24 05:48:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 886 transitions. [2019-11-24 05:48:42,535 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 886 transitions. Word has length 119 [2019-11-24 05:48:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:42,536 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 886 transitions. [2019-11-24 05:48:42,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 886 transitions. [2019-11-24 05:48:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-24 05:48:42,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:42,540 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] [2019-11-24 05:48:42,540 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:42,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:42,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1758899639, now seen corresponding path program 1 times [2019-11-24 05:48:42,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:42,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775005936] [2019-11-24 05:48:42,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:42,619 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-24 05:48:42,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775005936] [2019-11-24 05:48:42,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:42,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:42,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030566787] [2019-11-24 05:48:42,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:42,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:42,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:42,623 INFO L87 Difference]: Start difference. First operand 645 states and 886 transitions. Second operand 3 states. [2019-11-24 05:48:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:42,721 INFO L93 Difference]: Finished difference Result 1548 states and 2189 transitions. [2019-11-24 05:48:42,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:42,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-24 05:48:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:42,727 INFO L225 Difference]: With dead ends: 1548 [2019-11-24 05:48:42,727 INFO L226 Difference]: Without dead ends: 944 [2019-11-24 05:48:42,728 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-24 05:48:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-11-24 05:48:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 849. [2019-11-24 05:48:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-11-24 05:48:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1213 transitions. [2019-11-24 05:48:42,802 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1213 transitions. Word has length 119 [2019-11-24 05:48:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:42,802 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1213 transitions. [2019-11-24 05:48:42,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:42,803 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1213 transitions. [2019-11-24 05:48:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-24 05:48:42,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:42,805 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] [2019-11-24 05:48:42,805 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:42,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:42,805 INFO L82 PathProgramCache]: Analyzing trace with hash 876595870, now seen corresponding path program 1 times [2019-11-24 05:48:42,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:42,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089303810] [2019-11-24 05:48:42,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:43,156 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-24 05:48:43,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089303810] [2019-11-24 05:48:43,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:43,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:43,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595492135] [2019-11-24 05:48:43,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:43,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:43,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:43,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:43,160 INFO L87 Difference]: Start difference. First operand 849 states and 1213 transitions. Second operand 5 states. [2019-11-24 05:48:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:43,306 INFO L93 Difference]: Finished difference Result 2339 states and 3359 transitions. [2019-11-24 05:48:43,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:43,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-11-24 05:48:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:43,316 INFO L225 Difference]: With dead ends: 2339 [2019-11-24 05:48:43,316 INFO L226 Difference]: Without dead ends: 1597 [2019-11-24 05:48:43,320 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-24 05:48:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2019-11-24 05:48:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1576. [2019-11-24 05:48:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-24 05:48:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2257 transitions. [2019-11-24 05:48:43,419 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2257 transitions. Word has length 122 [2019-11-24 05:48:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:43,422 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2257 transitions. [2019-11-24 05:48:43,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:43,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2257 transitions. [2019-11-24 05:48:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-24 05:48:43,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:43,428 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] [2019-11-24 05:48:43,428 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:43,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:43,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1706579556, now seen corresponding path program 1 times [2019-11-24 05:48:43,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:43,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400856319] [2019-11-24 05:48:43,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:43,611 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-24 05:48:43,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400856319] [2019-11-24 05:48:43,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:43,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:43,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366953072] [2019-11-24 05:48:43,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:43,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:43,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:43,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:43,613 INFO L87 Difference]: Start difference. First operand 1576 states and 2257 transitions. Second operand 3 states. [2019-11-24 05:48:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:43,787 INFO L93 Difference]: Finished difference Result 3832 states and 5614 transitions. [2019-11-24 05:48:43,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:43,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-24 05:48:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:43,801 INFO L225 Difference]: With dead ends: 3832 [2019-11-24 05:48:43,801 INFO L226 Difference]: Without dead ends: 2405 [2019-11-24 05:48:43,803 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-24 05:48:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2019-11-24 05:48:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2302. [2019-11-24 05:48:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2302 states. [2019-11-24 05:48:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3407 transitions. [2019-11-24 05:48:43,950 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3407 transitions. Word has length 124 [2019-11-24 05:48:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:43,950 INFO L462 AbstractCegarLoop]: Abstraction has 2302 states and 3407 transitions. [2019-11-24 05:48:43,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3407 transitions. [2019-11-24 05:48:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-24 05:48:43,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:43,954 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] [2019-11-24 05:48:43,955 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:43,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:43,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1026670157, now seen corresponding path program 1 times [2019-11-24 05:48:43,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:43,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382880144] [2019-11-24 05:48:43,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:44,094 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-24 05:48:44,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382880144] [2019-11-24 05:48:44,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:44,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:44,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072397697] [2019-11-24 05:48:44,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:44,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:44,097 INFO L87 Difference]: Start difference. First operand 2302 states and 3407 transitions. Second operand 5 states. [2019-11-24 05:48:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:44,443 INFO L93 Difference]: Finished difference Result 4463 states and 6630 transitions. [2019-11-24 05:48:44,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:44,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-11-24 05:48:44,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:44,456 INFO L225 Difference]: With dead ends: 4463 [2019-11-24 05:48:44,456 INFO L226 Difference]: Without dead ends: 2302 [2019-11-24 05:48:44,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-11-24 05:48:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2302. [2019-11-24 05:48:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2302 states. [2019-11-24 05:48:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3371 transitions. [2019-11-24 05:48:44,589 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3371 transitions. Word has length 127 [2019-11-24 05:48:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:44,590 INFO L462 AbstractCegarLoop]: Abstraction has 2302 states and 3371 transitions. [2019-11-24 05:48:44,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3371 transitions. [2019-11-24 05:48:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-24 05:48:44,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:44,593 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] [2019-11-24 05:48:44,593 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:44,598 INFO L82 PathProgramCache]: Analyzing trace with hash -432144722, now seen corresponding path program 1 times [2019-11-24 05:48:44,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:44,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205953304] [2019-11-24 05:48:44,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:44,931 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-24 05:48:44,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205953304] [2019-11-24 05:48:44,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:44,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:44,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179307168] [2019-11-24 05:48:44,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:44,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:44,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:44,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:44,936 INFO L87 Difference]: Start difference. First operand 2302 states and 3371 transitions. Second operand 5 states. [2019-11-24 05:48:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:45,165 INFO L93 Difference]: Finished difference Result 3346 states and 4884 transitions. [2019-11-24 05:48:45,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:45,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-11-24 05:48:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:45,176 INFO L225 Difference]: With dead ends: 3346 [2019-11-24 05:48:45,176 INFO L226 Difference]: Without dead ends: 2298 [2019-11-24 05:48:45,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2019-11-24 05:48:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2277. [2019-11-24 05:48:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2019-11-24 05:48:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3300 transitions. [2019-11-24 05:48:45,306 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3300 transitions. Word has length 127 [2019-11-24 05:48:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:45,306 INFO L462 AbstractCegarLoop]: Abstraction has 2277 states and 3300 transitions. [2019-11-24 05:48:45,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3300 transitions. [2019-11-24 05:48:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-24 05:48:45,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:45,308 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] [2019-11-24 05:48:45,309 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1284239336, now seen corresponding path program 1 times [2019-11-24 05:48:45,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:45,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095195466] [2019-11-24 05:48:45,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:45,597 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-24 05:48:45,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095195466] [2019-11-24 05:48:45,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:45,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:45,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647428570] [2019-11-24 05:48:45,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:45,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:45,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:45,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:45,600 INFO L87 Difference]: Start difference. First operand 2277 states and 3300 transitions. Second operand 5 states. [2019-11-24 05:48:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:45,963 INFO L93 Difference]: Finished difference Result 6141 states and 8907 transitions. [2019-11-24 05:48:45,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:45,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-11-24 05:48:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:45,980 INFO L225 Difference]: With dead ends: 6141 [2019-11-24 05:48:45,981 INFO L226 Difference]: Without dead ends: 3989 [2019-11-24 05:48:45,984 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-24 05:48:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2019-11-24 05:48:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3968. [2019-11-24 05:48:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3968 states. [2019-11-24 05:48:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5707 transitions. [2019-11-24 05:48:46,221 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5707 transitions. Word has length 127 [2019-11-24 05:48:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:46,221 INFO L462 AbstractCegarLoop]: Abstraction has 3968 states and 5707 transitions. [2019-11-24 05:48:46,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5707 transitions. [2019-11-24 05:48:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:48:46,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:46,225 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] [2019-11-24 05:48:46,225 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:46,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:46,226 INFO L82 PathProgramCache]: Analyzing trace with hash 102978460, now seen corresponding path program 1 times [2019-11-24 05:48:46,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:46,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392545564] [2019-11-24 05:48:46,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:46,805 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-11-24 05:48:47,514 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-24 05:48:47,662 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-11-24 05:48:47,826 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-11-24 05:48:47,966 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-11-24 05:48:48,112 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-11-24 05:48:48,315 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-11-24 05:48:48,482 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-11-24 05:48:48,763 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-11-24 05:48:48,910 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-11-24 05:48:49,091 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-11-24 05:48:50,487 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-24 05:48:50,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392545564] [2019-11-24 05:48:50,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:50,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-11-24 05:48:50,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279008500] [2019-11-24 05:48:50,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-24 05:48:50,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:50,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-24 05:48:50,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-11-24 05:48:50,490 INFO L87 Difference]: Start difference. First operand 3968 states and 5707 transitions. Second operand 32 states. [2019-11-24 05:48:50,823 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-24 05:48:50,997 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-24 05:48:51,328 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-24 05:48:51,807 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-11-24 05:48:52,165 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-11-24 05:48:52,506 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-11-24 05:48:53,012 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-11-24 05:48:53,465 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-11-24 05:48:53,851 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-11-24 05:48:54,357 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-11-24 05:48:55,136 WARN L192 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 100 [2019-11-24 05:48:55,913 WARN L192 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 106 [2019-11-24 05:48:56,565 WARN L192 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 98 [2019-11-24 05:48:57,379 WARN L192 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 103 [2019-11-24 05:48:58,063 WARN L192 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 108 [2019-11-24 05:48:58,905 WARN L192 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 114 [2019-11-24 05:48:59,766 WARN L192 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 119 [2019-11-24 05:49:00,260 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 103 [2019-11-24 05:49:00,629 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-11-24 05:49:00,858 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-24 05:49:04,782 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-11-24 05:49:05,381 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-24 05:49:06,529 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-11-24 05:49:07,096 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-11-24 05:49:07,950 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-11-24 05:49:08,520 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-11-24 05:49:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:13,276 INFO L93 Difference]: Finished difference Result 29170 states and 44450 transitions. [2019-11-24 05:49:13,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-24 05:49:13,277 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 132 [2019-11-24 05:49:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:13,381 INFO L225 Difference]: With dead ends: 29170 [2019-11-24 05:49:13,381 INFO L226 Difference]: Without dead ends: 28177 [2019-11-24 05:49:13,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=684, Invalid=3606, Unknown=0, NotChecked=0, Total=4290 [2019-11-24 05:49:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28177 states. [2019-11-24 05:49:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28177 to 5733. [2019-11-24 05:49:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5733 states. [2019-11-24 05:49:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5733 states to 5733 states and 8328 transitions. [2019-11-24 05:49:14,429 INFO L78 Accepts]: Start accepts. Automaton has 5733 states and 8328 transitions. Word has length 132 [2019-11-24 05:49:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:14,429 INFO L462 AbstractCegarLoop]: Abstraction has 5733 states and 8328 transitions. [2019-11-24 05:49:14,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-24 05:49:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5733 states and 8328 transitions. [2019-11-24 05:49:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:49:14,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:14,433 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] [2019-11-24 05:49:14,434 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash 103409436, now seen corresponding path program 1 times [2019-11-24 05:49:14,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:14,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928287690] [2019-11-24 05:49:14,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:15,821 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-11-24 05:49:16,080 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-24 05:49:16,245 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-11-24 05:49:16,533 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-11-24 05:49:16,702 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-24 05:49:16,856 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-24 05:49:17,043 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-11-24 05:49:17,199 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-24 05:49:17,369 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-24 05:49:17,736 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-11-24 05:49:17,962 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-11-24 05:49:18,161 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-11-24 05:49:18,353 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-11-24 05:49:18,522 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-11-24 05:49:18,771 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-11-24 05:49:19,155 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-24 05:49:19,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928287690] [2019-11-24 05:49:19,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:19,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-11-24 05:49:19,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343405740] [2019-11-24 05:49:19,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-24 05:49:19,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-24 05:49:19,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-11-24 05:49:19,165 INFO L87 Difference]: Start difference. First operand 5733 states and 8328 transitions. Second operand 31 states. [2019-11-24 05:49:19,502 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-11-24 05:49:19,812 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-24 05:49:20,201 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-11-24 05:49:20,689 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-11-24 05:49:21,192 WARN L192 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-11-24 05:49:21,640 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2019-11-24 05:49:22,324 WARN L192 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-11-24 05:49:22,883 WARN L192 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-11-24 05:49:23,529 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2019-11-24 05:49:24,278 WARN L192 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 106 [2019-11-24 05:49:24,934 WARN L192 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-11-24 05:49:25,557 WARN L192 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2019-11-24 05:49:26,504 WARN L192 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 112 [2019-11-24 05:49:27,464 WARN L192 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 117 [2019-11-24 05:49:28,154 WARN L192 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 110 [2019-11-24 05:49:29,002 WARN L192 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 116 [2019-11-24 05:49:29,862 WARN L192 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 120 [2019-11-24 05:49:30,493 WARN L192 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 104 [2019-11-24 05:49:34,035 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-11-24 05:49:35,918 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2019-11-24 05:49:36,743 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-11-24 05:49:39,569 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-11-24 05:49:40,301 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-11-24 05:49:41,637 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2019-11-24 05:49:43,189 WARN L192 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 111 [2019-11-24 05:49:44,491 WARN L192 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2019-11-24 05:49:47,061 WARN L192 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 122 [2019-11-24 05:49:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:50,618 INFO L93 Difference]: Finished difference Result 42593 states and 64110 transitions. [2019-11-24 05:49:50,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-24 05:49:50,619 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 132 [2019-11-24 05:49:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:50,710 INFO L225 Difference]: With dead ends: 42593 [2019-11-24 05:49:50,710 INFO L226 Difference]: Without dead ends: 39899 [2019-11-24 05:49:50,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=731, Invalid=2929, Unknown=0, NotChecked=0, Total=3660 [2019-11-24 05:49:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39899 states. [2019-11-24 05:49:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39899 to 5837. [2019-11-24 05:49:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-11-24 05:49:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 8438 transitions. [2019-11-24 05:49:52,029 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 8438 transitions. Word has length 132 [2019-11-24 05:49:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:52,030 INFO L462 AbstractCegarLoop]: Abstraction has 5837 states and 8438 transitions. [2019-11-24 05:49:52,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-24 05:49:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 8438 transitions. [2019-11-24 05:49:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:49:52,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:52,034 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] [2019-11-24 05:49:52,034 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:52,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash -291664022, now seen corresponding path program 1 times [2019-11-24 05:49:52,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:52,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024258276] [2019-11-24 05:49:52,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:52,150 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-24 05:49:52,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024258276] [2019-11-24 05:49:52,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:52,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:52,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053255443] [2019-11-24 05:49:52,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:52,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:52,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:52,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:52,152 INFO L87 Difference]: Start difference. First operand 5837 states and 8438 transitions. Second operand 3 states. [2019-11-24 05:49:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:54,228 INFO L93 Difference]: Finished difference Result 10620 states and 15443 transitions. [2019-11-24 05:49:54,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:54,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-24 05:49:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:54,246 INFO L225 Difference]: With dead ends: 10620 [2019-11-24 05:49:54,246 INFO L226 Difference]: Without dead ends: 7874 [2019-11-24 05:49:54,252 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-24 05:49:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7874 states. [2019-11-24 05:49:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7874 to 7853. [2019-11-24 05:49:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7853 states. [2019-11-24 05:49:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7853 states to 7853 states and 11257 transitions. [2019-11-24 05:49:55,587 INFO L78 Accepts]: Start accepts. Automaton has 7853 states and 11257 transitions. Word has length 132 [2019-11-24 05:49:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:55,587 INFO L462 AbstractCegarLoop]: Abstraction has 7853 states and 11257 transitions. [2019-11-24 05:49:55,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 7853 states and 11257 transitions. [2019-11-24 05:49:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:49:55,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:55,592 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] [2019-11-24 05:49:55,592 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:55,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2115201481, now seen corresponding path program 1 times [2019-11-24 05:49:55,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:55,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100247321] [2019-11-24 05:49:55,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:55,681 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-24 05:49:55,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100247321] [2019-11-24 05:49:55,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:55,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:55,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967232986] [2019-11-24 05:49:55,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:55,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:55,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:55,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:55,683 INFO L87 Difference]: Start difference. First operand 7853 states and 11257 transitions. Second operand 5 states. [2019-11-24 05:49:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:57,380 INFO L93 Difference]: Finished difference Result 15354 states and 22099 transitions. [2019-11-24 05:49:57,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:57,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-11-24 05:49:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:57,393 INFO L225 Difference]: With dead ends: 15354 [2019-11-24 05:49:57,394 INFO L226 Difference]: Without dead ends: 7853 [2019-11-24 05:49:57,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7853 states. [2019-11-24 05:49:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7853 to 7853. [2019-11-24 05:49:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7853 states. [2019-11-24 05:49:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7853 states to 7853 states and 11137 transitions. [2019-11-24 05:49:58,680 INFO L78 Accepts]: Start accepts. Automaton has 7853 states and 11137 transitions. Word has length 132 [2019-11-24 05:49:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:58,681 INFO L462 AbstractCegarLoop]: Abstraction has 7853 states and 11137 transitions. [2019-11-24 05:49:58,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7853 states and 11137 transitions. [2019-11-24 05:49:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:49:58,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:58,685 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] [2019-11-24 05:49:58,686 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:58,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:58,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1945204966, now seen corresponding path program 1 times [2019-11-24 05:49:58,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:58,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111221126] [2019-11-24 05:49:58,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:59,017 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-24 05:49:59,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111221126] [2019-11-24 05:49:59,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:59,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:59,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564260326] [2019-11-24 05:49:59,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:59,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:59,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:59,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:59,019 INFO L87 Difference]: Start difference. First operand 7853 states and 11137 transitions. Second operand 5 states. [2019-11-24 05:50:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:00,805 INFO L93 Difference]: Finished difference Result 12520 states and 17884 transitions. [2019-11-24 05:50:00,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:50:00,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-11-24 05:50:00,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:00,819 INFO L225 Difference]: With dead ends: 12520 [2019-11-24 05:50:00,819 INFO L226 Difference]: Without dead ends: 9737 [2019-11-24 05:50:00,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:50:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9737 states. [2019-11-24 05:50:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9737 to 9716. [2019-11-24 05:50:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9716 states. [2019-11-24 05:50:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9716 states to 9716 states and 13757 transitions. [2019-11-24 05:50:02,552 INFO L78 Accepts]: Start accepts. Automaton has 9716 states and 13757 transitions. Word has length 132 [2019-11-24 05:50:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:02,552 INFO L462 AbstractCegarLoop]: Abstraction has 9716 states and 13757 transitions. [2019-11-24 05:50:02,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:50:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 9716 states and 13757 transitions. [2019-11-24 05:50:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-24 05:50:02,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:02,557 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] [2019-11-24 05:50:02,557 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:02,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1776676937, now seen corresponding path program 1 times [2019-11-24 05:50:02,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:02,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091236437] [2019-11-24 05:50:02,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:02,644 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-24 05:50:02,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091236437] [2019-11-24 05:50:02,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:02,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:50:02,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893721058] [2019-11-24 05:50:02,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:50:02,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:02,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:50:02,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:50:02,646 INFO L87 Difference]: Start difference. First operand 9716 states and 13757 transitions. Second operand 5 states.