/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_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:47:51,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:47:51,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:47:51,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:47:51,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:47:51,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:47:51,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:47:51,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:47:51,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:47:51,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:47:51,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:47:51,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:47:51,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:47:51,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:47:51,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:47:51,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:47:51,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:47:51,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:47:51,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:47:51,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:47:52,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:47:52,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:47:52,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:47:52,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:47:52,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:47:52,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:47:52,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:47:52,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:47:52,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:47:52,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:47:52,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:47:52,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:47:52,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:47:52,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:47:52,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:47:52,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:47:52,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:47:52,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:47:52,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:47:52,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:47:52,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:47:52,022 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:47:52,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:47:52,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:47:52,059 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:47:52,060 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:47:52,061 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:47:52,061 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:47:52,061 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:47:52,061 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:47:52,061 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:47:52,061 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:47:52,062 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:47:52,062 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:47:52,062 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:47:52,062 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:47:52,062 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:47:52,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:47:52,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:47:52,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:47:52,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:47:52,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:47:52,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:47:52,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:47:52,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:47:52,065 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:47:52,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:47:52,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:47:52,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:47:52,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:47:52,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:47:52,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:47:52,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:47:52,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:47:52,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:47:52,067 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:47:52,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:47:52,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:47:52,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:47:52,067 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:47:52,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:47:52,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:47:52,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:47:52,399 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:47:52,400 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:47:52,400 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-24 05:47:52,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a541e7f0/c0cdc3e658a4427a956ab54460ded322/FLAGfe22b87cf [2019-11-24 05:47:53,139 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:47:53,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-24 05:47:53,171 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a541e7f0/c0cdc3e658a4427a956ab54460ded322/FLAGfe22b87cf [2019-11-24 05:47:53,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a541e7f0/c0cdc3e658a4427a956ab54460ded322 [2019-11-24 05:47:53,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:47:53,328 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:47:53,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:47:53,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:47:53,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:47:53,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:47:53" (1/1) ... [2019-11-24 05:47:53,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8a8882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:53, skipping insertion in model container [2019-11-24 05:47:53,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:47:53" (1/1) ... [2019-11-24 05:47:53,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:47:53,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:47:54,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:47:54,576 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:47:54,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:47:54,937 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:47:54,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:54 WrapperNode [2019-11-24 05:47:54,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:47:54,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:47:54,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:47:54,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:47:54,952 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:47:54" (1/1) ... [2019-11-24 05:47:55,022 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:47:54" (1/1) ... [2019-11-24 05:47:55,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:47:55,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:47:55,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:47:55,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:47:55,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:54" (1/1) ... [2019-11-24 05:47:55,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:54" (1/1) ... [2019-11-24 05:47:55,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:54" (1/1) ... [2019-11-24 05:47:55,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:54" (1/1) ... [2019-11-24 05:47:55,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:54" (1/1) ... [2019-11-24 05:47:55,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:54" (1/1) ... [2019-11-24 05:47:55,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:54" (1/1) ... [2019-11-24 05:47:55,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:47:55,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:47:55,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:47:55,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:47:55,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:47:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:47:55,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:47:59,809 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:47:59,810 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:47:59,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:47:59 BoogieIcfgContainer [2019-11-24 05:47:59,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:47:59,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:47:59,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:47:59,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:47:59,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:47:53" (1/3) ... [2019-11-24 05:47:59,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118a4668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:47:59, skipping insertion in model container [2019-11-24 05:47:59,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:54" (2/3) ... [2019-11-24 05:47:59,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118a4668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:47:59, skipping insertion in model container [2019-11-24 05:47:59,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:47:59" (3/3) ... [2019-11-24 05:47:59,821 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-24 05:47:59,836 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:47:59,847 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:47:59,865 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:47:59,910 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:47:59,911 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:47:59,911 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:47:59,911 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:47:59,911 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:47:59,912 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:47:59,912 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:47:59,912 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:47:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states. [2019-11-24 05:47:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:47:59,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:59,976 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] [2019-11-24 05:47:59,977 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:59,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:59,985 INFO L82 PathProgramCache]: Analyzing trace with hash 966667412, now seen corresponding path program 1 times [2019-11-24 05:48:00,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:00,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219797924] [2019-11-24 05:48:00,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:00,496 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:00,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219797924] [2019-11-24 05:48:00,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:00,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:00,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472629298] [2019-11-24 05:48:00,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:00,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:00,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:00,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:00,524 INFO L87 Difference]: Start difference. First operand 1176 states. Second operand 5 states. [2019-11-24 05:48:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:02,678 INFO L93 Difference]: Finished difference Result 2258 states and 3962 transitions. [2019-11-24 05:48:02,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:02,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-24 05:48:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:02,721 INFO L225 Difference]: With dead ends: 2258 [2019-11-24 05:48:02,721 INFO L226 Difference]: Without dead ends: 1414 [2019-11-24 05:48:02,735 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:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-11-24 05:48:02,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1408. [2019-11-24 05:48:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408 states. [2019-11-24 05:48:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1850 transitions. [2019-11-24 05:48:02,906 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1850 transitions. Word has length 50 [2019-11-24 05:48:02,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:02,906 INFO L462 AbstractCegarLoop]: Abstraction has 1408 states and 1850 transitions. [2019-11-24 05:48:02,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1850 transitions. [2019-11-24 05:48:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:48:02,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:02,910 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] [2019-11-24 05:48:02,911 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:02,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1129412729, now seen corresponding path program 1 times [2019-11-24 05:48:02,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:02,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945503979] [2019-11-24 05:48:02,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:03,055 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:03,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945503979] [2019-11-24 05:48:03,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:03,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:03,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7584299] [2019-11-24 05:48:03,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:03,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:03,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:03,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:03,059 INFO L87 Difference]: Start difference. First operand 1408 states and 1850 transitions. Second operand 5 states. [2019-11-24 05:48:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:04,483 INFO L93 Difference]: Finished difference Result 2822 states and 3735 transitions. [2019-11-24 05:48:04,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:04,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-24 05:48:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:04,492 INFO L225 Difference]: With dead ends: 2822 [2019-11-24 05:48:04,493 INFO L226 Difference]: Without dead ends: 1946 [2019-11-24 05:48:04,495 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:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2019-11-24 05:48:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1934. [2019-11-24 05:48:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2019-11-24 05:48:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2563 transitions. [2019-11-24 05:48:04,569 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2563 transitions. Word has length 51 [2019-11-24 05:48:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:04,570 INFO L462 AbstractCegarLoop]: Abstraction has 1934 states and 2563 transitions. [2019-11-24 05:48:04,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2563 transitions. [2019-11-24 05:48:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:48:04,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:04,577 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] [2019-11-24 05:48:04,577 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:04,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:04,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1240611768, now seen corresponding path program 1 times [2019-11-24 05:48:04,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:04,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278441504] [2019-11-24 05:48:04,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:04,705 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:04,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278441504] [2019-11-24 05:48:04,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:04,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:04,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426772106] [2019-11-24 05:48:04,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:04,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:04,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:04,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:04,708 INFO L87 Difference]: Start difference. First operand 1934 states and 2563 transitions. Second operand 5 states. [2019-11-24 05:48:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:05,899 INFO L93 Difference]: Finished difference Result 3907 states and 5217 transitions. [2019-11-24 05:48:05,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:05,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-24 05:48:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:05,913 INFO L225 Difference]: With dead ends: 3907 [2019-11-24 05:48:05,913 INFO L226 Difference]: Without dead ends: 2620 [2019-11-24 05:48:05,916 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:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2019-11-24 05:48:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2610. [2019-11-24 05:48:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2019-11-24 05:48:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3437 transitions. [2019-11-24 05:48:06,092 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3437 transitions. Word has length 51 [2019-11-24 05:48:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:06,092 INFO L462 AbstractCegarLoop]: Abstraction has 2610 states and 3437 transitions. [2019-11-24 05:48:06,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3437 transitions. [2019-11-24 05:48:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:48:06,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:06,097 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] [2019-11-24 05:48:06,097 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash -40243798, now seen corresponding path program 1 times [2019-11-24 05:48:06,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:06,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635003772] [2019-11-24 05:48:06,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:06,266 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:06,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635003772] [2019-11-24 05:48:06,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:06,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:48:06,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40751881] [2019-11-24 05:48:06,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:48:06,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:06,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:48:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:48:06,269 INFO L87 Difference]: Start difference. First operand 2610 states and 3437 transitions. Second operand 8 states. [2019-11-24 05:48:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:09,390 INFO L93 Difference]: Finished difference Result 4498 states and 6007 transitions. [2019-11-24 05:48:09,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:48:09,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-24 05:48:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:09,408 INFO L225 Difference]: With dead ends: 4498 [2019-11-24 05:48:09,408 INFO L226 Difference]: Without dead ends: 4125 [2019-11-24 05:48:09,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:48:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2019-11-24 05:48:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 2610. [2019-11-24 05:48:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2019-11-24 05:48:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3436 transitions. [2019-11-24 05:48:09,564 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3436 transitions. Word has length 52 [2019-11-24 05:48:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:09,565 INFO L462 AbstractCegarLoop]: Abstraction has 2610 states and 3436 transitions. [2019-11-24 05:48:09,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:48:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3436 transitions. [2019-11-24 05:48:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:48:09,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:09,568 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] [2019-11-24 05:48:09,569 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:09,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash -185533245, now seen corresponding path program 1 times [2019-11-24 05:48:09,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:09,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086305546] [2019-11-24 05:48:09,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:09,694 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:09,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086305546] [2019-11-24 05:48:09,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:09,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:48:09,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236162254] [2019-11-24 05:48:09,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:48:09,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:09,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:48:09,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:48:09,697 INFO L87 Difference]: Start difference. First operand 2610 states and 3436 transitions. Second operand 8 states. [2019-11-24 05:48:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:12,678 INFO L93 Difference]: Finished difference Result 3752 states and 4955 transitions. [2019-11-24 05:48:12,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:48:12,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-24 05:48:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:12,695 INFO L225 Difference]: With dead ends: 3752 [2019-11-24 05:48:12,695 INFO L226 Difference]: Without dead ends: 3747 [2019-11-24 05:48:12,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-11-24 05:48:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2019-11-24 05:48:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 2610. [2019-11-24 05:48:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2019-11-24 05:48:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3435 transitions. [2019-11-24 05:48:12,876 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3435 transitions. Word has length 52 [2019-11-24 05:48:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:12,879 INFO L462 AbstractCegarLoop]: Abstraction has 2610 states and 3435 transitions. [2019-11-24 05:48:12,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:48:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3435 transitions. [2019-11-24 05:48:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:48:12,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:12,885 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] [2019-11-24 05:48:12,885 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1651109861, now seen corresponding path program 1 times [2019-11-24 05:48:12,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:12,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889018274] [2019-11-24 05:48:12,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:13,025 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:13,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889018274] [2019-11-24 05:48:13,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:13,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:48:13,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138373866] [2019-11-24 05:48:13,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:48:13,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:13,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:48:13,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:13,028 INFO L87 Difference]: Start difference. First operand 2610 states and 3435 transitions. Second operand 7 states. [2019-11-24 05:48:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:15,068 INFO L93 Difference]: Finished difference Result 4092 states and 5490 transitions. [2019-11-24 05:48:15,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 05:48:15,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-24 05:48:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:15,084 INFO L225 Difference]: With dead ends: 4092 [2019-11-24 05:48:15,084 INFO L226 Difference]: Without dead ends: 3621 [2019-11-24 05:48:15,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:48:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2019-11-24 05:48:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 2610. [2019-11-24 05:48:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2019-11-24 05:48:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3434 transitions. [2019-11-24 05:48:15,299 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3434 transitions. Word has length 52 [2019-11-24 05:48:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:15,299 INFO L462 AbstractCegarLoop]: Abstraction has 2610 states and 3434 transitions. [2019-11-24 05:48:15,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:48:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3434 transitions. [2019-11-24 05:48:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 05:48:15,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:15,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] [2019-11-24 05:48:15,308 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1538413769, now seen corresponding path program 1 times [2019-11-24 05:48:15,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:15,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085828700] [2019-11-24 05:48:15,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:15,399 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:15,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085828700] [2019-11-24 05:48:15,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:15,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:15,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692634480] [2019-11-24 05:48:15,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:15,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:15,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:15,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:15,403 INFO L87 Difference]: Start difference. First operand 2610 states and 3434 transitions. Second operand 3 states. [2019-11-24 05:48:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:15,657 INFO L93 Difference]: Finished difference Result 3230 states and 4323 transitions. [2019-11-24 05:48:15,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:15,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 05:48:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:15,672 INFO L225 Difference]: With dead ends: 3230 [2019-11-24 05:48:15,672 INFO L226 Difference]: Without dead ends: 2545 [2019-11-24 05:48:15,676 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:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2019-11-24 05:48:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 2543. [2019-11-24 05:48:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2543 states. [2019-11-24 05:48:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3342 transitions. [2019-11-24 05:48:15,870 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3342 transitions. Word has length 53 [2019-11-24 05:48:15,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:15,870 INFO L462 AbstractCegarLoop]: Abstraction has 2543 states and 3342 transitions. [2019-11-24 05:48:15,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3342 transitions. [2019-11-24 05:48:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 05:48:15,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:15,874 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] [2019-11-24 05:48:15,874 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:15,875 INFO L82 PathProgramCache]: Analyzing trace with hash -651733059, now seen corresponding path program 1 times [2019-11-24 05:48:15,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:15,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861909256] [2019-11-24 05:48:15,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:15,955 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:15,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861909256] [2019-11-24 05:48:15,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:15,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:15,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708546123] [2019-11-24 05:48:15,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:15,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:15,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:15,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:15,958 INFO L87 Difference]: Start difference. First operand 2543 states and 3342 transitions. Second operand 3 states. [2019-11-24 05:48:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:16,189 INFO L93 Difference]: Finished difference Result 3576 states and 4836 transitions. [2019-11-24 05:48:16,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:16,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 05:48:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:16,202 INFO L225 Difference]: With dead ends: 3576 [2019-11-24 05:48:16,202 INFO L226 Difference]: Without dead ends: 2713 [2019-11-24 05:48:16,205 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:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2019-11-24 05:48:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2711. [2019-11-24 05:48:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2019-11-24 05:48:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3607 transitions. [2019-11-24 05:48:16,534 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3607 transitions. Word has length 53 [2019-11-24 05:48:16,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:16,536 INFO L462 AbstractCegarLoop]: Abstraction has 2711 states and 3607 transitions. [2019-11-24 05:48:16,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3607 transitions. [2019-11-24 05:48:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 05:48:16,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:16,539 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] [2019-11-24 05:48:16,540 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:16,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:16,540 INFO L82 PathProgramCache]: Analyzing trace with hash 408369717, now seen corresponding path program 1 times [2019-11-24 05:48:16,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:16,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104537579] [2019-11-24 05:48:16,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:16,590 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:16,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104537579] [2019-11-24 05:48:16,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:16,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:16,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037942132] [2019-11-24 05:48:16,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:16,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:16,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:16,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:16,593 INFO L87 Difference]: Start difference. First operand 2711 states and 3607 transitions. Second operand 3 states. [2019-11-24 05:48:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:17,043 INFO L93 Difference]: Finished difference Result 5492 states and 7466 transitions. [2019-11-24 05:48:17,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:17,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 05:48:17,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:17,080 INFO L225 Difference]: With dead ends: 5492 [2019-11-24 05:48:17,084 INFO L226 Difference]: Without dead ends: 3755 [2019-11-24 05:48:17,092 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:17,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2019-11-24 05:48:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3749. [2019-11-24 05:48:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3749 states. [2019-11-24 05:48:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3749 states to 3749 states and 4978 transitions. [2019-11-24 05:48:17,462 INFO L78 Accepts]: Start accepts. Automaton has 3749 states and 4978 transitions. Word has length 53 [2019-11-24 05:48:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:17,462 INFO L462 AbstractCegarLoop]: Abstraction has 3749 states and 4978 transitions. [2019-11-24 05:48:17,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3749 states and 4978 transitions. [2019-11-24 05:48:17,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:48:17,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:17,466 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] [2019-11-24 05:48:17,466 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:17,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash 888209781, now seen corresponding path program 1 times [2019-11-24 05:48:17,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:17,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387804506] [2019-11-24 05:48:17,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:17,520 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:17,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387804506] [2019-11-24 05:48:17,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:17,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:17,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919700426] [2019-11-24 05:48:17,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:17,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:17,522 INFO L87 Difference]: Start difference. First operand 3749 states and 4978 transitions. Second operand 3 states. [2019-11-24 05:48:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:18,119 INFO L93 Difference]: Finished difference Result 6645 states and 8916 transitions. [2019-11-24 05:48:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:18,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:48:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:18,129 INFO L225 Difference]: With dead ends: 6645 [2019-11-24 05:48:18,129 INFO L226 Difference]: Without dead ends: 3766 [2019-11-24 05:48:18,136 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:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2019-11-24 05:48:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3041. [2019-11-24 05:48:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3041 states. [2019-11-24 05:48:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4052 transitions. [2019-11-24 05:48:18,477 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4052 transitions. Word has length 54 [2019-11-24 05:48:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:18,477 INFO L462 AbstractCegarLoop]: Abstraction has 3041 states and 4052 transitions. [2019-11-24 05:48:18,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4052 transitions. [2019-11-24 05:48:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:48:18,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:18,480 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] [2019-11-24 05:48:18,480 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash -290391896, now seen corresponding path program 1 times [2019-11-24 05:48:18,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:18,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752066522] [2019-11-24 05:48:18,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:18,515 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:18,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752066522] [2019-11-24 05:48:18,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:18,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:18,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932683356] [2019-11-24 05:48:18,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:18,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:18,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:18,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:18,518 INFO L87 Difference]: Start difference. First operand 3041 states and 4052 transitions. Second operand 3 states. [2019-11-24 05:48:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:18,954 INFO L93 Difference]: Finished difference Result 5512 states and 7456 transitions. [2019-11-24 05:48:18,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:18,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:48:18,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:18,962 INFO L225 Difference]: With dead ends: 5512 [2019-11-24 05:48:18,962 INFO L226 Difference]: Without dead ends: 3109 [2019-11-24 05:48:18,966 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:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2019-11-24 05:48:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2537. [2019-11-24 05:48:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2537 states. [2019-11-24 05:48:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3384 transitions. [2019-11-24 05:48:19,199 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3384 transitions. Word has length 54 [2019-11-24 05:48:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:19,199 INFO L462 AbstractCegarLoop]: Abstraction has 2537 states and 3384 transitions. [2019-11-24 05:48:19,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3384 transitions. [2019-11-24 05:48:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:48:19,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:19,204 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] [2019-11-24 05:48:19,204 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:19,205 INFO L82 PathProgramCache]: Analyzing trace with hash -364061502, now seen corresponding path program 1 times [2019-11-24 05:48:19,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:19,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128454880] [2019-11-24 05:48:19,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:19,276 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:19,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128454880] [2019-11-24 05:48:19,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:19,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:19,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915267265] [2019-11-24 05:48:19,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:19,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:19,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:19,280 INFO L87 Difference]: Start difference. First operand 2537 states and 3384 transitions. Second operand 3 states. [2019-11-24 05:48:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:19,714 INFO L93 Difference]: Finished difference Result 4631 states and 6254 transitions. [2019-11-24 05:48:19,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:19,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:48:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:19,720 INFO L225 Difference]: With dead ends: 4631 [2019-11-24 05:48:19,721 INFO L226 Difference]: Without dead ends: 2401 [2019-11-24 05:48:19,725 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:19,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2019-11-24 05:48:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2111. [2019-11-24 05:48:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-11-24 05:48:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 2826 transitions. [2019-11-24 05:48:19,973 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 2826 transitions. Word has length 54 [2019-11-24 05:48:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:19,973 INFO L462 AbstractCegarLoop]: Abstraction has 2111 states and 2826 transitions. [2019-11-24 05:48:19,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2826 transitions. [2019-11-24 05:48:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:48:19,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:19,975 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] [2019-11-24 05:48:19,976 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:19,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1325150352, now seen corresponding path program 1 times [2019-11-24 05:48:19,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:19,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238927494] [2019-11-24 05:48:19,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:20,650 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:20,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238927494] [2019-11-24 05:48:20,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:20,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-24 05:48:20,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59369432] [2019-11-24 05:48:20,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-24 05:48:20,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:20,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-24 05:48:20,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-11-24 05:48:20,652 INFO L87 Difference]: Start difference. First operand 2111 states and 2826 transitions. Second operand 19 states. [2019-11-24 05:48:21,289 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-24 05:48:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:25,346 INFO L93 Difference]: Finished difference Result 4087 states and 5434 transitions. [2019-11-24 05:48:25,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-24 05:48:25,346 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-24 05:48:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:25,355 INFO L225 Difference]: With dead ends: 4087 [2019-11-24 05:48:25,355 INFO L226 Difference]: Without dead ends: 4083 [2019-11-24 05:48:25,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2019-11-24 05:48:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2019-11-24 05:48:25,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 2123. [2019-11-24 05:48:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2019-11-24 05:48:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2843 transitions. [2019-11-24 05:48:25,578 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2843 transitions. Word has length 55 [2019-11-24 05:48:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:25,579 INFO L462 AbstractCegarLoop]: Abstraction has 2123 states and 2843 transitions. [2019-11-24 05:48:25,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-24 05:48:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2843 transitions. [2019-11-24 05:48:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:48:25,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:25,580 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] [2019-11-24 05:48:25,581 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:25,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:25,581 INFO L82 PathProgramCache]: Analyzing trace with hash -548611186, now seen corresponding path program 1 times [2019-11-24 05:48:25,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:25,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162191901] [2019-11-24 05:48:25,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:26,067 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:26,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162191901] [2019-11-24 05:48:26,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:26,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-24 05:48:26,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068829892] [2019-11-24 05:48:26,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-24 05:48:26,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:26,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-24 05:48:26,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-11-24 05:48:26,069 INFO L87 Difference]: Start difference. First operand 2123 states and 2843 transitions. Second operand 19 states. [2019-11-24 05:48:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:30,571 INFO L93 Difference]: Finished difference Result 4094 states and 5443 transitions. [2019-11-24 05:48:30,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-24 05:48:30,572 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-24 05:48:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:30,579 INFO L225 Difference]: With dead ends: 4094 [2019-11-24 05:48:30,579 INFO L226 Difference]: Without dead ends: 4090 [2019-11-24 05:48:30,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2019-11-24 05:48:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2019-11-24 05:48:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 2130. [2019-11-24 05:48:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-11-24 05:48:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2852 transitions. [2019-11-24 05:48:30,829 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2852 transitions. Word has length 55 [2019-11-24 05:48:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:30,829 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 2852 transitions. [2019-11-24 05:48:30,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-24 05:48:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2852 transitions. [2019-11-24 05:48:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:48:30,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:30,831 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] [2019-11-24 05:48:30,831 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:30,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:30,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1104256696, now seen corresponding path program 1 times [2019-11-24 05:48:30,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:30,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186510267] [2019-11-24 05:48:30,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:31,231 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:31,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186510267] [2019-11-24 05:48:31,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:31,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-24 05:48:31,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309273808] [2019-11-24 05:48:31,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-24 05:48:31,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:31,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-24 05:48:31,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-11-24 05:48:31,233 INFO L87 Difference]: Start difference. First operand 2130 states and 2852 transitions. Second operand 19 states. [2019-11-24 05:48:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:35,560 INFO L93 Difference]: Finished difference Result 3854 states and 5131 transitions. [2019-11-24 05:48:35,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-24 05:48:35,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-24 05:48:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:35,568 INFO L225 Difference]: With dead ends: 3854 [2019-11-24 05:48:35,568 INFO L226 Difference]: Without dead ends: 3848 [2019-11-24 05:48:35,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2019-11-24 05:48:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2019-11-24 05:48:35,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 2130. [2019-11-24 05:48:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-11-24 05:48:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2851 transitions. [2019-11-24 05:48:35,900 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2851 transitions. Word has length 55 [2019-11-24 05:48:35,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:35,901 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 2851 transitions. [2019-11-24 05:48:35,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-24 05:48:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2851 transitions. [2019-11-24 05:48:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:48:35,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:35,906 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] [2019-11-24 05:48:35,906 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:35,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:35,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1059586101, now seen corresponding path program 1 times [2019-11-24 05:48:35,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:35,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672375745] [2019-11-24 05:48:35,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:36,282 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:36,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672375745] [2019-11-24 05:48:36,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:36,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:48:36,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823681400] [2019-11-24 05:48:36,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:48:36,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:36,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:48:36,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:48:36,286 INFO L87 Difference]: Start difference. First operand 2130 states and 2851 transitions. Second operand 11 states. [2019-11-24 05:48:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:38,242 INFO L93 Difference]: Finished difference Result 4292 states and 5709 transitions. [2019-11-24 05:48:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-24 05:48:38,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-11-24 05:48:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:38,251 INFO L225 Difference]: With dead ends: 4292 [2019-11-24 05:48:38,251 INFO L226 Difference]: Without dead ends: 4035 [2019-11-24 05:48:38,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2019-11-24 05:48:38,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4035 states. [2019-11-24 05:48:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4035 to 2083. [2019-11-24 05:48:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2019-11-24 05:48:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2795 transitions. [2019-11-24 05:48:38,624 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2795 transitions. Word has length 55 [2019-11-24 05:48:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:38,625 INFO L462 AbstractCegarLoop]: Abstraction has 2083 states and 2795 transitions. [2019-11-24 05:48:38,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:48:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2795 transitions. [2019-11-24 05:48:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:48:38,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:38,627 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] [2019-11-24 05:48:38,627 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:38,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2003453, now seen corresponding path program 1 times [2019-11-24 05:48:38,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:38,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808802666] [2019-11-24 05:48:38,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:39,316 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:39,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808802666] [2019-11-24 05:48:39,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:39,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-24 05:48:39,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048288801] [2019-11-24 05:48:39,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-24 05:48:39,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:39,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-24 05:48:39,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-24 05:48:39,318 INFO L87 Difference]: Start difference. First operand 2083 states and 2795 transitions. Second operand 14 states. [2019-11-24 05:48:39,845 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-11-24 05:48:40,042 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-11-24 05:48:40,243 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-11-24 05:48:40,401 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-11-24 05:48:41,468 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-11-24 05:48:41,935 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-11-24 05:48:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:42,865 INFO L93 Difference]: Finished difference Result 4174 states and 5547 transitions. [2019-11-24 05:48:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-24 05:48:42,866 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-11-24 05:48:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:42,873 INFO L225 Difference]: With dead ends: 4174 [2019-11-24 05:48:42,873 INFO L226 Difference]: Without dead ends: 3943 [2019-11-24 05:48:42,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2019-11-24 05:48:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2019-11-24 05:48:43,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 2074. [2019-11-24 05:48:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-11-24 05:48:43,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2783 transitions. [2019-11-24 05:48:43,189 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2783 transitions. Word has length 56 [2019-11-24 05:48:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:43,189 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 2783 transitions. [2019-11-24 05:48:43,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-24 05:48:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2783 transitions. [2019-11-24 05:48:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-24 05:48:43,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:43,191 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] [2019-11-24 05:48:43,192 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:43,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1999707159, now seen corresponding path program 1 times [2019-11-24 05:48:43,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:43,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117608958] [2019-11-24 05:48:43,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:43,400 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,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117608958] [2019-11-24 05:48:43,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:43,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-24 05:48:43,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403086763] [2019-11-24 05:48:43,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-24 05:48:43,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:43,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-24 05:48:43,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:48:43,402 INFO L87 Difference]: Start difference. First operand 2074 states and 2783 transitions. Second operand 13 states. [2019-11-24 05:48:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:46,632 INFO L93 Difference]: Finished difference Result 8870 states and 12124 transitions. [2019-11-24 05:48:46,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-24 05:48:46,633 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2019-11-24 05:48:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:46,642 INFO L225 Difference]: With dead ends: 8870 [2019-11-24 05:48:46,643 INFO L226 Difference]: Without dead ends: 7291 [2019-11-24 05:48:46,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2019-11-24 05:48:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7291 states. [2019-11-24 05:48:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7291 to 3580. [2019-11-24 05:48:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3580 states. [2019-11-24 05:48:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 4775 transitions. [2019-11-24 05:48:47,269 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 4775 transitions. Word has length 58 [2019-11-24 05:48:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:47,270 INFO L462 AbstractCegarLoop]: Abstraction has 3580 states and 4775 transitions. [2019-11-24 05:48:47,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-24 05:48:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 4775 transitions. [2019-11-24 05:48:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-24 05:48:47,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:47,271 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] [2019-11-24 05:48:47,272 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:47,272 INFO L82 PathProgramCache]: Analyzing trace with hash 433632566, now seen corresponding path program 1 times [2019-11-24 05:48:47,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:47,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392553094] [2019-11-24 05:48:47,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:47,550 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:47,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392553094] [2019-11-24 05:48:47,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:47,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-24 05:48:47,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134223801] [2019-11-24 05:48:47,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-24 05:48:47,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:47,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-24 05:48:47,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-24 05:48:47,555 INFO L87 Difference]: Start difference. First operand 3580 states and 4775 transitions. Second operand 15 states. [2019-11-24 05:48:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:52,779 INFO L93 Difference]: Finished difference Result 8295 states and 11103 transitions. [2019-11-24 05:48:52,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-24 05:48:52,780 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-11-24 05:48:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:52,787 INFO L225 Difference]: With dead ends: 8295 [2019-11-24 05:48:52,787 INFO L226 Difference]: Without dead ends: 7493 [2019-11-24 05:48:52,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=375, Invalid=1031, Unknown=0, NotChecked=0, Total=1406 [2019-11-24 05:48:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7493 states. [2019-11-24 05:48:53,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7493 to 4506. [2019-11-24 05:48:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2019-11-24 05:48:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 5998 transitions. [2019-11-24 05:48:53,527 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 5998 transitions. Word has length 60 [2019-11-24 05:48:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:53,527 INFO L462 AbstractCegarLoop]: Abstraction has 4506 states and 5998 transitions. [2019-11-24 05:48:53,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-24 05:48:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 5998 transitions. [2019-11-24 05:48:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 05:48:53,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:53,529 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] [2019-11-24 05:48:53,529 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash -110162204, now seen corresponding path program 1 times [2019-11-24 05:48:53,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:53,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061496687] [2019-11-24 05:48:53,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:53,631 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:53,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061496687] [2019-11-24 05:48:53,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:53,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:48:53,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532993948] [2019-11-24 05:48:53,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:48:53,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:53,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:48:53,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:48:53,634 INFO L87 Difference]: Start difference. First operand 4506 states and 5998 transitions. Second operand 8 states. [2019-11-24 05:48:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:56,197 INFO L93 Difference]: Finished difference Result 7255 states and 9507 transitions. [2019-11-24 05:48:56,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-24 05:48:56,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-11-24 05:48:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:56,203 INFO L225 Difference]: With dead ends: 7255 [2019-11-24 05:48:56,203 INFO L226 Difference]: Without dead ends: 6827 [2019-11-24 05:48:56,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2019-11-24 05:48:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6827 states. [2019-11-24 05:48:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6827 to 4506. [2019-11-24 05:48:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2019-11-24 05:48:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 5996 transitions. [2019-11-24 05:48:56,949 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 5996 transitions. Word has length 62 [2019-11-24 05:48:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:56,949 INFO L462 AbstractCegarLoop]: Abstraction has 4506 states and 5996 transitions. [2019-11-24 05:48:56,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:48:56,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 5996 transitions. [2019-11-24 05:48:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 05:48:56,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:56,951 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] [2019-11-24 05:48:56,951 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:56,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:56,952 INFO L82 PathProgramCache]: Analyzing trace with hash 939460217, now seen corresponding path program 1 times [2019-11-24 05:48:56,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:56,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666013677] [2019-11-24 05:48:56,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:57,015 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:57,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666013677] [2019-11-24 05:48:57,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:57,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:57,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615309580] [2019-11-24 05:48:57,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:57,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:57,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:57,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:57,018 INFO L87 Difference]: Start difference. First operand 4506 states and 5996 transitions. Second operand 3 states. [2019-11-24 05:48:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:58,622 INFO L93 Difference]: Finished difference Result 9835 states and 13269 transitions. [2019-11-24 05:48:58,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:58,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-24 05:48:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:58,631 INFO L225 Difference]: With dead ends: 9835 [2019-11-24 05:48:58,631 INFO L226 Difference]: Without dead ends: 6360 [2019-11-24 05:48:58,634 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:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6360 states. [2019-11-24 05:48:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 5627. [2019-11-24 05:48:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5627 states. [2019-11-24 05:48:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5627 states to 5627 states and 7437 transitions. [2019-11-24 05:48:59,514 INFO L78 Accepts]: Start accepts. Automaton has 5627 states and 7437 transitions. Word has length 62 [2019-11-24 05:48:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:59,514 INFO L462 AbstractCegarLoop]: Abstraction has 5627 states and 7437 transitions. [2019-11-24 05:48:59,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5627 states and 7437 transitions. [2019-11-24 05:48:59,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 05:48:59,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:59,517 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] [2019-11-24 05:48:59,517 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:59,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:59,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1406332728, now seen corresponding path program 1 times [2019-11-24 05:48:59,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:59,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247804833] [2019-11-24 05:48:59,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:59,793 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:59,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247804833] [2019-11-24 05:48:59,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:59,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-24 05:48:59,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199081151] [2019-11-24 05:48:59,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-24 05:48:59,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:59,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-24 05:48:59,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-11-24 05:48:59,794 INFO L87 Difference]: Start difference. First operand 5627 states and 7437 transitions. Second operand 15 states. [2019-11-24 05:49:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:04,739 INFO L93 Difference]: Finished difference Result 9326 states and 12372 transitions. [2019-11-24 05:49:04,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-24 05:49:04,739 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-11-24 05:49:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:04,748 INFO L225 Difference]: With dead ends: 9326 [2019-11-24 05:49:04,748 INFO L226 Difference]: Without dead ends: 9324 [2019-11-24 05:49:04,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-11-24 05:49:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9324 states. [2019-11-24 05:49:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9324 to 5852. [2019-11-24 05:49:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5852 states. [2019-11-24 05:49:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 7725 transitions. [2019-11-24 05:49:05,851 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 7725 transitions. Word has length 66 [2019-11-24 05:49:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:05,851 INFO L462 AbstractCegarLoop]: Abstraction has 5852 states and 7725 transitions. [2019-11-24 05:49:05,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-24 05:49:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 7725 transitions. [2019-11-24 05:49:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 05:49:05,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:05,853 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] [2019-11-24 05:49:05,854 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:05,854 INFO L82 PathProgramCache]: Analyzing trace with hash -942777167, now seen corresponding path program 1 times [2019-11-24 05:49:05,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:05,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353953104] [2019-11-24 05:49:05,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:05,898 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:05,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353953104] [2019-11-24 05:49:05,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:05,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:05,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651373284] [2019-11-24 05:49:05,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:05,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:05,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:05,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:05,900 INFO L87 Difference]: Start difference. First operand 5852 states and 7725 transitions. Second operand 3 states. [2019-11-24 05:49:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:07,069 INFO L93 Difference]: Finished difference Result 9192 states and 12407 transitions. [2019-11-24 05:49:07,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:07,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-24 05:49:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:07,077 INFO L225 Difference]: With dead ends: 9192 [2019-11-24 05:49:07,077 INFO L226 Difference]: Without dead ends: 7002 [2019-11-24 05:49:07,082 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:07,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7002 states. [2019-11-24 05:49:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7002 to 6664. [2019-11-24 05:49:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6664 states. [2019-11-24 05:49:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6664 states to 6664 states and 8821 transitions. [2019-11-24 05:49:08,257 INFO L78 Accepts]: Start accepts. Automaton has 6664 states and 8821 transitions. Word has length 67 [2019-11-24 05:49:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:08,257 INFO L462 AbstractCegarLoop]: Abstraction has 6664 states and 8821 transitions. [2019-11-24 05:49:08,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 6664 states and 8821 transitions. [2019-11-24 05:49:08,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 05:49:08,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:08,260 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] [2019-11-24 05:49:08,260 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:08,260 INFO L82 PathProgramCache]: Analyzing trace with hash -340439048, now seen corresponding path program 1 times [2019-11-24 05:49:08,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:08,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168084340] [2019-11-24 05:49:08,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:08,359 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:08,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168084340] [2019-11-24 05:49:08,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:08,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:49:08,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838679007] [2019-11-24 05:49:08,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:49:08,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:08,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:49:08,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:49:08,362 INFO L87 Difference]: Start difference. First operand 6664 states and 8821 transitions. Second operand 8 states. [2019-11-24 05:49:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:11,224 INFO L93 Difference]: Finished difference Result 9711 states and 12741 transitions. [2019-11-24 05:49:11,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:49:11,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-11-24 05:49:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:11,231 INFO L225 Difference]: With dead ends: 9711 [2019-11-24 05:49:11,232 INFO L226 Difference]: Without dead ends: 8905 [2019-11-24 05:49:11,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:49:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8905 states. [2019-11-24 05:49:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8905 to 6639. [2019-11-24 05:49:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6639 states. [2019-11-24 05:49:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6639 states to 6639 states and 8791 transitions. [2019-11-24 05:49:12,414 INFO L78 Accepts]: Start accepts. Automaton has 6639 states and 8791 transitions. Word has length 68 [2019-11-24 05:49:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:12,414 INFO L462 AbstractCegarLoop]: Abstraction has 6639 states and 8791 transitions. [2019-11-24 05:49:12,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:49:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6639 states and 8791 transitions. [2019-11-24 05:49:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 05:49:12,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:12,416 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] [2019-11-24 05:49:12,416 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:12,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1101627880, now seen corresponding path program 1 times [2019-11-24 05:49:12,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:12,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986588382] [2019-11-24 05:49:12,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:12,532 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:12,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986588382] [2019-11-24 05:49:12,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:12,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 05:49:12,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344887919] [2019-11-24 05:49:12,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 05:49:12,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:12,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 05:49:12,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-24 05:49:12,535 INFO L87 Difference]: Start difference. First operand 6639 states and 8791 transitions. Second operand 9 states.