/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.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:47:45,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:47:45,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:47:45,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:47:45,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:47:45,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:47:45,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:47:45,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:47:45,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:47:45,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:47:45,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:47:45,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:47:45,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:47:45,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:47:45,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:47:45,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:47:45,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:47:45,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:47:45,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:47:45,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:47:45,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:47:45,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:47:45,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:47:45,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:47:45,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:47:45,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:47:45,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:47:45,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:47:45,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:47:45,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:47:45,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:47:45,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:47:45,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:47:45,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:47:45,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:47:45,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:47:45,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:47:45,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:47:45,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:47:45,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:47:45,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:47:45,881 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:45,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:47:45,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:47:45,899 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:47:45,899 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:47:45,899 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:47:45,899 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:47:45,899 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:47:45,900 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:47:45,900 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:47:45,900 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:47:45,900 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:47:45,900 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:47:45,900 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:47:45,901 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:47:45,901 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:47:45,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:47:45,902 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:47:45,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:47:45,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:47:45,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:47:45,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:47:45,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:47:45,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:47:45,904 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:47:45,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:47:45,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:47:45,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:47:45,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:47:45,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:47:45,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:47:45,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:47:45,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:47:45,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:47:45,907 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:47:45,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:47:45,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:47:45,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:47:45,908 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:47:46,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:47:46,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:47:46,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:47:46,236 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:47:46,236 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:47:46,237 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.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-24 05:47:46,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29350a2f/146718a4490b49de80158b49415a843b/FLAG60ecbf55c [2019-11-24 05:47:47,012 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:47:47,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-24 05:47:47,047 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29350a2f/146718a4490b49de80158b49415a843b/FLAG60ecbf55c [2019-11-24 05:47:47,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29350a2f/146718a4490b49de80158b49415a843b [2019-11-24 05:47:47,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:47:47,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:47:47,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:47:47,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:47:47,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:47:47,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:47:47" (1/1) ... [2019-11-24 05:47:47,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417e28a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:47, skipping insertion in model container [2019-11-24 05:47:47,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:47:47" (1/1) ... [2019-11-24 05:47:47,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:47:47,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:47:48,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:47:48,464 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:47:48,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:47:48,843 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:47:48,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:48 WrapperNode [2019-11-24 05:47:48,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:47:48,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:47:48,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:47:48,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:47:48,859 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:48" (1/1) ... [2019-11-24 05:47:48,931 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:48" (1/1) ... [2019-11-24 05:47:49,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:47:49,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:47:49,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:47:49,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:47:49,076 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:48" (1/1) ... [2019-11-24 05:47:49,076 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:48" (1/1) ... [2019-11-24 05:47:49,098 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:48" (1/1) ... [2019-11-24 05:47:49,098 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:48" (1/1) ... [2019-11-24 05:47:49,167 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:48" (1/1) ... [2019-11-24 05:47:49,205 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:48" (1/1) ... [2019-11-24 05:47:49,225 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:48" (1/1) ... [2019-11-24 05:47:49,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:47:49,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:47:49,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:47:49,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:47:49,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:48" (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:49,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:47:49,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:47:53,535 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:47:53,535 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:47:53,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:47:53 BoogieIcfgContainer [2019-11-24 05:47:53,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:47:53,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:47:53,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:47:53,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:47:53,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:47:47" (1/3) ... [2019-11-24 05:47:53,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4577f6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:47:53, skipping insertion in model container [2019-11-24 05:47:53,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:48" (2/3) ... [2019-11-24 05:47:53,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4577f6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:47:53, skipping insertion in model container [2019-11-24 05:47:53,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:47:53" (3/3) ... [2019-11-24 05:47:53,546 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-24 05:47:53,555 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:47:53,565 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:47:53,576 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:47:53,625 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:47:53,625 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:47:53,625 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:47:53,625 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:47:53,625 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:47:53,625 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:47:53,625 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:47:53,626 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:47:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states. [2019-11-24 05:47:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:53,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:53,696 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:47:53,696 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:53,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:53,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2092473724, now seen corresponding path program 1 times [2019-11-24 05:47:53,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:53,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256057378] [2019-11-24 05:47:53,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:54,159 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:47:54,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256057378] [2019-11-24 05:47:54,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:54,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:47:54,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555381474] [2019-11-24 05:47:54,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:47:54,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:47:54,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:54,185 INFO L87 Difference]: Start difference. First operand 1234 states. Second operand 5 states. [2019-11-24 05:47:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:56,085 INFO L93 Difference]: Finished difference Result 2365 states and 4064 transitions. [2019-11-24 05:47:56,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:47:56,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-24 05:47:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:56,189 INFO L225 Difference]: With dead ends: 2365 [2019-11-24 05:47:56,189 INFO L226 Difference]: Without dead ends: 1494 [2019-11-24 05:47:56,202 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:47:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-11-24 05:47:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1488. [2019-11-24 05:47:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-11-24 05:47:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1896 transitions. [2019-11-24 05:47:56,360 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1896 transitions. Word has length 51 [2019-11-24 05:47:56,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:56,361 INFO L462 AbstractCegarLoop]: Abstraction has 1488 states and 1896 transitions. [2019-11-24 05:47:56,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:47:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1896 transitions. [2019-11-24 05:47:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:47:56,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:56,365 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:47:56,365 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:47:56,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:56,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1158227955, now seen corresponding path program 1 times [2019-11-24 05:47:56,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:56,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562781598] [2019-11-24 05:47:56,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:56,479 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:47:56,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562781598] [2019-11-24 05:47:56,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:56,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:47:56,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730107914] [2019-11-24 05:47:56,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:47:56,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:47:56,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:56,484 INFO L87 Difference]: Start difference. First operand 1488 states and 1896 transitions. Second operand 5 states. [2019-11-24 05:47:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:57,717 INFO L93 Difference]: Finished difference Result 2955 states and 3772 transitions. [2019-11-24 05:47:57,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:47:57,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-24 05:47:57,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:57,730 INFO L225 Difference]: With dead ends: 2955 [2019-11-24 05:47:57,730 INFO L226 Difference]: Without dead ends: 2037 [2019-11-24 05:47:57,734 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:47:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2019-11-24 05:47:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 2023. [2019-11-24 05:47:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-11-24 05:47:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2584 transitions. [2019-11-24 05:47:57,858 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2584 transitions. Word has length 52 [2019-11-24 05:47:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:57,859 INFO L462 AbstractCegarLoop]: Abstraction has 2023 states and 2584 transitions. [2019-11-24 05:47:57,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:47:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2584 transitions. [2019-11-24 05:47:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:47:57,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:57,862 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:47:57,863 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:47:57,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:57,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1808254749, now seen corresponding path program 1 times [2019-11-24 05:47:57,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:57,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431717589] [2019-11-24 05:47:57,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:58,024 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:47:58,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431717589] [2019-11-24 05:47:58,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:58,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:47:58,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55976818] [2019-11-24 05:47:58,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:47:58,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:58,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:47:58,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:58,026 INFO L87 Difference]: Start difference. First operand 2023 states and 2584 transitions. Second operand 5 states. [2019-11-24 05:47:59,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:59,074 INFO L93 Difference]: Finished difference Result 4066 states and 5224 transitions. [2019-11-24 05:47:59,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:47:59,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-24 05:47:59,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:59,089 INFO L225 Difference]: With dead ends: 4066 [2019-11-24 05:47:59,089 INFO L226 Difference]: Without dead ends: 2767 [2019-11-24 05:47:59,093 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:47:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2767 states. [2019-11-24 05:47:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2767 to 2757. [2019-11-24 05:47:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2019-11-24 05:47:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 3508 transitions. [2019-11-24 05:47:59,225 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 3508 transitions. Word has length 52 [2019-11-24 05:47:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:59,226 INFO L462 AbstractCegarLoop]: Abstraction has 2757 states and 3508 transitions. [2019-11-24 05:47:59,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:47:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3508 transitions. [2019-11-24 05:47:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:47:59,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:59,229 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:47:59,230 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:47:59,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 77244356, now seen corresponding path program 1 times [2019-11-24 05:47:59,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:59,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172659906] [2019-11-24 05:47:59,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:59,420 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:47:59,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172659906] [2019-11-24 05:47:59,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:59,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:47:59,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858680786] [2019-11-24 05:47:59,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:47:59,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:59,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:47:59,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:47:59,422 INFO L87 Difference]: Start difference. First operand 2757 states and 3508 transitions. Second operand 7 states. [2019-11-24 05:48:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:01,303 INFO L93 Difference]: Finished difference Result 4380 states and 5696 transitions. [2019-11-24 05:48:01,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 05:48:01,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-24 05:48:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:01,323 INFO L225 Difference]: With dead ends: 4380 [2019-11-24 05:48:01,323 INFO L226 Difference]: Without dead ends: 3852 [2019-11-24 05:48:01,326 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:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states. [2019-11-24 05:48:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 2757. [2019-11-24 05:48:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2019-11-24 05:48:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 3507 transitions. [2019-11-24 05:48:01,471 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 3507 transitions. Word has length 54 [2019-11-24 05:48:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:01,472 INFO L462 AbstractCegarLoop]: Abstraction has 2757 states and 3507 transitions. [2019-11-24 05:48:01,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:48:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3507 transitions. [2019-11-24 05:48:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:48:01,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:01,475 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:01,475 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:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:01,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1063699171, now seen corresponding path program 1 times [2019-11-24 05:48:01,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:01,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217955368] [2019-11-24 05:48:01,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:01,604 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:01,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217955368] [2019-11-24 05:48:01,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:01,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:48:01,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75860368] [2019-11-24 05:48:01,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:48:01,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:01,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:48:01,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:48:01,606 INFO L87 Difference]: Start difference. First operand 2757 states and 3507 transitions. Second operand 8 states. [2019-11-24 05:48:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:05,130 INFO L93 Difference]: Finished difference Result 5136 states and 6662 transitions. [2019-11-24 05:48:05,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:48:05,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-11-24 05:48:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:05,158 INFO L225 Difference]: With dead ends: 5136 [2019-11-24 05:48:05,158 INFO L226 Difference]: Without dead ends: 4730 [2019-11-24 05:48:05,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-11-24 05:48:05,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2019-11-24 05:48:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 2757. [2019-11-24 05:48:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2019-11-24 05:48:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 3506 transitions. [2019-11-24 05:48:05,411 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 3506 transitions. Word has length 54 [2019-11-24 05:48:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:05,411 INFO L462 AbstractCegarLoop]: Abstraction has 2757 states and 3506 transitions. [2019-11-24 05:48:05,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:48:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3506 transitions. [2019-11-24 05:48:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:48:05,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:05,417 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:05,417 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:05,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1340474756, now seen corresponding path program 1 times [2019-11-24 05:48:05,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:05,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419486287] [2019-11-24 05:48:05,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:05,621 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:05,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419486287] [2019-11-24 05:48:05,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:05,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:48:05,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531001466] [2019-11-24 05:48:05,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:48:05,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:05,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:48:05,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:48:05,625 INFO L87 Difference]: Start difference. First operand 2757 states and 3506 transitions. Second operand 8 states. [2019-11-24 05:48:08,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:08,109 INFO L93 Difference]: Finished difference Result 3968 states and 5094 transitions. [2019-11-24 05:48:08,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:48:08,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-11-24 05:48:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:08,126 INFO L225 Difference]: With dead ends: 3968 [2019-11-24 05:48:08,126 INFO L226 Difference]: Without dead ends: 3962 [2019-11-24 05:48:08,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-11-24 05:48:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2019-11-24 05:48:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 2757. [2019-11-24 05:48:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2019-11-24 05:48:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 3505 transitions. [2019-11-24 05:48:08,291 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 3505 transitions. Word has length 54 [2019-11-24 05:48:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:08,291 INFO L462 AbstractCegarLoop]: Abstraction has 2757 states and 3505 transitions. [2019-11-24 05:48:08,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:48:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3505 transitions. [2019-11-24 05:48:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:48:08,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:08,297 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:08,297 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:08,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:08,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1906140159, now seen corresponding path program 1 times [2019-11-24 05:48:08,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:08,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114592377] [2019-11-24 05:48:08,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:08,377 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:08,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114592377] [2019-11-24 05:48:08,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:08,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:08,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980616013] [2019-11-24 05:48:08,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:08,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:08,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:08,380 INFO L87 Difference]: Start difference. First operand 2757 states and 3505 transitions. Second operand 3 states. [2019-11-24 05:48:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:08,586 INFO L93 Difference]: Finished difference Result 3421 states and 4438 transitions. [2019-11-24 05:48:08,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:08,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-24 05:48:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:08,600 INFO L225 Difference]: With dead ends: 3421 [2019-11-24 05:48:08,600 INFO L226 Difference]: Without dead ends: 2678 [2019-11-24 05:48:08,603 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:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2019-11-24 05:48:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2676. [2019-11-24 05:48:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2019-11-24 05:48:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3411 transitions. [2019-11-24 05:48:08,755 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3411 transitions. Word has length 55 [2019-11-24 05:48:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:08,756 INFO L462 AbstractCegarLoop]: Abstraction has 2676 states and 3411 transitions. [2019-11-24 05:48:08,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3411 transitions. [2019-11-24 05:48:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:48:08,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:08,759 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:08,760 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:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:08,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1049277419, now seen corresponding path program 1 times [2019-11-24 05:48:08,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:08,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145287789] [2019-11-24 05:48:08,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:08,827 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:08,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145287789] [2019-11-24 05:48:08,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:08,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:08,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007568329] [2019-11-24 05:48:08,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:08,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:08,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:08,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:08,830 INFO L87 Difference]: Start difference. First operand 2676 states and 3411 transitions. Second operand 3 states. [2019-11-24 05:48:09,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:09,046 INFO L93 Difference]: Finished difference Result 3806 states and 5002 transitions. [2019-11-24 05:48:09,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:09,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-24 05:48:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:09,056 INFO L225 Difference]: With dead ends: 3806 [2019-11-24 05:48:09,057 INFO L226 Difference]: Without dead ends: 2874 [2019-11-24 05:48:09,059 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:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2019-11-24 05:48:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2872. [2019-11-24 05:48:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2872 states. [2019-11-24 05:48:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 3712 transitions. [2019-11-24 05:48:09,262 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 3712 transitions. Word has length 55 [2019-11-24 05:48:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:09,262 INFO L462 AbstractCegarLoop]: Abstraction has 2872 states and 3712 transitions. [2019-11-24 05:48:09,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 3712 transitions. [2019-11-24 05:48:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:48:09,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:09,265 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:09,265 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:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash 772696843, now seen corresponding path program 1 times [2019-11-24 05:48:09,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:09,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776447336] [2019-11-24 05:48:09,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:09,309 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,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776447336] [2019-11-24 05:48:09,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:09,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:09,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125741974] [2019-11-24 05:48:09,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:09,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:09,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:09,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:09,311 INFO L87 Difference]: Start difference. First operand 2872 states and 3712 transitions. Second operand 3 states. [2019-11-24 05:48:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:09,592 INFO L93 Difference]: Finished difference Result 5772 states and 7594 transitions. [2019-11-24 05:48:09,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:09,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-24 05:48:09,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:09,607 INFO L225 Difference]: With dead ends: 5772 [2019-11-24 05:48:09,607 INFO L226 Difference]: Without dead ends: 3961 [2019-11-24 05:48:09,611 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:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2019-11-24 05:48:09,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3955. [2019-11-24 05:48:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3955 states. [2019-11-24 05:48:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 5080 transitions. [2019-11-24 05:48:09,932 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 5080 transitions. Word has length 55 [2019-11-24 05:48:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:09,932 INFO L462 AbstractCegarLoop]: Abstraction has 3955 states and 5080 transitions. [2019-11-24 05:48:09,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 5080 transitions. [2019-11-24 05:48:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:48:09,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:09,936 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:09,936 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:09,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:09,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2137132613, now seen corresponding path program 1 times [2019-11-24 05:48:09,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:09,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815354377] [2019-11-24 05:48:09,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:10,361 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:10,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815354377] [2019-11-24 05:48:10,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:10,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-24 05:48:10,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775437460] [2019-11-24 05:48:10,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:48:10,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:48:10,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:48:10,363 INFO L87 Difference]: Start difference. First operand 3955 states and 5080 transitions. Second operand 12 states. [2019-11-24 05:48:10,810 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-11-24 05:48:11,031 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-11-24 05:48:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:13,628 INFO L93 Difference]: Finished difference Result 8644 states and 11289 transitions. [2019-11-24 05:48:13,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:48:13,629 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-11-24 05:48:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:13,647 INFO L225 Difference]: With dead ends: 8644 [2019-11-24 05:48:13,647 INFO L226 Difference]: Without dead ends: 8397 [2019-11-24 05:48:13,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-11-24 05:48:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8397 states. [2019-11-24 05:48:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8397 to 3942. [2019-11-24 05:48:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3942 states. [2019-11-24 05:48:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 5065 transitions. [2019-11-24 05:48:13,981 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 5065 transitions. Word has length 56 [2019-11-24 05:48:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:13,981 INFO L462 AbstractCegarLoop]: Abstraction has 3942 states and 5065 transitions. [2019-11-24 05:48:13,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:48:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 5065 transitions. [2019-11-24 05:48:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:48:13,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:13,985 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:13,985 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:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1716509337, now seen corresponding path program 1 times [2019-11-24 05:48:13,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:13,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692856331] [2019-11-24 05:48:13,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:14,033 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:14,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692856331] [2019-11-24 05:48:14,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:14,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:14,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120289350] [2019-11-24 05:48:14,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:14,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:14,036 INFO L87 Difference]: Start difference. First operand 3942 states and 5065 transitions. Second operand 3 states. [2019-11-24 05:48:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:14,468 INFO L93 Difference]: Finished difference Result 7053 states and 9163 transitions. [2019-11-24 05:48:14,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:14,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-24 05:48:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:14,477 INFO L225 Difference]: With dead ends: 7053 [2019-11-24 05:48:14,478 INFO L226 Difference]: Without dead ends: 4058 [2019-11-24 05:48:14,482 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:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2019-11-24 05:48:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 3260. [2019-11-24 05:48:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3260 states. [2019-11-24 05:48:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 4213 transitions. [2019-11-24 05:48:14,805 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 4213 transitions. Word has length 56 [2019-11-24 05:48:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:14,805 INFO L462 AbstractCegarLoop]: Abstraction has 3260 states and 4213 transitions. [2019-11-24 05:48:14,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 4213 transitions. [2019-11-24 05:48:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:48:14,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:14,808 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:14,808 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:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1650159387, now seen corresponding path program 1 times [2019-11-24 05:48:14,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:14,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238870301] [2019-11-24 05:48:14,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:14,847 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:14,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238870301] [2019-11-24 05:48:14,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:14,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:14,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628848509] [2019-11-24 05:48:14,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:14,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:14,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:14,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:14,850 INFO L87 Difference]: Start difference. First operand 3260 states and 4213 transitions. Second operand 3 states. [2019-11-24 05:48:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:15,257 INFO L93 Difference]: Finished difference Result 5975 states and 7833 transitions. [2019-11-24 05:48:15,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:15,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-24 05:48:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:15,265 INFO L225 Difference]: With dead ends: 5975 [2019-11-24 05:48:15,266 INFO L226 Difference]: Without dead ends: 3415 [2019-11-24 05:48:15,269 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,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2019-11-24 05:48:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 2759. [2019-11-24 05:48:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2759 states. [2019-11-24 05:48:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 3578 transitions. [2019-11-24 05:48:15,600 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 3578 transitions. Word has length 56 [2019-11-24 05:48:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:15,600 INFO L462 AbstractCegarLoop]: Abstraction has 2759 states and 3578 transitions. [2019-11-24 05:48:15,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 3578 transitions. [2019-11-24 05:48:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:48:15,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:15,602 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:15,602 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:15,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:15,602 INFO L82 PathProgramCache]: Analyzing trace with hash 235795551, now seen corresponding path program 1 times [2019-11-24 05:48:15,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:15,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749138685] [2019-11-24 05:48:15,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:15,638 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,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749138685] [2019-11-24 05:48:15,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:15,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:15,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356126193] [2019-11-24 05:48:15,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:15,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:15,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:15,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:15,640 INFO L87 Difference]: Start difference. First operand 2759 states and 3578 transitions. Second operand 3 states. [2019-11-24 05:48:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:15,992 INFO L93 Difference]: Finished difference Result 5083 states and 6666 transitions. [2019-11-24 05:48:15,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:15,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-24 05:48:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:15,999 INFO L225 Difference]: With dead ends: 5083 [2019-11-24 05:48:15,999 INFO L226 Difference]: Without dead ends: 2657 [2019-11-24 05:48:16,003 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,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2019-11-24 05:48:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 2326. [2019-11-24 05:48:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-11-24 05:48:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3028 transitions. [2019-11-24 05:48:16,365 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3028 transitions. Word has length 56 [2019-11-24 05:48:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:16,365 INFO L462 AbstractCegarLoop]: Abstraction has 2326 states and 3028 transitions. [2019-11-24 05:48:16,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3028 transitions. [2019-11-24 05:48:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 05:48:16,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:16,366 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] [2019-11-24 05:48:16,366 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:16,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:16,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1739046160, now seen corresponding path program 1 times [2019-11-24 05:48:16,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:16,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954104803] [2019-11-24 05:48:16,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:16,723 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,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954104803] [2019-11-24 05:48:16,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:16,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-24 05:48:16,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255837785] [2019-11-24 05:48:16,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:48:16,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:16,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:48:16,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:48:16,725 INFO L87 Difference]: Start difference. First operand 2326 states and 3028 transitions. Second operand 12 states. [2019-11-24 05:48:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:19,286 INFO L93 Difference]: Finished difference Result 5856 states and 7602 transitions. [2019-11-24 05:48:19,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-24 05:48:19,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-11-24 05:48:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:19,291 INFO L225 Difference]: With dead ends: 5856 [2019-11-24 05:48:19,292 INFO L226 Difference]: Without dead ends: 5597 [2019-11-24 05:48:19,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2019-11-24 05:48:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2019-11-24 05:48:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 2301. [2019-11-24 05:48:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2301 states. [2019-11-24 05:48:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 2998 transitions. [2019-11-24 05:48:19,525 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 2998 transitions. Word has length 57 [2019-11-24 05:48:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:19,525 INFO L462 AbstractCegarLoop]: Abstraction has 2301 states and 2998 transitions. [2019-11-24 05:48:19,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:48:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2998 transitions. [2019-11-24 05:48:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 05:48:19,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:19,526 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] [2019-11-24 05:48:19,526 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:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash 503772602, now seen corresponding path program 1 times [2019-11-24 05:48:19,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:19,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883957978] [2019-11-24 05:48:19,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:19,778 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,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883957978] [2019-11-24 05:48:19,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:19,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:48:19,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623084352] [2019-11-24 05:48:19,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:48:19,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:19,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:48:19,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:48:19,780 INFO L87 Difference]: Start difference. First operand 2301 states and 2998 transitions. Second operand 11 states. [2019-11-24 05:48:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:22,143 INFO L93 Difference]: Finished difference Result 6102 states and 7940 transitions. [2019-11-24 05:48:22,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-24 05:48:22,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-11-24 05:48:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:22,149 INFO L225 Difference]: With dead ends: 6102 [2019-11-24 05:48:22,149 INFO L226 Difference]: Without dead ends: 5835 [2019-11-24 05:48:22,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=627, Unknown=0, NotChecked=0, Total=870 [2019-11-24 05:48:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2019-11-24 05:48:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 2268. [2019-11-24 05:48:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2019-11-24 05:48:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2959 transitions. [2019-11-24 05:48:22,447 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2959 transitions. Word has length 57 [2019-11-24 05:48:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:22,448 INFO L462 AbstractCegarLoop]: Abstraction has 2268 states and 2959 transitions. [2019-11-24 05:48:22,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:48:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2959 transitions. [2019-11-24 05:48:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 05:48:22,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:22,449 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] [2019-11-24 05:48:22,449 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:22,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:22,450 INFO L82 PathProgramCache]: Analyzing trace with hash -608984308, now seen corresponding path program 1 times [2019-11-24 05:48:22,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:22,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606979842] [2019-11-24 05:48:22,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:22,553 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:22,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606979842] [2019-11-24 05:48:22,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:22,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:48:22,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52973193] [2019-11-24 05:48:22,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:22,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:22,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:22,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:22,555 INFO L87 Difference]: Start difference. First operand 2268 states and 2959 transitions. Second operand 5 states. [2019-11-24 05:48:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:22,938 INFO L93 Difference]: Finished difference Result 4002 states and 5298 transitions. [2019-11-24 05:48:22,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:22,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-11-24 05:48:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:22,944 INFO L225 Difference]: With dead ends: 4002 [2019-11-24 05:48:22,944 INFO L226 Difference]: Without dead ends: 2214 [2019-11-24 05:48:22,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2019-11-24 05:48:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2210. [2019-11-24 05:48:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2210 states. [2019-11-24 05:48:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 2852 transitions. [2019-11-24 05:48:23,298 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 2852 transitions. Word has length 61 [2019-11-24 05:48:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:23,299 INFO L462 AbstractCegarLoop]: Abstraction has 2210 states and 2852 transitions. [2019-11-24 05:48:23,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2852 transitions. [2019-11-24 05:48:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 05:48:23,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:23,300 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:23,300 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:23,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:23,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1206109345, now seen corresponding path program 1 times [2019-11-24 05:48:23,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:23,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721091859] [2019-11-24 05:48:23,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:23,363 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:23,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721091859] [2019-11-24 05:48:23,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:23,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:23,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881841449] [2019-11-24 05:48:23,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:23,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:23,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:23,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:23,366 INFO L87 Difference]: Start difference. First operand 2210 states and 2852 transitions. Second operand 3 states. [2019-11-24 05:48:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:23,879 INFO L93 Difference]: Finished difference Result 4936 states and 6510 transitions. [2019-11-24 05:48:23,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:23,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-24 05:48:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:23,882 INFO L225 Difference]: With dead ends: 4936 [2019-11-24 05:48:23,882 INFO L226 Difference]: Without dead ends: 3314 [2019-11-24 05:48:23,884 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:23,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2019-11-24 05:48:24,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2999. [2019-11-24 05:48:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-11-24 05:48:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3862 transitions. [2019-11-24 05:48:24,269 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3862 transitions. Word has length 62 [2019-11-24 05:48:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:24,269 INFO L462 AbstractCegarLoop]: Abstraction has 2999 states and 3862 transitions. [2019-11-24 05:48:24,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3862 transitions. [2019-11-24 05:48:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 05:48:24,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:24,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, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:24,271 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:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1905991251, now seen corresponding path program 1 times [2019-11-24 05:48:24,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:24,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227021228] [2019-11-24 05:48:24,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:24,464 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:24,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227021228] [2019-11-24 05:48:24,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:24,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:48:24,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763725886] [2019-11-24 05:48:24,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:48:24,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:24,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:48:24,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:48:24,466 INFO L87 Difference]: Start difference. First operand 2999 states and 3862 transitions. Second operand 12 states. [2019-11-24 05:48:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:27,418 INFO L93 Difference]: Finished difference Result 10182 states and 13207 transitions. [2019-11-24 05:48:27,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-24 05:48:27,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-11-24 05:48:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:27,427 INFO L225 Difference]: With dead ends: 10182 [2019-11-24 05:48:27,428 INFO L226 Difference]: Without dead ends: 8100 [2019-11-24 05:48:27,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=833, Unknown=0, NotChecked=0, Total=1122 [2019-11-24 05:48:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8100 states. [2019-11-24 05:48:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8100 to 4017. [2019-11-24 05:48:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4017 states. [2019-11-24 05:48:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5125 transitions. [2019-11-24 05:48:28,071 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5125 transitions. Word has length 66 [2019-11-24 05:48:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:28,071 INFO L462 AbstractCegarLoop]: Abstraction has 4017 states and 5125 transitions. [2019-11-24 05:48:28,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:48:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5125 transitions. [2019-11-24 05:48:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 05:48:28,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:28,074 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:48:28,074 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:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:28,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1324109991, now seen corresponding path program 1 times [2019-11-24 05:48:28,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:28,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58501163] [2019-11-24 05:48:28,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:28,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:28,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58501163] [2019-11-24 05:48:28,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:28,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:48:28,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124065661] [2019-11-24 05:48:28,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:48:28,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:28,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:48:28,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:48:28,234 INFO L87 Difference]: Start difference. First operand 4017 states and 5125 transitions. Second operand 10 states. [2019-11-24 05:48:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:31,617 INFO L93 Difference]: Finished difference Result 11748 states and 15162 transitions. [2019-11-24 05:48:31,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-24 05:48:31,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-11-24 05:48:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:31,625 INFO L225 Difference]: With dead ends: 11748 [2019-11-24 05:48:31,625 INFO L226 Difference]: Without dead ends: 9278 [2019-11-24 05:48:31,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2019-11-24 05:48:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9278 states. [2019-11-24 05:48:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9278 to 3914. [2019-11-24 05:48:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3914 states. [2019-11-24 05:48:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 4928 transitions. [2019-11-24 05:48:32,278 INFO L78 Accepts]: Start accepts. Automaton has 3914 states and 4928 transitions. Word has length 69 [2019-11-24 05:48:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:32,278 INFO L462 AbstractCegarLoop]: Abstraction has 3914 states and 4928 transitions. [2019-11-24 05:48:32,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:48:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3914 states and 4928 transitions. [2019-11-24 05:48:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 05:48:32,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:32,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:32,280 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:32,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:32,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1685013142, now seen corresponding path program 1 times [2019-11-24 05:48:32,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:32,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130456741] [2019-11-24 05:48:32,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:32,548 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:32,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130456741] [2019-11-24 05:48:32,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:32,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-24 05:48:32,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969316997] [2019-11-24 05:48:32,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:48:32,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:48:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:48:32,551 INFO L87 Difference]: Start difference. First operand 3914 states and 4928 transitions. Second operand 11 states. [2019-11-24 05:48:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:35,870 INFO L93 Difference]: Finished difference Result 10784 states and 13635 transitions. [2019-11-24 05:48:35,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-24 05:48:35,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-11-24 05:48:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:35,877 INFO L225 Difference]: With dead ends: 10784 [2019-11-24 05:48:35,877 INFO L226 Difference]: Without dead ends: 8334 [2019-11-24 05:48:35,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-11-24 05:48:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2019-11-24 05:48:36,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 4989. [2019-11-24 05:48:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-11-24 05:48:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 6262 transitions. [2019-11-24 05:48:36,753 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 6262 transitions. Word has length 73 [2019-11-24 05:48:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:36,753 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 6262 transitions. [2019-11-24 05:48:36,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:48:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 6262 transitions. [2019-11-24 05:48:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-24 05:48:36,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:36,756 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:36,756 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:36,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:36,756 INFO L82 PathProgramCache]: Analyzing trace with hash -721542749, now seen corresponding path program 1 times [2019-11-24 05:48:36,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:36,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658211097] [2019-11-24 05:48:36,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:36,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658211097] [2019-11-24 05:48:36,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:36,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:36,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982705927] [2019-11-24 05:48:36,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:36,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:36,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:36,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:36,818 INFO L87 Difference]: Start difference. First operand 4989 states and 6262 transitions. Second operand 3 states. [2019-11-24 05:48:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:38,034 INFO L93 Difference]: Finished difference Result 9403 states and 11966 transitions. [2019-11-24 05:48:38,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:38,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-24 05:48:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:38,040 INFO L225 Difference]: With dead ends: 9403 [2019-11-24 05:48:38,040 INFO L226 Difference]: Without dead ends: 6277 [2019-11-24 05:48:38,044 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:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2019-11-24 05:48:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 5860. [2019-11-24 05:48:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5860 states. [2019-11-24 05:48:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5860 states to 5860 states and 7327 transitions. [2019-11-24 05:48:39,142 INFO L78 Accepts]: Start accepts. Automaton has 5860 states and 7327 transitions. Word has length 77 [2019-11-24 05:48:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:39,142 INFO L462 AbstractCegarLoop]: Abstraction has 5860 states and 7327 transitions. [2019-11-24 05:48:39,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5860 states and 7327 transitions. [2019-11-24 05:48:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-24 05:48:39,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:39,144 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:39,144 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:39,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:39,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1796477501, now seen corresponding path program 1 times [2019-11-24 05:48:39,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:39,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885070634] [2019-11-24 05:48:39,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:48:39,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885070634] [2019-11-24 05:48:39,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:39,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:48:39,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682484073] [2019-11-24 05:48:39,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:48:39,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:39,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:48:39,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:39,236 INFO L87 Difference]: Start difference. First operand 5860 states and 7327 transitions. Second operand 7 states. [2019-11-24 05:48:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:41,265 INFO L93 Difference]: Finished difference Result 8048 states and 10047 transitions. [2019-11-24 05:48:41,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:48:41,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-11-24 05:48:41,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:41,273 INFO L225 Difference]: With dead ends: 8048 [2019-11-24 05:48:41,273 INFO L226 Difference]: Without dead ends: 6953 [2019-11-24 05:48:41,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:48:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6953 states. [2019-11-24 05:48:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6953 to 5846. [2019-11-24 05:48:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5846 states. [2019-11-24 05:48:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5846 states to 5846 states and 7312 transitions. [2019-11-24 05:48:42,438 INFO L78 Accepts]: Start accepts. Automaton has 5846 states and 7312 transitions. Word has length 79 [2019-11-24 05:48:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:42,439 INFO L462 AbstractCegarLoop]: Abstraction has 5846 states and 7312 transitions. [2019-11-24 05:48:42,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:48:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5846 states and 7312 transitions. [2019-11-24 05:48:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-24 05:48:42,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:42,441 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:42,441 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:48:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash -43562587, now seen corresponding path program 1 times [2019-11-24 05:48:42,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:42,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850829980] [2019-11-24 05:48:42,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:48:42,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850829980] [2019-11-24 05:48:42,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:42,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:48:42,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592194116] [2019-11-24 05:48:42,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:48:42,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:42,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:48:42,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:48:42,556 INFO L87 Difference]: Start difference. First operand 5846 states and 7312 transitions. Second operand 8 states. [2019-11-24 05:48:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:45,335 INFO L93 Difference]: Finished difference Result 10638 states and 13268 transitions. [2019-11-24 05:48:45,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:48:45,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-11-24 05:48:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:45,342 INFO L225 Difference]: With dead ends: 10638 [2019-11-24 05:48:45,342 INFO L226 Difference]: Without dead ends: 8444 [2019-11-24 05:48:45,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:48:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8444 states. [2019-11-24 05:48:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8444 to 5826. [2019-11-24 05:48:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5826 states. [2019-11-24 05:48:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 7290 transitions. [2019-11-24 05:48:46,413 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 7290 transitions. Word has length 79 [2019-11-24 05:48:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:46,413 INFO L462 AbstractCegarLoop]: Abstraction has 5826 states and 7290 transitions. [2019-11-24 05:48:46,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:48:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 7290 transitions. [2019-11-24 05:48:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-24 05:48:46,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:46,415 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:46,415 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:48:46,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:46,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1496293753, now seen corresponding path program 1 times [2019-11-24 05:48:46,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:46,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118569309] [2019-11-24 05:48:46,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:46,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118569309] [2019-11-24 05:48:46,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906864829] [2019-11-24 05:48:46,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:48:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:47,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-24 05:48:47,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:48:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 05:48:47,528 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:48:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 05:48:47,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:48:47,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [16] total 28 [2019-11-24 05:48:47,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639022840] [2019-11-24 05:48:47,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-24 05:48:47,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:47,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-24 05:48:47,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2019-11-24 05:48:47,728 INFO L87 Difference]: Start difference. First operand 5826 states and 7290 transitions. Second operand 14 states. [2019-11-24 05:48:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:51,444 INFO L93 Difference]: Finished difference Result 11762 states and 14669 transitions. [2019-11-24 05:48:51,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:48:51,444 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2019-11-24 05:48:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:51,469 INFO L225 Difference]: With dead ends: 11762 [2019-11-24 05:48:51,469 INFO L226 Difference]: Without dead ends: 9620 [2019-11-24 05:48:51,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=206, Invalid=1200, Unknown=0, NotChecked=0, Total=1406 [2019-11-24 05:48:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9620 states. [2019-11-24 05:48:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9620 to 5808. [2019-11-24 05:48:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5808 states. [2019-11-24 05:48:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 7270 transitions. [2019-11-24 05:48:52,970 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 7270 transitions. Word has length 80 [2019-11-24 05:48:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:52,970 INFO L462 AbstractCegarLoop]: Abstraction has 5808 states and 7270 transitions. [2019-11-24 05:48:52,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-24 05:48:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 7270 transitions. [2019-11-24 05:48:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-24 05:48:52,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:52,975 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:53,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:48:53,180 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:48:53,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2122960952, now seen corresponding path program 1 times [2019-11-24 05:48:53,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:53,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993278547] [2019-11-24 05:48:53,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:53,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993278547] [2019-11-24 05:48:53,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408524918] [2019-11-24 05:48:53,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:48:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:54,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-24 05:48:54,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:48:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:48:54,546 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:48:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:48:54,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:48:54,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [16] total 34 [2019-11-24 05:48:54,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203048745] [2019-11-24 05:48:54,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-24 05:48:54,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:54,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-24 05:48:54,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2019-11-24 05:48:54,884 INFO L87 Difference]: Start difference. First operand 5808 states and 7270 transitions. Second operand 20 states. [2019-11-24 05:49:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:00,170 INFO L93 Difference]: Finished difference Result 18644 states and 23508 transitions. [2019-11-24 05:49:00,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-24 05:49:00,171 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2019-11-24 05:49:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:00,188 INFO L225 Difference]: With dead ends: 18644 [2019-11-24 05:49:00,189 INFO L226 Difference]: Without dead ends: 15030 [2019-11-24 05:49:00,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=436, Invalid=2320, Unknown=0, NotChecked=0, Total=2756 [2019-11-24 05:49:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15030 states. [2019-11-24 05:49:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15030 to 6085. [2019-11-24 05:49:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6085 states. [2019-11-24 05:49:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 7649 transitions. [2019-11-24 05:49:01,804 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 7649 transitions. Word has length 80 [2019-11-24 05:49:01,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:01,804 INFO L462 AbstractCegarLoop]: Abstraction has 6085 states and 7649 transitions. [2019-11-24 05:49:01,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-24 05:49:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 7649 transitions. [2019-11-24 05:49:01,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-24 05:49:01,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:01,806 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:02,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:02,007 INFO L410 AbstractCegarLoop]: === Iteration 26 === [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:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash 125210829, now seen corresponding path program 1 times [2019-11-24 05:49:02,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:02,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419257030] [2019-11-24 05:49:02,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:02,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419257030] [2019-11-24 05:49:02,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23527037] [2019-11-24 05:49:02,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:02,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-24 05:49:02,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:03,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:03,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:03,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:49:03,708 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:03,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:49:04,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:04,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [16] total 36 [2019-11-24 05:49:04,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486672900] [2019-11-24 05:49:04,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 05:49:04,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 05:49:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2019-11-24 05:49:04,078 INFO L87 Difference]: Start difference. First operand 6085 states and 7649 transitions. Second operand 22 states. [2019-11-24 05:49:05,165 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-11-24 05:49:05,488 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-11-24 05:49:06,002 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50