/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/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:49:29,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:49:29,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:49:29,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:49:29,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:49:29,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:49:29,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:49:29,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:49:29,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:49:29,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:49:29,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:49:29,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:49:29,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:49:29,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:49:29,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:49:29,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:49:29,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:49:29,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:49:29,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:49:29,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:49:29,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:49:29,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:49:29,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:49:29,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:49:29,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:49:29,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:49:29,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:49:29,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:49:29,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:49:29,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:49:29,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:49:29,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:49:29,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:49:29,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:49:29,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:49:29,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:49:29,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:49:29,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:49:29,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:49:29,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:49:29,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:49:29,970 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:49:29,984 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:49:29,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:49:29,985 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:49:29,985 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:49:29,986 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:49:29,986 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:49:29,986 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:49:29,986 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:49:29,986 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:49:29,987 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:49:29,987 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:49:29,987 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:49:29,987 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:49:29,987 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:49:29,988 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:49:29,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:49:29,988 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:49:29,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:49:29,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:49:29,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:49:29,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:49:29,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:49:29,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:49:29,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:49:29,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:49:29,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:49:29,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:49:29,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:49:29,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:49:29,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:49:29,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:49:29,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:49:29,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:49:29,992 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:49:29,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:49:29,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:49:29,992 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:49:29,993 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:49:30,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:49:30,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:49:30,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:49:30,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:49:30,330 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:49:30,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-11-24 05:49:30,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc2d5ad29/a15d62473cb94b06b39c18b3d782cd38/FLAGd68e2ace7 [2019-11-24 05:49:30,907 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:49:30,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-11-24 05:49:30,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc2d5ad29/a15d62473cb94b06b39c18b3d782cd38/FLAGd68e2ace7 [2019-11-24 05:49:31,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc2d5ad29/a15d62473cb94b06b39c18b3d782cd38 [2019-11-24 05:49:31,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:49:31,232 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:49:31,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:49:31,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:49:31,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:49:31,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:49:31" (1/1) ... [2019-11-24 05:49:31,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7643fccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:31, skipping insertion in model container [2019-11-24 05:49:31,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:49:31" (1/1) ... [2019-11-24 05:49:31,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:49:31,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:49:31,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:49:31,671 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:49:31,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:49:31,762 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:49:31,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:31 WrapperNode [2019-11-24 05:49:31,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:49:31,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:49:31,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:49:31,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:49:31,770 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:49:31" (1/1) ... [2019-11-24 05:49:31,783 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:49:31" (1/1) ... [2019-11-24 05:49:31,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:49:31,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:49:31,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:49:31,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:49:31,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:31" (1/1) ... [2019-11-24 05:49:31,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:31" (1/1) ... [2019-11-24 05:49:31,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:31" (1/1) ... [2019-11-24 05:49:31,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:31" (1/1) ... [2019-11-24 05:49:31,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:31" (1/1) ... [2019-11-24 05:49:31,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:31" (1/1) ... [2019-11-24 05:49:31,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:31" (1/1) ... [2019-11-24 05:49:31,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:49:31,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:49:31,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:49:31,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:49:31,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:31" (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:49:31,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:49:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:49:33,729 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:49:33,729 INFO L284 CfgBuilder]: Removed 119 assume(true) statements. [2019-11-24 05:49:33,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:49:33 BoogieIcfgContainer [2019-11-24 05:49:33,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:49:33,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:49:33,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:49:33,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:49:33,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:49:31" (1/3) ... [2019-11-24 05:49:33,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5b1c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:49:33, skipping insertion in model container [2019-11-24 05:49:33,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:31" (2/3) ... [2019-11-24 05:49:33,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5b1c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:49:33, skipping insertion in model container [2019-11-24 05:49:33,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:49:33" (3/3) ... [2019-11-24 05:49:33,741 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-11-24 05:49:33,752 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:49:33,763 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-11-24 05:49:33,776 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-11-24 05:49:33,825 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:49:33,825 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:49:33,825 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:49:33,826 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:49:33,826 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:49:33,826 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:49:33,827 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:49:33,827 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:49:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states. [2019-11-24 05:49:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 05:49:33,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:33,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:33,880 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:33,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash 584310844, now seen corresponding path program 1 times [2019-11-24 05:49:33,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:33,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020467371] [2019-11-24 05:49:33,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:34,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020467371] [2019-11-24 05:49:34,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:34,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:34,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685150031] [2019-11-24 05:49:34,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:34,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:34,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:34,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:34,302 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 3 states. [2019-11-24 05:49:34,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:34,442 INFO L93 Difference]: Finished difference Result 465 states and 720 transitions. [2019-11-24 05:49:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:34,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-24 05:49:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:34,507 INFO L225 Difference]: With dead ends: 465 [2019-11-24 05:49:34,508 INFO L226 Difference]: Without dead ends: 232 [2019-11-24 05:49:34,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-24 05:49:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 207. [2019-11-24 05:49:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-24 05:49:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2019-11-24 05:49:34,604 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 11 [2019-11-24 05:49:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:34,605 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2019-11-24 05:49:34,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2019-11-24 05:49:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 05:49:34,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:34,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:34,608 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:34,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:34,609 INFO L82 PathProgramCache]: Analyzing trace with hash 649342094, now seen corresponding path program 1 times [2019-11-24 05:49:34,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:34,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453283162] [2019-11-24 05:49:34,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:34,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453283162] [2019-11-24 05:49:34,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:34,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:34,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14279012] [2019-11-24 05:49:34,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:34,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:34,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:34,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:34,755 INFO L87 Difference]: Start difference. First operand 207 states and 299 transitions. Second operand 4 states. [2019-11-24 05:49:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:34,818 INFO L93 Difference]: Finished difference Result 614 states and 884 transitions. [2019-11-24 05:49:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:49:34,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-24 05:49:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:34,825 INFO L225 Difference]: With dead ends: 614 [2019-11-24 05:49:34,825 INFO L226 Difference]: Without dead ends: 405 [2019-11-24 05:49:34,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-11-24 05:49:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 209. [2019-11-24 05:49:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-24 05:49:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 301 transitions. [2019-11-24 05:49:34,866 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 301 transitions. Word has length 13 [2019-11-24 05:49:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:34,866 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 301 transitions. [2019-11-24 05:49:34,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 301 transitions. [2019-11-24 05:49:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:49:34,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:34,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:34,868 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:34,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:34,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1809607002, now seen corresponding path program 1 times [2019-11-24 05:49:34,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:34,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147697591] [2019-11-24 05:49:34,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:35,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147697591] [2019-11-24 05:49:35,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:35,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:35,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412176737] [2019-11-24 05:49:35,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:35,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:35,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:35,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:35,009 INFO L87 Difference]: Start difference. First operand 209 states and 301 transitions. Second operand 3 states. [2019-11-24 05:49:35,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:35,046 INFO L93 Difference]: Finished difference Result 441 states and 636 transitions. [2019-11-24 05:49:35,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:35,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 05:49:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:35,051 INFO L225 Difference]: With dead ends: 441 [2019-11-24 05:49:35,051 INFO L226 Difference]: Without dead ends: 233 [2019-11-24 05:49:35,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-24 05:49:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 204. [2019-11-24 05:49:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-24 05:49:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 293 transitions. [2019-11-24 05:49:35,067 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 293 transitions. Word has length 15 [2019-11-24 05:49:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:35,068 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 293 transitions. [2019-11-24 05:49:35,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 293 transitions. [2019-11-24 05:49:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 05:49:35,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:35,070 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:35,070 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash -694827906, now seen corresponding path program 1 times [2019-11-24 05:49:35,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:35,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434429420] [2019-11-24 05:49:35,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:35,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434429420] [2019-11-24 05:49:35,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:35,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:35,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75612540] [2019-11-24 05:49:35,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:35,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:35,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:35,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:35,266 INFO L87 Difference]: Start difference. First operand 204 states and 293 transitions. Second operand 5 states. [2019-11-24 05:49:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:35,391 INFO L93 Difference]: Finished difference Result 545 states and 792 transitions. [2019-11-24 05:49:35,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:49:35,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-24 05:49:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:35,394 INFO L225 Difference]: With dead ends: 545 [2019-11-24 05:49:35,394 INFO L226 Difference]: Without dead ends: 342 [2019-11-24 05:49:35,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-11-24 05:49:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 174. [2019-11-24 05:49:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-24 05:49:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 247 transitions. [2019-11-24 05:49:35,404 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 247 transitions. Word has length 19 [2019-11-24 05:49:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:35,405 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 247 transitions. [2019-11-24 05:49:35,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 247 transitions. [2019-11-24 05:49:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 05:49:35,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:35,406 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] [2019-11-24 05:49:35,407 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:35,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1101592274, now seen corresponding path program 1 times [2019-11-24 05:49:35,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:35,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506141609] [2019-11-24 05:49:35,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:35,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:49:35,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506141609] [2019-11-24 05:49:35,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:35,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:35,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948239144] [2019-11-24 05:49:35,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:35,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:35,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:35,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:35,553 INFO L87 Difference]: Start difference. First operand 174 states and 247 transitions. Second operand 5 states. [2019-11-24 05:49:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:35,720 INFO L93 Difference]: Finished difference Result 579 states and 824 transitions. [2019-11-24 05:49:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:49:35,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 05:49:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:35,723 INFO L225 Difference]: With dead ends: 579 [2019-11-24 05:49:35,723 INFO L226 Difference]: Without dead ends: 406 [2019-11-24 05:49:35,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-24 05:49:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 144. [2019-11-24 05:49:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-24 05:49:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 201 transitions. [2019-11-24 05:49:35,734 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 201 transitions. Word has length 24 [2019-11-24 05:49:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:35,734 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 201 transitions. [2019-11-24 05:49:35,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 201 transitions. [2019-11-24 05:49:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 05:49:35,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:35,736 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] [2019-11-24 05:49:35,736 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:35,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:35,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1259097814, now seen corresponding path program 1 times [2019-11-24 05:49:35,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:35,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177186320] [2019-11-24 05:49:35,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:35,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177186320] [2019-11-24 05:49:35,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:35,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:35,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491043153] [2019-11-24 05:49:35,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:35,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:35,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:35,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:35,903 INFO L87 Difference]: Start difference. First operand 144 states and 201 transitions. Second operand 6 states. [2019-11-24 05:49:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:36,178 INFO L93 Difference]: Finished difference Result 629 states and 878 transitions. [2019-11-24 05:49:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:36,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-24 05:49:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:36,182 INFO L225 Difference]: With dead ends: 629 [2019-11-24 05:49:36,182 INFO L226 Difference]: Without dead ends: 486 [2019-11-24 05:49:36,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:49:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-11-24 05:49:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 198. [2019-11-24 05:49:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-24 05:49:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 280 transitions. [2019-11-24 05:49:36,204 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 280 transitions. Word has length 29 [2019-11-24 05:49:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:36,205 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 280 transitions. [2019-11-24 05:49:36,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 280 transitions. [2019-11-24 05:49:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 05:49:36,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:36,210 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] [2019-11-24 05:49:36,210 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:36,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:36,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1180503935, now seen corresponding path program 1 times [2019-11-24 05:49:36,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:36,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810349606] [2019-11-24 05:49:36,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:36,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:49:36,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810349606] [2019-11-24 05:49:36,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:36,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:36,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508089019] [2019-11-24 05:49:36,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:36,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:36,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:36,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:36,313 INFO L87 Difference]: Start difference. First operand 198 states and 280 transitions. Second operand 3 states. [2019-11-24 05:49:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:36,359 INFO L93 Difference]: Finished difference Result 364 states and 515 transitions. [2019-11-24 05:49:36,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:36,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-24 05:49:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:36,361 INFO L225 Difference]: With dead ends: 364 [2019-11-24 05:49:36,362 INFO L226 Difference]: Without dead ends: 221 [2019-11-24 05:49:36,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-24 05:49:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2019-11-24 05:49:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-24 05:49:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 273 transitions. [2019-11-24 05:49:36,379 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 273 transitions. Word has length 30 [2019-11-24 05:49:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:36,380 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 273 transitions. [2019-11-24 05:49:36,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 273 transitions. [2019-11-24 05:49:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 05:49:36,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:36,386 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] [2019-11-24 05:49:36,386 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:36,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:36,387 INFO L82 PathProgramCache]: Analyzing trace with hash 383569800, now seen corresponding path program 1 times [2019-11-24 05:49:36,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:36,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355817408] [2019-11-24 05:49:36,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:36,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355817408] [2019-11-24 05:49:36,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:36,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:49:36,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132509640] [2019-11-24 05:49:36,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:49:36,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:36,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:49:36,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:36,519 INFO L87 Difference]: Start difference. First operand 194 states and 273 transitions. Second operand 7 states. [2019-11-24 05:49:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:36,888 INFO L93 Difference]: Finished difference Result 876 states and 1210 transitions. [2019-11-24 05:49:36,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:36,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-11-24 05:49:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:36,894 INFO L225 Difference]: With dead ends: 876 [2019-11-24 05:49:36,895 INFO L226 Difference]: Without dead ends: 718 [2019-11-24 05:49:36,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:49:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-11-24 05:49:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 236. [2019-11-24 05:49:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-24 05:49:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 331 transitions. [2019-11-24 05:49:36,918 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 331 transitions. Word has length 33 [2019-11-24 05:49:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:36,918 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 331 transitions. [2019-11-24 05:49:36,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:49:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 331 transitions. [2019-11-24 05:49:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 05:49:36,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:36,921 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] [2019-11-24 05:49:36,921 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:36,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1480642472, now seen corresponding path program 1 times [2019-11-24 05:49:36,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:36,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000977626] [2019-11-24 05:49:36,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:37,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000977626] [2019-11-24 05:49:37,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:37,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:37,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240413920] [2019-11-24 05:49:37,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:37,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:37,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:37,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:37,027 INFO L87 Difference]: Start difference. First operand 236 states and 331 transitions. Second operand 4 states. [2019-11-24 05:49:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:37,130 INFO L93 Difference]: Finished difference Result 685 states and 949 transitions. [2019-11-24 05:49:37,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:37,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-24 05:49:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:37,134 INFO L225 Difference]: With dead ends: 685 [2019-11-24 05:49:37,134 INFO L226 Difference]: Without dead ends: 515 [2019-11-24 05:49:37,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-11-24 05:49:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 347. [2019-11-24 05:49:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-24 05:49:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 479 transitions. [2019-11-24 05:49:37,165 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 479 transitions. Word has length 33 [2019-11-24 05:49:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:37,165 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 479 transitions. [2019-11-24 05:49:37,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 479 transitions. [2019-11-24 05:49:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 05:49:37,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:37,166 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] [2019-11-24 05:49:37,167 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:37,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1855919143, now seen corresponding path program 1 times [2019-11-24 05:49:37,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:37,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792452815] [2019-11-24 05:49:37,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:37,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792452815] [2019-11-24 05:49:37,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:37,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:37,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445803651] [2019-11-24 05:49:37,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:37,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:37,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:37,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:37,237 INFO L87 Difference]: Start difference. First operand 347 states and 479 transitions. Second operand 3 states. [2019-11-24 05:49:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:37,308 INFO L93 Difference]: Finished difference Result 695 states and 958 transitions. [2019-11-24 05:49:37,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:37,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 05:49:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:37,312 INFO L225 Difference]: With dead ends: 695 [2019-11-24 05:49:37,312 INFO L226 Difference]: Without dead ends: 424 [2019-11-24 05:49:37,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-11-24 05:49:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 341. [2019-11-24 05:49:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-11-24 05:49:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 465 transitions. [2019-11-24 05:49:37,352 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 465 transitions. Word has length 34 [2019-11-24 05:49:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:37,354 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 465 transitions. [2019-11-24 05:49:37,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 465 transitions. [2019-11-24 05:49:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 05:49:37,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:37,356 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] [2019-11-24 05:49:37,356 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash -536079151, now seen corresponding path program 1 times [2019-11-24 05:49:37,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:37,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32546219] [2019-11-24 05:49:37,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:37,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32546219] [2019-11-24 05:49:37,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:37,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:37,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748172261] [2019-11-24 05:49:37,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:37,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:37,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:37,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:37,500 INFO L87 Difference]: Start difference. First operand 341 states and 465 transitions. Second operand 6 states. [2019-11-24 05:49:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:37,799 INFO L93 Difference]: Finished difference Result 1073 states and 1454 transitions. [2019-11-24 05:49:37,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:37,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-24 05:49:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:37,804 INFO L225 Difference]: With dead ends: 1073 [2019-11-24 05:49:37,804 INFO L226 Difference]: Without dead ends: 847 [2019-11-24 05:49:37,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:49:37,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-11-24 05:49:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 345. [2019-11-24 05:49:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-11-24 05:49:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 470 transitions. [2019-11-24 05:49:37,837 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 470 transitions. Word has length 34 [2019-11-24 05:49:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:37,838 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 470 transitions. [2019-11-24 05:49:37,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 470 transitions. [2019-11-24 05:49:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 05:49:37,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:37,839 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] [2019-11-24 05:49:37,841 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:37,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1578226072, now seen corresponding path program 1 times [2019-11-24 05:49:37,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:37,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321635926] [2019-11-24 05:49:37,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:37,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321635926] [2019-11-24 05:49:37,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:37,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:37,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444009333] [2019-11-24 05:49:37,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:37,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:37,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:37,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:37,929 INFO L87 Difference]: Start difference. First operand 345 states and 470 transitions. Second operand 5 states. [2019-11-24 05:49:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:38,169 INFO L93 Difference]: Finished difference Result 661 states and 914 transitions. [2019-11-24 05:49:38,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:38,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-24 05:49:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:38,173 INFO L225 Difference]: With dead ends: 661 [2019-11-24 05:49:38,173 INFO L226 Difference]: Without dead ends: 659 [2019-11-24 05:49:38,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 05:49:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-24 05:49:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 347. [2019-11-24 05:49:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-24 05:49:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 472 transitions. [2019-11-24 05:49:38,203 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 472 transitions. Word has length 34 [2019-11-24 05:49:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:38,203 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 472 transitions. [2019-11-24 05:49:38,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 472 transitions. [2019-11-24 05:49:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 05:49:38,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:38,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:38,204 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:38,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:38,205 INFO L82 PathProgramCache]: Analyzing trace with hash -352565956, now seen corresponding path program 1 times [2019-11-24 05:49:38,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:38,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580073960] [2019-11-24 05:49:38,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:38,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580073960] [2019-11-24 05:49:38,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:38,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:38,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199663944] [2019-11-24 05:49:38,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:38,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:38,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:38,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:38,306 INFO L87 Difference]: Start difference. First operand 347 states and 472 transitions. Second operand 6 states. [2019-11-24 05:49:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:38,479 INFO L93 Difference]: Finished difference Result 733 states and 1009 transitions. [2019-11-24 05:49:38,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:38,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-24 05:49:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:38,483 INFO L225 Difference]: With dead ends: 733 [2019-11-24 05:49:38,484 INFO L226 Difference]: Without dead ends: 505 [2019-11-24 05:49:38,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:49:38,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-24 05:49:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 353. [2019-11-24 05:49:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-24 05:49:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 478 transitions. [2019-11-24 05:49:38,527 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 478 transitions. Word has length 35 [2019-11-24 05:49:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:38,527 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 478 transitions. [2019-11-24 05:49:38,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 478 transitions. [2019-11-24 05:49:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 05:49:38,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:38,528 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] [2019-11-24 05:49:38,529 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:38,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:38,529 INFO L82 PathProgramCache]: Analyzing trace with hash 563276109, now seen corresponding path program 1 times [2019-11-24 05:49:38,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:38,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503287131] [2019-11-24 05:49:38,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:38,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503287131] [2019-11-24 05:49:38,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:38,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:49:38,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591823733] [2019-11-24 05:49:38,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:49:38,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:38,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:49:38,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:38,691 INFO L87 Difference]: Start difference. First operand 353 states and 478 transitions. Second operand 7 states. [2019-11-24 05:49:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:39,111 INFO L93 Difference]: Finished difference Result 1597 states and 2116 transitions. [2019-11-24 05:49:39,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:39,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-24 05:49:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:39,118 INFO L225 Difference]: With dead ends: 1597 [2019-11-24 05:49:39,118 INFO L226 Difference]: Without dead ends: 1340 [2019-11-24 05:49:39,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:49:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-11-24 05:49:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 435. [2019-11-24 05:49:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-11-24 05:49:39,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 580 transitions. [2019-11-24 05:49:39,164 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 580 transitions. Word has length 35 [2019-11-24 05:49:39,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:39,164 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 580 transitions. [2019-11-24 05:49:39,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:49:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 580 transitions. [2019-11-24 05:49:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 05:49:39,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:39,165 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] [2019-11-24 05:49:39,166 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:39,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:39,166 INFO L82 PathProgramCache]: Analyzing trace with hash -5365456, now seen corresponding path program 1 times [2019-11-24 05:49:39,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:39,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079488021] [2019-11-24 05:49:39,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:39,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079488021] [2019-11-24 05:49:39,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:39,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:39,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068476976] [2019-11-24 05:49:39,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:39,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:39,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:39,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:39,209 INFO L87 Difference]: Start difference. First operand 435 states and 580 transitions. Second operand 3 states. [2019-11-24 05:49:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:39,295 INFO L93 Difference]: Finished difference Result 912 states and 1208 transitions. [2019-11-24 05:49:39,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:39,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 05:49:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:39,299 INFO L225 Difference]: With dead ends: 912 [2019-11-24 05:49:39,299 INFO L226 Difference]: Without dead ends: 607 [2019-11-24 05:49:39,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-11-24 05:49:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 410. [2019-11-24 05:49:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-24 05:49:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 541 transitions. [2019-11-24 05:49:39,339 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 541 transitions. Word has length 36 [2019-11-24 05:49:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:39,339 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 541 transitions. [2019-11-24 05:49:39,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 541 transitions. [2019-11-24 05:49:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 05:49:39,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:39,341 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] [2019-11-24 05:49:39,341 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:39,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:39,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2110440091, now seen corresponding path program 1 times [2019-11-24 05:49:39,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:39,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235809680] [2019-11-24 05:49:39,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:39,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235809680] [2019-11-24 05:49:39,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:39,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:39,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941043171] [2019-11-24 05:49:39,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:39,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:39,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:39,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:39,396 INFO L87 Difference]: Start difference. First operand 410 states and 541 transitions. Second operand 4 states. [2019-11-24 05:49:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:39,596 INFO L93 Difference]: Finished difference Result 1139 states and 1487 transitions. [2019-11-24 05:49:39,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:39,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-24 05:49:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:39,602 INFO L225 Difference]: With dead ends: 1139 [2019-11-24 05:49:39,602 INFO L226 Difference]: Without dead ends: 851 [2019-11-24 05:49:39,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:39,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-11-24 05:49:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 561. [2019-11-24 05:49:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-11-24 05:49:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 730 transitions. [2019-11-24 05:49:39,678 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 730 transitions. Word has length 37 [2019-11-24 05:49:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:39,678 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 730 transitions. [2019-11-24 05:49:39,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:39,679 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 730 transitions. [2019-11-24 05:49:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 05:49:39,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:39,680 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] [2019-11-24 05:49:39,680 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:39,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:39,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1505083797, now seen corresponding path program 1 times [2019-11-24 05:49:39,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:39,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023230130] [2019-11-24 05:49:39,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:39,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023230130] [2019-11-24 05:49:39,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:39,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:39,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741491146] [2019-11-24 05:49:39,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:39,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:39,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:39,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:39,721 INFO L87 Difference]: Start difference. First operand 561 states and 730 transitions. Second operand 4 states. [2019-11-24 05:49:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:39,861 INFO L93 Difference]: Finished difference Result 1264 states and 1629 transitions. [2019-11-24 05:49:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:39,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-24 05:49:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:39,866 INFO L225 Difference]: With dead ends: 1264 [2019-11-24 05:49:39,866 INFO L226 Difference]: Without dead ends: 730 [2019-11-24 05:49:39,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-11-24 05:49:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 494. [2019-11-24 05:49:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-24 05:49:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 633 transitions. [2019-11-24 05:49:39,927 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 633 transitions. Word has length 37 [2019-11-24 05:49:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:39,927 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 633 transitions. [2019-11-24 05:49:39,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 633 transitions. [2019-11-24 05:49:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 05:49:39,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:39,929 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] [2019-11-24 05:49:39,929 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:39,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash -212164615, now seen corresponding path program 1 times [2019-11-24 05:49:39,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:39,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108286941] [2019-11-24 05:49:39,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:39,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108286941] [2019-11-24 05:49:39,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:39,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:39,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320126796] [2019-11-24 05:49:39,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:39,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:39,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:39,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:39,964 INFO L87 Difference]: Start difference. First operand 494 states and 633 transitions. Second operand 4 states. [2019-11-24 05:49:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:40,068 INFO L93 Difference]: Finished difference Result 1154 states and 1476 transitions. [2019-11-24 05:49:40,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:40,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-24 05:49:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:40,072 INFO L225 Difference]: With dead ends: 1154 [2019-11-24 05:49:40,073 INFO L226 Difference]: Without dead ends: 692 [2019-11-24 05:49:40,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-11-24 05:49:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 458. [2019-11-24 05:49:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-24 05:49:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 581 transitions. [2019-11-24 05:49:40,123 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 581 transitions. Word has length 40 [2019-11-24 05:49:40,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:40,124 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 581 transitions. [2019-11-24 05:49:40,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 581 transitions. [2019-11-24 05:49:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 05:49:40,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:40,125 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:40,126 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash -512606550, now seen corresponding path program 1 times [2019-11-24 05:49:40,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:40,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614141070] [2019-11-24 05:49:40,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:40,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614141070] [2019-11-24 05:49:40,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485526982] [2019-11-24 05:49:40,398 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:49:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:40,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:40,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:40,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:40,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:40,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:40,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:40,719 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:40,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:40,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-11-24 05:49:40,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583313819] [2019-11-24 05:49:40,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:40,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:40,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:40,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:49:40,731 INFO L87 Difference]: Start difference. First operand 458 states and 581 transitions. Second operand 6 states. [2019-11-24 05:49:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:40,984 INFO L93 Difference]: Finished difference Result 1283 states and 1655 transitions. [2019-11-24 05:49:40,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:40,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-11-24 05:49:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:40,988 INFO L225 Difference]: With dead ends: 1283 [2019-11-24 05:49:40,989 INFO L226 Difference]: Without dead ends: 898 [2019-11-24 05:49:40,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-24 05:49:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2019-11-24 05:49:41,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 458. [2019-11-24 05:49:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-24 05:49:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 578 transitions. [2019-11-24 05:49:41,061 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 578 transitions. Word has length 62 [2019-11-24 05:49:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:41,062 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 578 transitions. [2019-11-24 05:49:41,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 578 transitions. [2019-11-24 05:49:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 05:49:41,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:41,063 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:41,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:41,268 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:41,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:41,268 INFO L82 PathProgramCache]: Analyzing trace with hash 531706767, now seen corresponding path program 1 times [2019-11-24 05:49:41,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:41,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373030852] [2019-11-24 05:49:41,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:41,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373030852] [2019-11-24 05:49:41,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207493017] [2019-11-24 05:49:41,434 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:49:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:41,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:41,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:41,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:41,666 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:41,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:41,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-11-24 05:49:41,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878431317] [2019-11-24 05:49:41,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:41,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:41,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:41,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:49:41,718 INFO L87 Difference]: Start difference. First operand 458 states and 578 transitions. Second operand 6 states. [2019-11-24 05:49:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:42,022 INFO L93 Difference]: Finished difference Result 1166 states and 1494 transitions. [2019-11-24 05:49:42,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:42,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-24 05:49:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:42,027 INFO L225 Difference]: With dead ends: 1166 [2019-11-24 05:49:42,027 INFO L226 Difference]: Without dead ends: 781 [2019-11-24 05:49:42,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-24 05:49:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-11-24 05:49:42,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 458. [2019-11-24 05:49:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-24 05:49:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 575 transitions. [2019-11-24 05:49:42,119 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 575 transitions. Word has length 66 [2019-11-24 05:49:42,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:42,120 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 575 transitions. [2019-11-24 05:49:42,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 575 transitions. [2019-11-24 05:49:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 05:49:42,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:42,122 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:42,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:42,329 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:42,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:42,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1934207957, now seen corresponding path program 1 times [2019-11-24 05:49:42,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:42,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150122309] [2019-11-24 05:49:42,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:42,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150122309] [2019-11-24 05:49:42,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609493480] [2019-11-24 05:49:42,510 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:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:42,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:42,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:42,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:49:42,749 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:49:42,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:42,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-11-24 05:49:42,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365458657] [2019-11-24 05:49:42,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:42,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:42,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:42,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:49:42,763 INFO L87 Difference]: Start difference. First operand 458 states and 575 transitions. Second operand 6 states. [2019-11-24 05:49:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:43,174 INFO L93 Difference]: Finished difference Result 1057 states and 1354 transitions. [2019-11-24 05:49:43,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:43,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-24 05:49:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:43,180 INFO L225 Difference]: With dead ends: 1057 [2019-11-24 05:49:43,180 INFO L226 Difference]: Without dead ends: 686 [2019-11-24 05:49:43,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-24 05:49:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-24 05:49:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 458. [2019-11-24 05:49:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-24 05:49:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 574 transitions. [2019-11-24 05:49:43,260 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 574 transitions. Word has length 69 [2019-11-24 05:49:43,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:43,260 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 574 transitions. [2019-11-24 05:49:43,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 574 transitions. [2019-11-24 05:49:43,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 05:49:43,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:43,262 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:43,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:43,467 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1415382522, now seen corresponding path program 1 times [2019-11-24 05:49:43,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:43,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225700488] [2019-11-24 05:49:43,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:43,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225700488] [2019-11-24 05:49:43,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824929357] [2019-11-24 05:49:43,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:43,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-24 05:49:43,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:43,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:43,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:43,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:43,939 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:43,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:44,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [398550107] [2019-11-24 05:49:44,209 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2019-11-24 05:49:44,209 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:49:44,215 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:49:44,223 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:49:44,223 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:49:48,722 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:48,737 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:48,834 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:48,849 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:49,331 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:49,345 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:49,420 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:49,439 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:50,909 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-24 05:49:51,108 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 12288 conjuctions. This might take some time... [2019-11-24 05:50:22,109 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-24 05:50:22,341 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 16384 conjuctions. This might take some time...