/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/product-lines/elevator_spec1_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:38:11,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:38:11,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:38:11,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:38:11,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:38:11,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:38:11,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:38:11,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:38:11,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:38:11,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:38:11,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:38:11,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:38:11,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:38:11,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:38:11,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:38:11,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:38:11,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:38:11,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:38:12,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:38:12,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:38:12,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:38:12,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:38:12,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:38:12,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:38:12,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:38:12,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:38:12,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:38:12,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:38:12,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:38:12,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:38:12,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:38:12,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:38:12,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:38:12,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:38:12,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:38:12,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:38:12,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:38:12,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:38:12,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:38:12,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:38:12,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:38:12,021 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 04:38:12,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:38:12,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:38:12,051 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:38:12,051 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:38:12,051 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:38:12,051 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:38:12,051 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:38:12,051 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:38:12,052 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:38:12,052 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:38:12,052 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:38:12,052 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:38:12,052 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:38:12,053 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:38:12,053 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:38:12,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:38:12,054 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:38:12,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:38:12,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:38:12,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:38:12,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:38:12,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:38:12,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:38:12,055 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:38:12,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:38:12,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:38:12,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:38:12,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:38:12,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:38:12,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:38:12,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:38:12,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:38:12,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:38:12,057 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:38:12,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:38:12,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:38:12,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:38:12,058 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:38:12,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:38:12,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:38:12,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:38:12,412 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:38:12,412 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:38:12,413 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product19.cil.c [2019-11-24 04:38:12,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/719a51073/a378d03b16f94dd6819cf9c6801e80a6/FLAG15996b251 [2019-11-24 04:38:13,074 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:38:13,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product19.cil.c [2019-11-24 04:38:13,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/719a51073/a378d03b16f94dd6819cf9c6801e80a6/FLAG15996b251 [2019-11-24 04:38:13,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/719a51073/a378d03b16f94dd6819cf9c6801e80a6 [2019-11-24 04:38:13,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:38:13,267 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:38:13,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:38:13,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:38:13,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:38:13,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:38:13" (1/1) ... [2019-11-24 04:38:13,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79462fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:13, skipping insertion in model container [2019-11-24 04:38:13,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:38:13" (1/1) ... [2019-11-24 04:38:13,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:38:13,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:38:14,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:38:14,072 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:38:14,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:38:14,295 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:38:14,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14 WrapperNode [2019-11-24 04:38:14,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:38:14,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:38:14,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:38:14,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:38:14,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14" (1/1) ... [2019-11-24 04:38:14,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14" (1/1) ... [2019-11-24 04:38:14,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:38:14,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:38:14,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:38:14,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:38:14,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14" (1/1) ... [2019-11-24 04:38:14,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14" (1/1) ... [2019-11-24 04:38:14,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14" (1/1) ... [2019-11-24 04:38:14,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14" (1/1) ... [2019-11-24 04:38:14,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14" (1/1) ... [2019-11-24 04:38:14,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14" (1/1) ... [2019-11-24 04:38:14,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14" (1/1) ... [2019-11-24 04:38:14,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:38:14,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:38:14,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:38:14,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:38:14,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14" (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 04:38:14,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:38:14,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:38:14,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:38:14,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:38:44,891 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:38:44,891 INFO L284 CfgBuilder]: Removed 601 assume(true) statements. [2019-11-24 04:38:44,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:38:44 BoogieIcfgContainer [2019-11-24 04:38:44,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:38:44,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:38:44,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:38:44,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:38:44,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:38:13" (1/3) ... [2019-11-24 04:38:44,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c10347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:38:44, skipping insertion in model container [2019-11-24 04:38:44,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14" (2/3) ... [2019-11-24 04:38:44,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c10347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:38:44, skipping insertion in model container [2019-11-24 04:38:44,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:38:44" (3/3) ... [2019-11-24 04:38:44,901 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product19.cil.c [2019-11-24 04:38:44,910 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:38:44,917 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:38:44,928 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:38:44,957 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:38:44,957 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:38:44,957 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:38:44,957 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:38:44,958 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:38:44,958 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:38:44,958 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:38:44,958 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:38:44,989 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-11-24 04:38:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:38:45,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:45,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:45,003 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:45,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1752923635, now seen corresponding path program 1 times [2019-11-24 04:38:45,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:45,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311890306] [2019-11-24 04:38:45,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:45,451 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 04:38:45,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311890306] [2019-11-24 04:38:45,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:45,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:38:45,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387847788] [2019-11-24 04:38:45,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:38:45,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:45,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:38:45,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:38:45,476 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 2 states. [2019-11-24 04:38:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:45,559 INFO L93 Difference]: Finished difference Result 766 states and 1459 transitions. [2019-11-24 04:38:45,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:38:45,563 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-24 04:38:45,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:45,586 INFO L225 Difference]: With dead ends: 766 [2019-11-24 04:38:45,586 INFO L226 Difference]: Without dead ends: 747 [2019-11-24 04:38:45,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:38:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-24 04:38:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-11-24 04:38:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-24 04:38:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1429 transitions. [2019-11-24 04:38:45,698 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1429 transitions. Word has length 14 [2019-11-24 04:38:45,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:45,698 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1429 transitions. [2019-11-24 04:38:45,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:38:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1429 transitions. [2019-11-24 04:38:45,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:38:45,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:45,703 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:45,704 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:45,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:45,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1480478827, now seen corresponding path program 1 times [2019-11-24 04:38:45,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:45,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406271065] [2019-11-24 04:38:45,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:45,875 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 04:38:45,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406271065] [2019-11-24 04:38:45,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:45,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:38:45,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846238481] [2019-11-24 04:38:45,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:38:45,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:45,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:38:45,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:45,879 INFO L87 Difference]: Start difference. First operand 747 states and 1429 transitions. Second operand 5 states. [2019-11-24 04:38:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:46,370 INFO L93 Difference]: Finished difference Result 1613 states and 3033 transitions. [2019-11-24 04:38:46,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:38:46,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 04:38:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:46,381 INFO L225 Difference]: With dead ends: 1613 [2019-11-24 04:38:46,381 INFO L226 Difference]: Without dead ends: 1230 [2019-11-24 04:38:46,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:38:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-11-24 04:38:46,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 755. [2019-11-24 04:38:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-24 04:38:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1441 transitions. [2019-11-24 04:38:46,423 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1441 transitions. Word has length 15 [2019-11-24 04:38:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:46,423 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1441 transitions. [2019-11-24 04:38:46,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:38:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1441 transitions. [2019-11-24 04:38:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:38:46,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:46,428 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:46,428 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:46,434 INFO L82 PathProgramCache]: Analyzing trace with hash 990443119, now seen corresponding path program 1 times [2019-11-24 04:38:46,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:46,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513889028] [2019-11-24 04:38:46,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:46,595 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 04:38:46,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513889028] [2019-11-24 04:38:46,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:46,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:38:46,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073770443] [2019-11-24 04:38:46,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:38:46,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:46,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:38:46,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:46,599 INFO L87 Difference]: Start difference. First operand 755 states and 1441 transitions. Second operand 5 states. [2019-11-24 04:38:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:47,006 INFO L93 Difference]: Finished difference Result 1605 states and 3013 transitions. [2019-11-24 04:38:47,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:38:47,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-24 04:38:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:47,014 INFO L225 Difference]: With dead ends: 1605 [2019-11-24 04:38:47,014 INFO L226 Difference]: Without dead ends: 1218 [2019-11-24 04:38:47,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:38:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-11-24 04:38:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 761. [2019-11-24 04:38:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-24 04:38:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1451 transitions. [2019-11-24 04:38:47,047 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1451 transitions. Word has length 16 [2019-11-24 04:38:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:47,047 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1451 transitions. [2019-11-24 04:38:47,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:38:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1451 transitions. [2019-11-24 04:38:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:38:47,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:47,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:47,049 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:47,050 INFO L82 PathProgramCache]: Analyzing trace with hash -53528427, now seen corresponding path program 1 times [2019-11-24 04:38:47,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:47,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295147357] [2019-11-24 04:38:47,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:47,145 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 04:38:47,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295147357] [2019-11-24 04:38:47,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:47,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:38:47,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008665] [2019-11-24 04:38:47,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:38:47,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:47,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:38:47,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:47,148 INFO L87 Difference]: Start difference. First operand 761 states and 1451 transitions. Second operand 5 states. [2019-11-24 04:38:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:47,510 INFO L93 Difference]: Finished difference Result 1596 states and 2992 transitions. [2019-11-24 04:38:47,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:38:47,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:38:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:47,519 INFO L225 Difference]: With dead ends: 1596 [2019-11-24 04:38:47,519 INFO L226 Difference]: Without dead ends: 1206 [2019-11-24 04:38:47,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:38:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2019-11-24 04:38:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 767. [2019-11-24 04:38:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-24 04:38:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1461 transitions. [2019-11-24 04:38:47,553 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1461 transitions. Word has length 17 [2019-11-24 04:38:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:47,553 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1461 transitions. [2019-11-24 04:38:47,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:38:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1461 transitions. [2019-11-24 04:38:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:38:47,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:47,555 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:47,555 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:47,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:47,556 INFO L82 PathProgramCache]: Analyzing trace with hash -507543529, now seen corresponding path program 1 times [2019-11-24 04:38:47,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:47,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249199970] [2019-11-24 04:38:47,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:47,686 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 04:38:47,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249199970] [2019-11-24 04:38:47,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:47,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:38:47,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052927436] [2019-11-24 04:38:47,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:38:47,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:47,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:38:47,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:47,689 INFO L87 Difference]: Start difference. First operand 767 states and 1461 transitions. Second operand 5 states. [2019-11-24 04:38:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:49,857 INFO L93 Difference]: Finished difference Result 1551 states and 2941 transitions. [2019-11-24 04:38:49,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:38:49,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:38:49,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:49,864 INFO L225 Difference]: With dead ends: 1551 [2019-11-24 04:38:49,864 INFO L226 Difference]: Without dead ends: 1017 [2019-11-24 04:38:49,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:38:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-11-24 04:38:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 999. [2019-11-24 04:38:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-11-24 04:38:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1865 transitions. [2019-11-24 04:38:49,902 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1865 transitions. Word has length 17 [2019-11-24 04:38:49,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:49,902 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 1865 transitions. [2019-11-24 04:38:49,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:38:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1865 transitions. [2019-11-24 04:38:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:38:49,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:49,904 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 04:38:49,904 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:49,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:49,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1446037645, now seen corresponding path program 1 times [2019-11-24 04:38:49,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:49,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403261987] [2019-11-24 04:38:49,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:50,013 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 04:38:50,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403261987] [2019-11-24 04:38:50,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:50,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:38:50,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19671295] [2019-11-24 04:38:50,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:38:50,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:50,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:38:50,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:50,015 INFO L87 Difference]: Start difference. First operand 999 states and 1865 transitions. Second operand 5 states. [2019-11-24 04:38:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:50,185 INFO L93 Difference]: Finished difference Result 1697 states and 3164 transitions. [2019-11-24 04:38:50,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:38:50,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:38:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:50,194 INFO L225 Difference]: With dead ends: 1697 [2019-11-24 04:38:50,194 INFO L226 Difference]: Without dead ends: 1684 [2019-11-24 04:38:50,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:38:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-11-24 04:38:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1003. [2019-11-24 04:38:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2019-11-24 04:38:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1869 transitions. [2019-11-24 04:38:50,252 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1869 transitions. Word has length 18 [2019-11-24 04:38:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:50,252 INFO L462 AbstractCegarLoop]: Abstraction has 1003 states and 1869 transitions. [2019-11-24 04:38:50,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:38:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1869 transitions. [2019-11-24 04:38:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:38:50,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:50,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:50,254 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:50,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1502492172, now seen corresponding path program 1 times [2019-11-24 04:38:50,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:50,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142580298] [2019-11-24 04:38:50,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:50,353 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 04:38:50,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142580298] [2019-11-24 04:38:50,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:50,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:50,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573680980] [2019-11-24 04:38:50,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:50,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:50,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:50,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:50,355 INFO L87 Difference]: Start difference. First operand 1003 states and 1869 transitions. Second operand 3 states. [2019-11-24 04:38:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:50,421 INFO L93 Difference]: Finished difference Result 1016 states and 1881 transitions. [2019-11-24 04:38:50,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:38:50,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:38:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:50,428 INFO L225 Difference]: With dead ends: 1016 [2019-11-24 04:38:50,428 INFO L226 Difference]: Without dead ends: 1003 [2019-11-24 04:38:50,429 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 04:38:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-11-24 04:38:50,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2019-11-24 04:38:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2019-11-24 04:38:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1867 transitions. [2019-11-24 04:38:50,484 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1867 transitions. Word has length 19 [2019-11-24 04:38:50,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:50,485 INFO L462 AbstractCegarLoop]: Abstraction has 1003 states and 1867 transitions. [2019-11-24 04:38:50,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:38:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1867 transitions. [2019-11-24 04:38:50,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:38:50,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:50,487 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] [2019-11-24 04:38:50,487 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:50,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:50,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1071178765, now seen corresponding path program 1 times [2019-11-24 04:38:50,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:50,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72446974] [2019-11-24 04:38:50,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:50,997 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 04:38:50,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72446974] [2019-11-24 04:38:50,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:50,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:38:50,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290619583] [2019-11-24 04:38:50,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:38:50,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:50,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:38:50,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:38:51,000 INFO L87 Difference]: Start difference. First operand 1003 states and 1867 transitions. Second operand 7 states. [2019-11-24 04:38:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:51,987 INFO L93 Difference]: Finished difference Result 1744 states and 3222 transitions. [2019-11-24 04:38:51,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:38:51,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-24 04:38:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:51,995 INFO L225 Difference]: With dead ends: 1744 [2019-11-24 04:38:51,995 INFO L226 Difference]: Without dead ends: 1308 [2019-11-24 04:38:51,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:38:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-11-24 04:38:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1147. [2019-11-24 04:38:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-24 04:38:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 2131 transitions. [2019-11-24 04:38:52,056 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 2131 transitions. Word has length 20 [2019-11-24 04:38:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:52,057 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 2131 transitions. [2019-11-24 04:38:52,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:38:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 2131 transitions. [2019-11-24 04:38:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:38:52,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:52,058 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] [2019-11-24 04:38:52,058 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:52,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2017970958, now seen corresponding path program 1 times [2019-11-24 04:38:52,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:52,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747975014] [2019-11-24 04:38:52,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:52,144 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 04:38:52,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747975014] [2019-11-24 04:38:52,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:52,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:38:52,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307515016] [2019-11-24 04:38:52,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:38:52,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:52,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:38:52,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:52,146 INFO L87 Difference]: Start difference. First operand 1147 states and 2131 transitions. Second operand 5 states. [2019-11-24 04:38:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:52,437 INFO L93 Difference]: Finished difference Result 2401 states and 4380 transitions. [2019-11-24 04:38:52,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:38:52,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:38:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:52,447 INFO L225 Difference]: With dead ends: 2401 [2019-11-24 04:38:52,447 INFO L226 Difference]: Without dead ends: 1853 [2019-11-24 04:38:52,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:38:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-11-24 04:38:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1159. [2019-11-24 04:38:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-11-24 04:38:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2143 transitions. [2019-11-24 04:38:52,513 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2143 transitions. Word has length 23 [2019-11-24 04:38:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:52,513 INFO L462 AbstractCegarLoop]: Abstraction has 1159 states and 2143 transitions. [2019-11-24 04:38:52,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:38:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2143 transitions. [2019-11-24 04:38:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:38:52,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:52,515 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] [2019-11-24 04:38:52,516 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1229329972, now seen corresponding path program 1 times [2019-11-24 04:38:52,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:52,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728802326] [2019-11-24 04:38:52,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:52,646 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 04:38:52,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728802326] [2019-11-24 04:38:52,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:52,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:52,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451534764] [2019-11-24 04:38:52,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:38:52,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:52,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:38:52,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:38:52,648 INFO L87 Difference]: Start difference. First operand 1159 states and 2143 transitions. Second operand 4 states. [2019-11-24 04:38:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:53,150 INFO L93 Difference]: Finished difference Result 2167 states and 3959 transitions. [2019-11-24 04:38:53,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:38:53,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-24 04:38:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:53,159 INFO L225 Difference]: With dead ends: 2167 [2019-11-24 04:38:53,159 INFO L226 Difference]: Without dead ends: 1552 [2019-11-24 04:38:53,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:38:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-11-24 04:38:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1187. [2019-11-24 04:38:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2019-11-24 04:38:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2180 transitions. [2019-11-24 04:38:53,239 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2180 transitions. Word has length 28 [2019-11-24 04:38:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:53,239 INFO L462 AbstractCegarLoop]: Abstraction has 1187 states and 2180 transitions. [2019-11-24 04:38:53,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:38:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2180 transitions. [2019-11-24 04:38:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:38:53,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:53,241 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] [2019-11-24 04:38:53,241 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash -218667269, now seen corresponding path program 1 times [2019-11-24 04:38:53,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:53,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369287217] [2019-11-24 04:38:53,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:53,603 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-24 04:38:53,691 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 04:38:53,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369287217] [2019-11-24 04:38:53,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:53,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:38:53,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920554808] [2019-11-24 04:38:53,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:38:53,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:53,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:38:53,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:38:53,695 INFO L87 Difference]: Start difference. First operand 1187 states and 2180 transitions. Second operand 9 states. [2019-11-24 04:38:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:55,034 INFO L93 Difference]: Finished difference Result 1265 states and 2290 transitions. [2019-11-24 04:38:55,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:38:55,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-11-24 04:38:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:55,040 INFO L225 Difference]: With dead ends: 1265 [2019-11-24 04:38:55,041 INFO L226 Difference]: Without dead ends: 1252 [2019-11-24 04:38:55,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-11-24 04:38:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-11-24 04:38:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1187. [2019-11-24 04:38:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2019-11-24 04:38:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2179 transitions. [2019-11-24 04:38:55,112 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2179 transitions. Word has length 28 [2019-11-24 04:38:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:55,112 INFO L462 AbstractCegarLoop]: Abstraction has 1187 states and 2179 transitions. [2019-11-24 04:38:55,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:38:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2179 transitions. [2019-11-24 04:38:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:38:55,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:55,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:55,114 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:55,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:55,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1868530405, now seen corresponding path program 1 times [2019-11-24 04:38:55,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:55,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22679836] [2019-11-24 04:38:55,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:55,271 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 04:38:55,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22679836] [2019-11-24 04:38:55,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:55,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:55,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001968649] [2019-11-24 04:38:55,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:55,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:55,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:55,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:55,273 INFO L87 Difference]: Start difference. First operand 1187 states and 2179 transitions. Second operand 3 states. [2019-11-24 04:38:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:56,236 INFO L93 Difference]: Finished difference Result 2282 states and 4170 transitions. [2019-11-24 04:38:56,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:38:56,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 04:38:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:56,244 INFO L225 Difference]: With dead ends: 2282 [2019-11-24 04:38:56,244 INFO L226 Difference]: Without dead ends: 1405 [2019-11-24 04:38:56,246 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 04:38:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-11-24 04:38:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1127. [2019-11-24 04:38:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2019-11-24 04:38:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 2029 transitions. [2019-11-24 04:38:56,319 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 2029 transitions. Word has length 34 [2019-11-24 04:38:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:56,319 INFO L462 AbstractCegarLoop]: Abstraction has 1127 states and 2029 transitions. [2019-11-24 04:38:56,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:38:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 2029 transitions. [2019-11-24 04:38:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:38:56,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:56,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:56,322 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:56,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:56,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1679750170, now seen corresponding path program 1 times [2019-11-24 04:38:56,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:56,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954538495] [2019-11-24 04:38:56,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:56,475 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 04:38:56,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954538495] [2019-11-24 04:38:56,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:56,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:56,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835851427] [2019-11-24 04:38:56,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:56,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:56,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:56,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:56,477 INFO L87 Difference]: Start difference. First operand 1127 states and 2029 transitions. Second operand 3 states. [2019-11-24 04:38:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:57,362 INFO L93 Difference]: Finished difference Result 2152 states and 3865 transitions. [2019-11-24 04:38:57,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:38:57,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:38:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:57,369 INFO L225 Difference]: With dead ends: 2152 [2019-11-24 04:38:57,369 INFO L226 Difference]: Without dead ends: 1357 [2019-11-24 04:38:57,371 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 04:38:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-11-24 04:38:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1082. [2019-11-24 04:38:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-11-24 04:38:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1894 transitions. [2019-11-24 04:38:57,446 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1894 transitions. Word has length 35 [2019-11-24 04:38:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:57,446 INFO L462 AbstractCegarLoop]: Abstraction has 1082 states and 1894 transitions. [2019-11-24 04:38:57,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:38:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1894 transitions. [2019-11-24 04:38:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:38:57,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:57,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:38:57,448 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1163170421, now seen corresponding path program 1 times [2019-11-24 04:38:57,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:57,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138908991] [2019-11-24 04:38:57,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:57,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 04:38:57,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138908991] [2019-11-24 04:38:57,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:57,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:57,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920554412] [2019-11-24 04:38:57,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:57,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:57,744 INFO L87 Difference]: Start difference. First operand 1082 states and 1894 transitions. Second operand 3 states. [2019-11-24 04:38:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:58,553 INFO L93 Difference]: Finished difference Result 2047 states and 3585 transitions. [2019-11-24 04:38:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:38:58,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:38:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:58,559 INFO L225 Difference]: With dead ends: 2047 [2019-11-24 04:38:58,559 INFO L226 Difference]: Without dead ends: 1324 [2019-11-24 04:38:58,560 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 04:38:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2019-11-24 04:38:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1052. [2019-11-24 04:38:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-24 04:38:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1774 transitions. [2019-11-24 04:38:58,632 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1774 transitions. Word has length 37 [2019-11-24 04:38:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:58,632 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1774 transitions. [2019-11-24 04:38:58,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:38:58,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1774 transitions. [2019-11-24 04:38:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 04:38:58,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:58,634 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 04:38:58,634 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:58,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:58,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1202577087, now seen corresponding path program 1 times [2019-11-24 04:38:58,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:58,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924531801] [2019-11-24 04:38:58,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:58,816 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 04:38:58,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924531801] [2019-11-24 04:38:58,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:58,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:58,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29066931] [2019-11-24 04:38:58,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:58,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:58,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:58,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:58,818 INFO L87 Difference]: Start difference. First operand 1052 states and 1774 transitions. Second operand 3 states. [2019-11-24 04:38:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:38:59,505 INFO L93 Difference]: Finished difference Result 1967 states and 3330 transitions. [2019-11-24 04:38:59,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:38:59,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-24 04:38:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:38:59,511 INFO L225 Difference]: With dead ends: 1967 [2019-11-24 04:38:59,511 INFO L226 Difference]: Without dead ends: 1306 [2019-11-24 04:38:59,512 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 04:38:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-11-24 04:38:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1037. [2019-11-24 04:38:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-11-24 04:38:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1669 transitions. [2019-11-24 04:38:59,592 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1669 transitions. Word has length 40 [2019-11-24 04:38:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:38:59,592 INFO L462 AbstractCegarLoop]: Abstraction has 1037 states and 1669 transitions. [2019-11-24 04:38:59,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:38:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1669 transitions. [2019-11-24 04:38:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 04:38:59,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:38:59,594 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] [2019-11-24 04:38:59,594 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:38:59,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:38:59,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1516857993, now seen corresponding path program 1 times [2019-11-24 04:38:59,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:38:59,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499981971] [2019-11-24 04:38:59,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:38:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:38:59,787 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 04:38:59,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499981971] [2019-11-24 04:38:59,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:38:59,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:38:59,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518962118] [2019-11-24 04:38:59,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:38:59,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:38:59,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:38:59,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:38:59,794 INFO L87 Difference]: Start difference. First operand 1037 states and 1669 transitions. Second operand 3 states. [2019-11-24 04:39:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:00,501 INFO L93 Difference]: Finished difference Result 1662 states and 2661 transitions. [2019-11-24 04:39:00,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:00,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-24 04:39:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:00,506 INFO L225 Difference]: With dead ends: 1662 [2019-11-24 04:39:00,506 INFO L226 Difference]: Without dead ends: 1053 [2019-11-24 04:39:00,507 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 04:39:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-11-24 04:39:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1037. [2019-11-24 04:39:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-11-24 04:39:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1579 transitions. [2019-11-24 04:39:00,581 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1579 transitions. Word has length 44 [2019-11-24 04:39:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:00,582 INFO L462 AbstractCegarLoop]: Abstraction has 1037 states and 1579 transitions. [2019-11-24 04:39:00,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1579 transitions. [2019-11-24 04:39:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:39:00,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:00,584 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:00,584 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:00,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:00,584 INFO L82 PathProgramCache]: Analyzing trace with hash 461470150, now seen corresponding path program 1 times [2019-11-24 04:39:00,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:00,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655507019] [2019-11-24 04:39:00,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:00,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655507019] [2019-11-24 04:39:00,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:00,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:39:00,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936678455] [2019-11-24 04:39:00,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:39:00,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:00,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:39:00,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:00,701 INFO L87 Difference]: Start difference. First operand 1037 states and 1579 transitions. Second operand 7 states. [2019-11-24 04:39:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:01,661 INFO L93 Difference]: Finished difference Result 1642 states and 2542 transitions. [2019-11-24 04:39:01,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:39:01,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-24 04:39:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:01,666 INFO L225 Difference]: With dead ends: 1642 [2019-11-24 04:39:01,666 INFO L226 Difference]: Without dead ends: 1098 [2019-11-24 04:39:01,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-24 04:39:01,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-11-24 04:39:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1019. [2019-11-24 04:39:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-11-24 04:39:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1516 transitions. [2019-11-24 04:39:01,754 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1516 transitions. Word has length 47 [2019-11-24 04:39:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:01,754 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1516 transitions. [2019-11-24 04:39:01,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:39:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1516 transitions. [2019-11-24 04:39:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:39:01,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:01,756 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:01,756 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:01,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1190649676, now seen corresponding path program 1 times [2019-11-24 04:39:01,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:01,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82047893] [2019-11-24 04:39:01,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:01,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82047893] [2019-11-24 04:39:01,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:01,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:39:01,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682095318] [2019-11-24 04:39:01,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:39:01,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:01,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:39:01,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:01,860 INFO L87 Difference]: Start difference. First operand 1019 states and 1516 transitions. Second operand 7 states. [2019-11-24 04:39:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:03,121 INFO L93 Difference]: Finished difference Result 2113 states and 3201 transitions. [2019-11-24 04:39:03,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 04:39:03,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-24 04:39:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:03,128 INFO L225 Difference]: With dead ends: 2113 [2019-11-24 04:39:03,128 INFO L226 Difference]: Without dead ends: 1532 [2019-11-24 04:39:03,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-24 04:39:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-11-24 04:39:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1242. [2019-11-24 04:39:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2019-11-24 04:39:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1825 transitions. [2019-11-24 04:39:03,210 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1825 transitions. Word has length 47 [2019-11-24 04:39:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:03,210 INFO L462 AbstractCegarLoop]: Abstraction has 1242 states and 1825 transitions. [2019-11-24 04:39:03,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:39:03,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1825 transitions. [2019-11-24 04:39:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:39:03,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:03,212 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] [2019-11-24 04:39:03,212 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:03,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:03,213 INFO L82 PathProgramCache]: Analyzing trace with hash -467790020, now seen corresponding path program 1 times [2019-11-24 04:39:03,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:03,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547187716] [2019-11-24 04:39:03,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:03,404 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 04:39:03,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547187716] [2019-11-24 04:39:03,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:03,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:03,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702281611] [2019-11-24 04:39:03,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:03,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:03,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:03,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:03,406 INFO L87 Difference]: Start difference. First operand 1242 states and 1825 transitions. Second operand 5 states. [2019-11-24 04:39:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:04,439 INFO L93 Difference]: Finished difference Result 2475 states and 3699 transitions. [2019-11-24 04:39:04,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:39:04,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-24 04:39:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:04,444 INFO L225 Difference]: With dead ends: 2475 [2019-11-24 04:39:04,444 INFO L226 Difference]: Without dead ends: 1504 [2019-11-24 04:39:04,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:39:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2019-11-24 04:39:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 976. [2019-11-24 04:39:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-24 04:39:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1451 transitions. [2019-11-24 04:39:04,525 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1451 transitions. Word has length 48 [2019-11-24 04:39:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:04,525 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1451 transitions. [2019-11-24 04:39:04,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1451 transitions. [2019-11-24 04:39:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:39:04,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:04,527 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] [2019-11-24 04:39:04,527 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:04,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:04,527 INFO L82 PathProgramCache]: Analyzing trace with hash 57855354, now seen corresponding path program 1 times [2019-11-24 04:39:04,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:04,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433017059] [2019-11-24 04:39:04,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:04,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 04:39:04,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433017059] [2019-11-24 04:39:04,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:04,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:04,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867815978] [2019-11-24 04:39:04,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:39:04,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:39:04,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:39:04,744 INFO L87 Difference]: Start difference. First operand 976 states and 1451 transitions. Second operand 4 states. [2019-11-24 04:39:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:05,590 INFO L93 Difference]: Finished difference Result 2607 states and 3890 transitions. [2019-11-24 04:39:05,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:05,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-24 04:39:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:05,595 INFO L225 Difference]: With dead ends: 2607 [2019-11-24 04:39:05,595 INFO L226 Difference]: Without dead ends: 1740 [2019-11-24 04:39:05,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:05,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2019-11-24 04:39:05,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 977. [2019-11-24 04:39:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-24 04:39:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1432 transitions. [2019-11-24 04:39:05,755 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1432 transitions. Word has length 49 [2019-11-24 04:39:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:05,756 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1432 transitions. [2019-11-24 04:39:05,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:39:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1432 transitions. [2019-11-24 04:39:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:39:05,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:05,757 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:05,757 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:05,758 INFO L82 PathProgramCache]: Analyzing trace with hash -93416345, now seen corresponding path program 1 times [2019-11-24 04:39:05,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:05,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158872805] [2019-11-24 04:39:05,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:05,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158872805] [2019-11-24 04:39:05,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:05,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 04:39:05,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134979965] [2019-11-24 04:39:05,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 04:39:05,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:05,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 04:39:05,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:39:05,887 INFO L87 Difference]: Start difference. First operand 977 states and 1432 transitions. Second operand 9 states. [2019-11-24 04:39:06,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:06,753 INFO L93 Difference]: Finished difference Result 3899 states and 5575 transitions. [2019-11-24 04:39:06,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-24 04:39:06,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-11-24 04:39:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:06,760 INFO L225 Difference]: With dead ends: 3899 [2019-11-24 04:39:06,760 INFO L226 Difference]: Without dead ends: 3042 [2019-11-24 04:39:06,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-11-24 04:39:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2019-11-24 04:39:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 964. [2019-11-24 04:39:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-11-24 04:39:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1360 transitions. [2019-11-24 04:39:06,928 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1360 transitions. Word has length 49 [2019-11-24 04:39:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:06,928 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1360 transitions. [2019-11-24 04:39:06,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 04:39:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1360 transitions. [2019-11-24 04:39:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:39:06,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:06,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:06,929 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:06,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1548099048, now seen corresponding path program 1 times [2019-11-24 04:39:06,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:06,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954010854] [2019-11-24 04:39:06,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:07,442 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 04:39:07,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954010854] [2019-11-24 04:39:07,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:07,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:39:07,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586252130] [2019-11-24 04:39:07,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:39:07,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:07,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:39:07,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:39:07,444 INFO L87 Difference]: Start difference. First operand 964 states and 1360 transitions. Second operand 6 states. [2019-11-24 04:39:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:08,267 INFO L93 Difference]: Finished difference Result 1543 states and 2156 transitions. [2019-11-24 04:39:08,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:39:08,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-24 04:39:08,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:08,269 INFO L225 Difference]: With dead ends: 1543 [2019-11-24 04:39:08,269 INFO L226 Difference]: Without dead ends: 832 [2019-11-24 04:39:08,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:08,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-11-24 04:39:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 791. [2019-11-24 04:39:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-11-24 04:39:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1108 transitions. [2019-11-24 04:39:08,364 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1108 transitions. Word has length 51 [2019-11-24 04:39:08,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:08,364 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1108 transitions. [2019-11-24 04:39:08,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:39:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1108 transitions. [2019-11-24 04:39:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:39:08,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:08,365 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:08,365 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:39:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash -46669853, now seen corresponding path program 1 times [2019-11-24 04:39:08,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:08,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770340609] [2019-11-24 04:39:08,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:08,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770340609] [2019-11-24 04:39:08,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818767349] [2019-11-24 04:39:08,508 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 04:39:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:08,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:39:08,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:39:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:08,971 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:39:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:09,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [165664603] [2019-11-24 04:39:09,055 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2019-11-24 04:39:09,055 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:39:09,061 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:39:09,068 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:39:09,069 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs