/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_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:50:03,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:50:03,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:50:03,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:50:03,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:50:03,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:50:03,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:50:03,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:50:03,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:50:03,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:50:03,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:50:03,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:50:03,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:50:03,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:50:03,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:50:03,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:50:03,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:50:03,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:50:03,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:50:03,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:50:03,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:50:03,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:50:03,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:50:03,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:50:03,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:50:03,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:50:03,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:50:03,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:50:04,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:50:04,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:50:04,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:50:04,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:50:04,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:50:04,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:50:04,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:50:04,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:50:04,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:50:04,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:50:04,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:50:04,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:50:04,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:50:04,009 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:50:04,045 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:50:04,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:50:04,047 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:50:04,047 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:50:04,047 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:50:04,047 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:50:04,047 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:50:04,048 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:50:04,048 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:50:04,048 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:50:04,048 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:50:04,048 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:50:04,049 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:50:04,049 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:50:04,049 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:50:04,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:50:04,050 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:50:04,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:50:04,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:50:04,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:50:04,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:50:04,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:50:04,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:50:04,051 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:50:04,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:50:04,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:50:04,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:50:04,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:50:04,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:50:04,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:50:04,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:50:04,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:50:04,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:50:04,053 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:50:04,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:50:04,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:50:04,054 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:50:04,054 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:50:04,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:50:04,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:50:04,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:50:04,360 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:50:04,360 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:50:04,361 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-24 05:50:04,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b44e36436/afda7eaa0c1f455f8ff0a7070a3e801c/FLAG68600546f [2019-11-24 05:50:04,951 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:50:04,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-24 05:50:04,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b44e36436/afda7eaa0c1f455f8ff0a7070a3e801c/FLAG68600546f [2019-11-24 05:50:05,280 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b44e36436/afda7eaa0c1f455f8ff0a7070a3e801c [2019-11-24 05:50:05,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:50:05,295 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:50:05,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:50:05,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:50:05,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:50:05,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:50:05" (1/1) ... [2019-11-24 05:50:05,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6886fec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:50:05, skipping insertion in model container [2019-11-24 05:50:05,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:50:05" (1/1) ... [2019-11-24 05:50:05,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:50:05,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:50:05,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:50:05,754 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:50:05,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:50:05,840 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:50:05,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:50:05 WrapperNode [2019-11-24 05:50:05,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:50:05,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:50:05,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:50:05,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:50:05,851 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:50:05" (1/1) ... [2019-11-24 05:50:05,864 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:50:05" (1/1) ... [2019-11-24 05:50:05,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:50:05,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:50:05,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:50:05,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:50:05,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:50:05" (1/1) ... [2019-11-24 05:50:05,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:50:05" (1/1) ... [2019-11-24 05:50:05,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:50:05" (1/1) ... [2019-11-24 05:50:05,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:50:05" (1/1) ... [2019-11-24 05:50:06,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:50:05" (1/1) ... [2019-11-24 05:50:06,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:50:05" (1/1) ... [2019-11-24 05:50:06,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:50:05" (1/1) ... [2019-11-24 05:50:06,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:50:06,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:50:06,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:50:06,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:50:06,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:50:05" (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:50:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:50:06,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:50:08,868 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:50:08,869 INFO L284 CfgBuilder]: Removed 173 assume(true) statements. [2019-11-24 05:50:08,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:50:08 BoogieIcfgContainer [2019-11-24 05:50:08,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:50:08,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:50:08,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:50:08,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:50:08,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:50:05" (1/3) ... [2019-11-24 05:50:08,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbe4091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:50:08, skipping insertion in model container [2019-11-24 05:50:08,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:50:05" (2/3) ... [2019-11-24 05:50:08,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbe4091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:50:08, skipping insertion in model container [2019-11-24 05:50:08,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:50:08" (3/3) ... [2019-11-24 05:50:08,883 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-24 05:50:08,897 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:50:08,908 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-11-24 05:50:08,920 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-11-24 05:50:08,973 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:50:08,973 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:50:08,974 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:50:08,974 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:50:08,974 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:50:08,975 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:50:08,975 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:50:08,975 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:50:09,023 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states. [2019-11-24 05:50:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 05:50:09,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:09,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:09,034 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:09,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:09,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1942898753, now seen corresponding path program 1 times [2019-11-24 05:50:09,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:09,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838771418] [2019-11-24 05:50:09,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:50:09,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838771418] [2019-11-24 05:50:09,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:09,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:09,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456106997] [2019-11-24 05:50:09,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:09,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:09,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:09,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:09,329 INFO L87 Difference]: Start difference. First operand 333 states. Second operand 3 states. [2019-11-24 05:50:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:09,586 INFO L93 Difference]: Finished difference Result 821 states and 1255 transitions. [2019-11-24 05:50:09,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:09,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-24 05:50:09,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:09,614 INFO L225 Difference]: With dead ends: 821 [2019-11-24 05:50:09,614 INFO L226 Difference]: Without dead ends: 489 [2019-11-24 05:50:09,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-11-24 05:50:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 296. [2019-11-24 05:50:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-24 05:50:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 417 transitions. [2019-11-24 05:50:09,684 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 417 transitions. Word has length 8 [2019-11-24 05:50:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:09,684 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 417 transitions. [2019-11-24 05:50:09,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 417 transitions. [2019-11-24 05:50:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 05:50:09,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:09,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:09,686 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1690635635, now seen corresponding path program 1 times [2019-11-24 05:50:09,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:09,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150594724] [2019-11-24 05:50:09,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:50:09,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150594724] [2019-11-24 05:50:09,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:09,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:50:09,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379857522] [2019-11-24 05:50:09,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:09,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:09,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:09,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:09,747 INFO L87 Difference]: Start difference. First operand 296 states and 417 transitions. Second operand 3 states. [2019-11-24 05:50:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:09,812 INFO L93 Difference]: Finished difference Result 729 states and 1020 transitions. [2019-11-24 05:50:09,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:09,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 05:50:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:09,815 INFO L225 Difference]: With dead ends: 729 [2019-11-24 05:50:09,815 INFO L226 Difference]: Without dead ends: 434 [2019-11-24 05:50:09,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-11-24 05:50:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 277. [2019-11-24 05:50:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-24 05:50:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 387 transitions. [2019-11-24 05:50:09,855 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 387 transitions. Word has length 9 [2019-11-24 05:50:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:09,855 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 387 transitions. [2019-11-24 05:50:09,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 387 transitions. [2019-11-24 05:50:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 05:50:09,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:09,857 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:09,857 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1432511211, now seen corresponding path program 1 times [2019-11-24 05:50:09,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:09,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679346593] [2019-11-24 05:50:09,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:50:09,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679346593] [2019-11-24 05:50:09,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:09,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:50:09,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596865593] [2019-11-24 05:50:09,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:09,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:09,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:09,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:09,913 INFO L87 Difference]: Start difference. First operand 277 states and 387 transitions. Second operand 3 states. [2019-11-24 05:50:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:09,977 INFO L93 Difference]: Finished difference Result 817 states and 1142 transitions. [2019-11-24 05:50:09,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:09,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-24 05:50:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:09,984 INFO L225 Difference]: With dead ends: 817 [2019-11-24 05:50:09,984 INFO L226 Difference]: Without dead ends: 547 [2019-11-24 05:50:09,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-11-24 05:50:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 281. [2019-11-24 05:50:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-24 05:50:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 391 transitions. [2019-11-24 05:50:10,006 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 391 transitions. Word has length 11 [2019-11-24 05:50:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:10,006 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 391 transitions. [2019-11-24 05:50:10,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 391 transitions. [2019-11-24 05:50:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:50:10,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:10,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:10,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:10,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1340659183, now seen corresponding path program 1 times [2019-11-24 05:50:10,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:10,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409055440] [2019-11-24 05:50:10,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:50:10,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409055440] [2019-11-24 05:50:10,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:10,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:10,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878338908] [2019-11-24 05:50:10,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:10,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:10,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:10,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:10,049 INFO L87 Difference]: Start difference. First operand 281 states and 391 transitions. Second operand 3 states. [2019-11-24 05:50:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:10,065 INFO L93 Difference]: Finished difference Result 433 states and 597 transitions. [2019-11-24 05:50:10,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:10,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 05:50:10,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:10,067 INFO L225 Difference]: With dead ends: 433 [2019-11-24 05:50:10,067 INFO L226 Difference]: Without dead ends: 281 [2019-11-24 05:50:10,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-24 05:50:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2019-11-24 05:50:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-24 05:50:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 388 transitions. [2019-11-24 05:50:10,078 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 388 transitions. Word has length 15 [2019-11-24 05:50:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:10,078 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 388 transitions. [2019-11-24 05:50:10,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 388 transitions. [2019-11-24 05:50:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 05:50:10,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:10,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:10,080 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:10,081 INFO L82 PathProgramCache]: Analyzing trace with hash 565061684, now seen corresponding path program 1 times [2019-11-24 05:50:10,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:10,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962251061] [2019-11-24 05:50:10,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:50:10,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962251061] [2019-11-24 05:50:10,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:10,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:50:10,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748766365] [2019-11-24 05:50:10,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:50:10,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:10,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:50:10,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:50:10,182 INFO L87 Difference]: Start difference. First operand 281 states and 388 transitions. Second operand 4 states. [2019-11-24 05:50:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:10,291 INFO L93 Difference]: Finished difference Result 711 states and 977 transitions. [2019-11-24 05:50:10,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:50:10,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 05:50:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:10,296 INFO L225 Difference]: With dead ends: 711 [2019-11-24 05:50:10,296 INFO L226 Difference]: Without dead ends: 438 [2019-11-24 05:50:10,297 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:50:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-24 05:50:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 281. [2019-11-24 05:50:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-24 05:50:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 387 transitions. [2019-11-24 05:50:10,338 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 387 transitions. Word has length 16 [2019-11-24 05:50:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:10,338 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 387 transitions. [2019-11-24 05:50:10,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:50:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 387 transitions. [2019-11-24 05:50:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:50:10,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:10,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:10,341 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1997031187, now seen corresponding path program 1 times [2019-11-24 05:50:10,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:10,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001621836] [2019-11-24 05:50:10,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 05:50:10,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001621836] [2019-11-24 05:50:10,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:10,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:10,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643294396] [2019-11-24 05:50:10,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:10,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:10,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:10,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:10,406 INFO L87 Difference]: Start difference. First operand 281 states and 387 transitions. Second operand 3 states. [2019-11-24 05:50:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:10,511 INFO L93 Difference]: Finished difference Result 692 states and 960 transitions. [2019-11-24 05:50:10,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:10,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 05:50:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:10,514 INFO L225 Difference]: With dead ends: 692 [2019-11-24 05:50:10,515 INFO L226 Difference]: Without dead ends: 422 [2019-11-24 05:50:10,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-11-24 05:50:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 256. [2019-11-24 05:50:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-24 05:50:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 347 transitions. [2019-11-24 05:50:10,524 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 347 transitions. Word has length 18 [2019-11-24 05:50:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:10,525 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 347 transitions. [2019-11-24 05:50:10,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 347 transitions. [2019-11-24 05:50:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:50:10,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:10,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:10,526 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash -54435551, now seen corresponding path program 1 times [2019-11-24 05:50:10,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:10,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418283738] [2019-11-24 05:50:10,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 05:50:10,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418283738] [2019-11-24 05:50:10,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:10,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:10,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615490219] [2019-11-24 05:50:10,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:10,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:10,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:10,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:10,569 INFO L87 Difference]: Start difference. First operand 256 states and 347 transitions. Second operand 3 states. [2019-11-24 05:50:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:10,616 INFO L93 Difference]: Finished difference Result 630 states and 855 transitions. [2019-11-24 05:50:10,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:10,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 05:50:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:10,619 INFO L225 Difference]: With dead ends: 630 [2019-11-24 05:50:10,619 INFO L226 Difference]: Without dead ends: 385 [2019-11-24 05:50:10,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-24 05:50:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 240. [2019-11-24 05:50:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-24 05:50:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 321 transitions. [2019-11-24 05:50:10,628 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 321 transitions. Word has length 18 [2019-11-24 05:50:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:10,629 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 321 transitions. [2019-11-24 05:50:10,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 321 transitions. [2019-11-24 05:50:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 05:50:10,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:10,630 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] [2019-11-24 05:50:10,631 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:10,631 INFO L82 PathProgramCache]: Analyzing trace with hash -140817968, now seen corresponding path program 1 times [2019-11-24 05:50:10,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:10,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004856776] [2019-11-24 05:50:10,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 05:50:10,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004856776] [2019-11-24 05:50:10,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:10,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:50:10,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125722332] [2019-11-24 05:50:10,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:50:10,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:10,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:50:10,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:50:10,680 INFO L87 Difference]: Start difference. First operand 240 states and 321 transitions. Second operand 4 states. [2019-11-24 05:50:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:10,737 INFO L93 Difference]: Finished difference Result 606 states and 813 transitions. [2019-11-24 05:50:10,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:50:10,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-24 05:50:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:10,741 INFO L225 Difference]: With dead ends: 606 [2019-11-24 05:50:10,741 INFO L226 Difference]: Without dead ends: 385 [2019-11-24 05:50:10,742 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:50:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-24 05:50:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 240. [2019-11-24 05:50:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-24 05:50:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 320 transitions. [2019-11-24 05:50:10,751 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 320 transitions. Word has length 27 [2019-11-24 05:50:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:10,752 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 320 transitions. [2019-11-24 05:50:10,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:50:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 320 transitions. [2019-11-24 05:50:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 05:50:10,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:10,753 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:50:10,754 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:10,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1596084722, now seen corresponding path program 1 times [2019-11-24 05:50:10,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:10,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127314480] [2019-11-24 05:50:10,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:50:10,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127314480] [2019-11-24 05:50:10,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:10,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:10,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550633447] [2019-11-24 05:50:10,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:10,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:10,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:10,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:10,822 INFO L87 Difference]: Start difference. First operand 240 states and 320 transitions. Second operand 3 states. [2019-11-24 05:50:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:10,861 INFO L93 Difference]: Finished difference Result 584 states and 787 transitions. [2019-11-24 05:50:10,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:10,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-24 05:50:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:10,864 INFO L225 Difference]: With dead ends: 584 [2019-11-24 05:50:10,864 INFO L226 Difference]: Without dead ends: 366 [2019-11-24 05:50:10,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-24 05:50:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 223. [2019-11-24 05:50:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-24 05:50:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 294 transitions. [2019-11-24 05:50:10,873 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 294 transitions. Word has length 29 [2019-11-24 05:50:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:10,873 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 294 transitions. [2019-11-24 05:50:10,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 294 transitions. [2019-11-24 05:50:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 05:50:10,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:10,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:10,875 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:10,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:10,876 INFO L82 PathProgramCache]: Analyzing trace with hash 179104351, now seen corresponding path program 1 times [2019-11-24 05:50:10,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:10,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221245602] [2019-11-24 05:50:10,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:50:10,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221245602] [2019-11-24 05:50:10,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:10,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:10,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359483934] [2019-11-24 05:50:10,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:10,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:10,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:10,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:10,931 INFO L87 Difference]: Start difference. First operand 223 states and 294 transitions. Second operand 3 states. [2019-11-24 05:50:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:11,014 INFO L93 Difference]: Finished difference Result 499 states and 667 transitions. [2019-11-24 05:50:11,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:11,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-24 05:50:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:11,021 INFO L225 Difference]: With dead ends: 499 [2019-11-24 05:50:11,021 INFO L226 Difference]: Without dead ends: 298 [2019-11-24 05:50:11,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-24 05:50:11,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 207. [2019-11-24 05:50:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-24 05:50:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 266 transitions. [2019-11-24 05:50:11,033 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 266 transitions. Word has length 30 [2019-11-24 05:50:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:11,034 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 266 transitions. [2019-11-24 05:50:11,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 266 transitions. [2019-11-24 05:50:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 05:50:11,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:11,037 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:50:11,037 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:11,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash 542399705, now seen corresponding path program 1 times [2019-11-24 05:50:11,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:11,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861955773] [2019-11-24 05:50:11,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:50:11,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861955773] [2019-11-24 05:50:11,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:11,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:50:11,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44534545] [2019-11-24 05:50:11,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:50:11,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:11,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:50:11,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:50:11,090 INFO L87 Difference]: Start difference. First operand 207 states and 266 transitions. Second operand 4 states. [2019-11-24 05:50:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:11,130 INFO L93 Difference]: Finished difference Result 517 states and 673 transitions. [2019-11-24 05:50:11,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:50:11,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-24 05:50:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:11,133 INFO L225 Difference]: With dead ends: 517 [2019-11-24 05:50:11,134 INFO L226 Difference]: Without dead ends: 342 [2019-11-24 05:50:11,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:50:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-11-24 05:50:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 207. [2019-11-24 05:50:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-24 05:50:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 265 transitions. [2019-11-24 05:50:11,143 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 265 transitions. Word has length 40 [2019-11-24 05:50:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:11,144 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 265 transitions. [2019-11-24 05:50:11,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:50:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 265 transitions. [2019-11-24 05:50:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 05:50:11,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:11,146 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:11,146 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash 149186591, now seen corresponding path program 1 times [2019-11-24 05:50:11,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:11,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536675656] [2019-11-24 05:50:11,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:50:11,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536675656] [2019-11-24 05:50:11,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:11,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:11,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542241457] [2019-11-24 05:50:11,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:11,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:11,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:11,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,214 INFO L87 Difference]: Start difference. First operand 207 states and 265 transitions. Second operand 3 states. [2019-11-24 05:50:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:11,270 INFO L93 Difference]: Finished difference Result 421 states and 564 transitions. [2019-11-24 05:50:11,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:11,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 05:50:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:11,275 INFO L225 Difference]: With dead ends: 421 [2019-11-24 05:50:11,275 INFO L226 Difference]: Without dead ends: 249 [2019-11-24 05:50:11,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-24 05:50:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 167. [2019-11-24 05:50:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-24 05:50:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 215 transitions. [2019-11-24 05:50:11,288 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 215 transitions. Word has length 42 [2019-11-24 05:50:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:11,288 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 215 transitions. [2019-11-24 05:50:11,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 215 transitions. [2019-11-24 05:50:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 05:50:11,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:11,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:11,291 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1740967174, now seen corresponding path program 1 times [2019-11-24 05:50:11,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:11,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273004901] [2019-11-24 05:50:11,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:50:11,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273004901] [2019-11-24 05:50:11,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:11,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:11,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61585600] [2019-11-24 05:50:11,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:11,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:11,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,359 INFO L87 Difference]: Start difference. First operand 167 states and 215 transitions. Second operand 3 states. [2019-11-24 05:50:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:11,398 INFO L93 Difference]: Finished difference Result 275 states and 362 transitions. [2019-11-24 05:50:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:11,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-24 05:50:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:11,401 INFO L225 Difference]: With dead ends: 275 [2019-11-24 05:50:11,401 INFO L226 Difference]: Without dead ends: 143 [2019-11-24 05:50:11,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-24 05:50:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-11-24 05:50:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-24 05:50:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2019-11-24 05:50:11,410 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 47 [2019-11-24 05:50:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:11,410 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2019-11-24 05:50:11,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2019-11-24 05:50:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:50:11,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:11,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:11,485 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:11,486 INFO L82 PathProgramCache]: Analyzing trace with hash 845016213, now seen corresponding path program 1 times [2019-11-24 05:50:11,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:11,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065637894] [2019-11-24 05:50:11,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:50:11,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065637894] [2019-11-24 05:50:11,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:11,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:11,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121452866] [2019-11-24 05:50:11,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:11,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:11,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:11,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,557 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand 3 states. [2019-11-24 05:50:11,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:11,600 INFO L93 Difference]: Finished difference Result 313 states and 406 transitions. [2019-11-24 05:50:11,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:11,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-24 05:50:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:11,604 INFO L225 Difference]: With dead ends: 313 [2019-11-24 05:50:11,604 INFO L226 Difference]: Without dead ends: 216 [2019-11-24 05:50:11,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-24 05:50:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 138. [2019-11-24 05:50:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-24 05:50:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 173 transitions. [2019-11-24 05:50:11,615 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 173 transitions. Word has length 50 [2019-11-24 05:50:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:11,617 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 173 transitions. [2019-11-24 05:50:11,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 173 transitions. [2019-11-24 05:50:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:50:11,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:11,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:11,619 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash -128059535, now seen corresponding path program 1 times [2019-11-24 05:50:11,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:11,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949516575] [2019-11-24 05:50:11,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:50:11,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949516575] [2019-11-24 05:50:11,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:11,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:11,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478275179] [2019-11-24 05:50:11,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:11,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:11,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:11,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,697 INFO L87 Difference]: Start difference. First operand 138 states and 173 transitions. Second operand 3 states. [2019-11-24 05:50:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:11,735 INFO L93 Difference]: Finished difference Result 303 states and 391 transitions. [2019-11-24 05:50:11,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:11,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-24 05:50:11,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:11,738 INFO L225 Difference]: With dead ends: 303 [2019-11-24 05:50:11,738 INFO L226 Difference]: Without dead ends: 211 [2019-11-24 05:50:11,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-24 05:50:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 134. [2019-11-24 05:50:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-24 05:50:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2019-11-24 05:50:11,751 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 52 [2019-11-24 05:50:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:11,752 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2019-11-24 05:50:11,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2019-11-24 05:50:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:50:11,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:11,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:11,753 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:11,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash 586946759, now seen corresponding path program 1 times [2019-11-24 05:50:11,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:11,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354345407] [2019-11-24 05:50:11,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:50:11,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354345407] [2019-11-24 05:50:11,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:11,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:11,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218771841] [2019-11-24 05:50:11,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:11,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:11,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:11,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,840 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand 3 states. [2019-11-24 05:50:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:11,864 INFO L93 Difference]: Finished difference Result 220 states and 279 transitions. [2019-11-24 05:50:11,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:11,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-24 05:50:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:11,866 INFO L225 Difference]: With dead ends: 220 [2019-11-24 05:50:11,866 INFO L226 Difference]: Without dead ends: 132 [2019-11-24 05:50:11,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-24 05:50:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-11-24 05:50:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-24 05:50:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2019-11-24 05:50:11,876 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 55 [2019-11-24 05:50:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:11,877 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2019-11-24 05:50:11,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:11,877 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2019-11-24 05:50:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-24 05:50:11,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:11,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:11,879 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:11,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1037403053, now seen corresponding path program 1 times [2019-11-24 05:50:11,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:11,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524229495] [2019-11-24 05:50:11,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:50:11,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524229495] [2019-11-24 05:50:11,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:11,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:50:11,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759605471] [2019-11-24 05:50:11,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:50:11,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:11,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:50:11,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,962 INFO L87 Difference]: Start difference. First operand 131 states and 160 transitions. Second operand 3 states. [2019-11-24 05:50:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:11,971 INFO L93 Difference]: Finished difference Result 233 states and 292 transitions. [2019-11-24 05:50:11,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:50:11,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-24 05:50:11,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:11,973 INFO L225 Difference]: With dead ends: 233 [2019-11-24 05:50:11,973 INFO L226 Difference]: Without dead ends: 148 [2019-11-24 05:50:11,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:50:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-24 05:50:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 128. [2019-11-24 05:50:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-24 05:50:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2019-11-24 05:50:11,981 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 59 [2019-11-24 05:50:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:11,981 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2019-11-24 05:50:11,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:50:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2019-11-24 05:50:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 05:50:11,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:11,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:11,982 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:11,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1109283371, now seen corresponding path program 1 times [2019-11-24 05:50:11,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:11,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323622988] [2019-11-24 05:50:11,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:50:12,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323622988] [2019-11-24 05:50:12,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:12,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:50:12,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730627140] [2019-11-24 05:50:12,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:50:12,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:12,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:50:12,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:50:12,048 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand 4 states. [2019-11-24 05:50:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:12,088 INFO L93 Difference]: Finished difference Result 212 states and 263 transitions. [2019-11-24 05:50:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:50:12,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-24 05:50:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:12,089 INFO L225 Difference]: With dead ends: 212 [2019-11-24 05:50:12,089 INFO L226 Difference]: Without dead ends: 128 [2019-11-24 05:50:12,090 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:50:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-24 05:50:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-11-24 05:50:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-24 05:50:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2019-11-24 05:50:12,097 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 62 [2019-11-24 05:50:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:12,097 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2019-11-24 05:50:12,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:50:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2019-11-24 05:50:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 05:50:12,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:12,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:12,098 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:12,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:12,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1320441434, now seen corresponding path program 1 times [2019-11-24 05:50:12,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:12,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432912476] [2019-11-24 05:50:12,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 05:50:12,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432912476] [2019-11-24 05:50:12,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:12,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:50:12,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171422543] [2019-11-24 05:50:12,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:50:12,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:12,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:50:12,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:50:12,258 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand 4 states. [2019-11-24 05:50:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:12,366 INFO L93 Difference]: Finished difference Result 291 states and 356 transitions. [2019-11-24 05:50:12,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:50:12,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-24 05:50:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:12,369 INFO L225 Difference]: With dead ends: 291 [2019-11-24 05:50:12,369 INFO L226 Difference]: Without dead ends: 209 [2019-11-24 05:50:12,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:50:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-24 05:50:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 161. [2019-11-24 05:50:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-24 05:50:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2019-11-24 05:50:12,384 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 64 [2019-11-24 05:50:12,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:12,385 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2019-11-24 05:50:12,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:50:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2019-11-24 05:50:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 05:50:12,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:12,386 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:12,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:12,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1208534794, now seen corresponding path program 1 times [2019-11-24 05:50:12,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:12,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892928108] [2019-11-24 05:50:12,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 05:50:12,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892928108] [2019-11-24 05:50:12,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:50:12,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:50:12,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099028031] [2019-11-24 05:50:12,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:50:12,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:50:12,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:50:12,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:50:12,506 INFO L87 Difference]: Start difference. First operand 161 states and 191 transitions. Second operand 4 states. [2019-11-24 05:50:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:50:12,621 INFO L93 Difference]: Finished difference Result 270 states and 326 transitions. [2019-11-24 05:50:12,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:50:12,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-24 05:50:12,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:50:12,624 INFO L225 Difference]: With dead ends: 270 [2019-11-24 05:50:12,624 INFO L226 Difference]: Without dead ends: 268 [2019-11-24 05:50:12,625 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:50:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-24 05:50:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 163. [2019-11-24 05:50:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-24 05:50:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions. [2019-11-24 05:50:12,642 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 75 [2019-11-24 05:50:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:50:12,642 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 193 transitions. [2019-11-24 05:50:12,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:50:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2019-11-24 05:50:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-24 05:50:12,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:50:12,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:50:12,644 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:50:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:50:12,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1220807128, now seen corresponding path program 1 times [2019-11-24 05:50:12,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:50:12,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51244872] [2019-11-24 05:50:12,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:50:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:50:12,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51244872] [2019-11-24 05:50:12,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011259212] [2019-11-24 05:50:12,875 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:50:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:50:13,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 05:50:13,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:50:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:50:13,122 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:50:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:50:13,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1102714247] [2019-11-24 05:50:13,224 INFO L159 IcfgInterpreter]: Started Sifa with 73 locations of interest [2019-11-24 05:50:13,225 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:50:13,231 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:50:13,238 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:50:13,239 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:50:14,285 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 185 [2019-11-24 05:50:14,507 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2019-11-24 05:50:14,705 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2019-11-24 05:50:14,846 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2019-11-24 05:50:14,966 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2019-11-24 05:50:15,091 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2019-11-24 05:50:15,214 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2019-11-24 05:50:15,339 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2019-11-24 05:50:15,442 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2019-11-24 05:50:15,795 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 201 [2019-11-24 05:50:15,969 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 214 [2019-11-24 05:50:16,196 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 217 [2019-11-24 05:50:16,677 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 220 [2019-11-24 05:50:17,469 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 198 [2019-11-24 05:50:17,716 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2019-11-24 05:50:17,829 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2019-11-24 05:50:18,536 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 242 [2019-11-24 05:50:18,653 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 242 [2019-11-24 05:50:19,060 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2019-11-24 05:50:19,445 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 263 [2019-11-24 05:50:19,625 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 264 [2019-11-24 05:50:19,950 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2019-11-24 05:50:20,133 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2019-11-24 05:50:20,281 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2019-11-24 05:50:20,408 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2019-11-24 05:50:20,521 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2019-11-24 05:50:20,634 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2019-11-24 05:50:20,786 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2019-11-24 05:50:20,894 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2019-11-24 05:50:21,002 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2019-11-24 05:50:21,149 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 273 [2019-11-24 05:50:21,305 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 273 [2019-11-24 05:50:21,457 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 273 [2019-11-24 05:50:21,591 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 273 [2019-11-24 05:50:21,721 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 273 [2019-11-24 05:50:21,832 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 273 [2019-11-24 05:50:26,280 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 214032 conjuctions. This might take some time...