/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_spec2_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:40:41,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:40:41,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:40:41,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:40:41,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:40:41,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:40:41,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:40:41,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:40:41,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:40:41,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:40:41,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:40:41,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:40:41,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:40:41,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:40:41,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:40:41,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:40:41,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:40:41,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:40:41,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:40:41,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:40:41,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:40:41,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:40:41,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:40:41,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:40:41,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:40:41,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:40:41,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:40:41,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:40:41,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:40:41,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:40:41,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:40:41,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:40:41,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:40:41,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:40:41,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:40:41,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:40:41,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:40:41,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:40:41,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:40:41,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:40:41,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:40:41,191 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:40:41,212 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:40:41,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:40:41,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:40:41,214 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:40:41,214 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:40:41,215 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:40:41,215 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:40:41,215 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:40:41,215 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:40:41,215 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:40:41,216 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:40:41,217 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:40:41,217 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:40:41,217 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:40:41,218 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:40:41,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:40:41,219 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:40:41,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:40:41,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:40:41,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:40:41,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:40:41,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:40:41,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:40:41,220 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:40:41,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:40:41,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:40:41,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:40:41,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:40:41,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:40:41,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:40:41,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:40:41,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:40:41,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:40:41,223 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:40:41,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:40:41,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:40:41,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:40:41,224 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:40:41,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:40:41,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:40:41,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:40:41,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:40:41,518 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:40:41,519 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product03.cil.c [2019-11-24 04:40:41,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0facbe1a6/1340cd81dcc4417b9d70b2b41489f8ed/FLAG28f36d349 [2019-11-24 04:40:42,255 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:40:42,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product03.cil.c [2019-11-24 04:40:42,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0facbe1a6/1340cd81dcc4417b9d70b2b41489f8ed/FLAG28f36d349 [2019-11-24 04:40:42,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0facbe1a6/1340cd81dcc4417b9d70b2b41489f8ed [2019-11-24 04:40:42,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:40:42,528 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:40:42,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:40:42,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:40:42,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:40:42,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:40:42" (1/1) ... [2019-11-24 04:40:42,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac7d68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:42, skipping insertion in model container [2019-11-24 04:40:42,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:40:42" (1/1) ... [2019-11-24 04:40:42,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:40:42,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:40:43,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:40:43,361 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:40:43,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:40:43,564 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:40:43,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:43 WrapperNode [2019-11-24 04:40:43,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:40:43,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:40:43,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:40:43,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:40:43,575 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:40:43" (1/1) ... [2019-11-24 04:40:43,613 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:40:43" (1/1) ... [2019-11-24 04:40:43,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:40:43,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:40:43,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:40:43,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:40:43,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:43" (1/1) ... [2019-11-24 04:40:43,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:43" (1/1) ... [2019-11-24 04:40:43,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:43" (1/1) ... [2019-11-24 04:40:43,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:43" (1/1) ... [2019-11-24 04:40:43,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:43" (1/1) ... [2019-11-24 04:40:43,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:43" (1/1) ... [2019-11-24 04:40:43,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:43" (1/1) ... [2019-11-24 04:40:43,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:40:44,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:40:44,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:40:44,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:40:44,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:43" (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:40:44,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:40:44,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:40:44,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:40:44,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:41:07,924 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:41:07,924 INFO L284 CfgBuilder]: Removed 517 assume(true) statements. [2019-11-24 04:41:07,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:07 BoogieIcfgContainer [2019-11-24 04:41:07,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:41:07,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:41:07,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:41:07,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:41:07,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:40:42" (1/3) ... [2019-11-24 04:41:07,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1c005d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:07, skipping insertion in model container [2019-11-24 04:41:07,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:40:43" (2/3) ... [2019-11-24 04:41:07,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1c005d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:07, skipping insertion in model container [2019-11-24 04:41:07,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:07" (3/3) ... [2019-11-24 04:41:07,933 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product03.cil.c [2019-11-24 04:41:07,941 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:41:07,949 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:41:07,958 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:41:07,988 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:41:07,988 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:41:07,988 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:41:07,988 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:41:07,988 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:41:07,988 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:41:07,989 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:41:07,989 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:41:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-11-24 04:41:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:41:08,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:08,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:08,041 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:41:08,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:08,048 INFO L82 PathProgramCache]: Analyzing trace with hash 868601263, now seen corresponding path program 1 times [2019-11-24 04:41:08,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:08,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019383234] [2019-11-24 04:41:08,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:08,536 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:41:08,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019383234] [2019-11-24 04:41:08,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:08,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:41:08,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889605069] [2019-11-24 04:41:08,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:41:08,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:08,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:41:08,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:41:08,561 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 2 states. [2019-11-24 04:41:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:08,657 INFO L93 Difference]: Finished difference Result 766 states and 1459 transitions. [2019-11-24 04:41:08,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:41:08,658 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-24 04:41:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:08,681 INFO L225 Difference]: With dead ends: 766 [2019-11-24 04:41:08,681 INFO L226 Difference]: Without dead ends: 747 [2019-11-24 04:41:08,685 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:41:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-24 04:41:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-11-24 04:41:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-24 04:41:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1429 transitions. [2019-11-24 04:41:08,783 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1429 transitions. Word has length 14 [2019-11-24 04:41:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:08,783 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1429 transitions. [2019-11-24 04:41:08,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:41:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1429 transitions. [2019-11-24 04:41:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:41:08,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:08,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:08,792 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:41:08,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:08,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1150102095, now seen corresponding path program 1 times [2019-11-24 04:41:08,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:08,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304193787] [2019-11-24 04:41:08,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:08,982 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:41:08,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304193787] [2019-11-24 04:41:08,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:08,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:08,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016148353] [2019-11-24 04:41:08,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:08,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:08,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:08,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:08,986 INFO L87 Difference]: Start difference. First operand 747 states and 1429 transitions. Second operand 3 states. [2019-11-24 04:41:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:09,236 INFO L93 Difference]: Finished difference Result 1337 states and 2550 transitions. [2019-11-24 04:41:09,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:09,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:41:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:09,245 INFO L225 Difference]: With dead ends: 1337 [2019-11-24 04:41:09,245 INFO L226 Difference]: Without dead ends: 943 [2019-11-24 04:41:09,250 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:41:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-11-24 04:41:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 906. [2019-11-24 04:41:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-11-24 04:41:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1729 transitions. [2019-11-24 04:41:09,308 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1729 transitions. Word has length 15 [2019-11-24 04:41:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:09,308 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1729 transitions. [2019-11-24 04:41:09,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1729 transitions. [2019-11-24 04:41:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:41:09,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:09,311 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:41:09,311 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:41:09,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:09,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2033657483, now seen corresponding path program 1 times [2019-11-24 04:41:09,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:09,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050270865] [2019-11-24 04:41:09,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:09,426 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:41:09,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050270865] [2019-11-24 04:41:09,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:09,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:09,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690241577] [2019-11-24 04:41:09,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:09,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:09,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:09,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:09,431 INFO L87 Difference]: Start difference. First operand 906 states and 1729 transitions. Second operand 3 states. [2019-11-24 04:41:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:09,674 INFO L93 Difference]: Finished difference Result 1863 states and 3548 transitions. [2019-11-24 04:41:09,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:09,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:41:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:09,683 INFO L225 Difference]: With dead ends: 1863 [2019-11-24 04:41:09,684 INFO L226 Difference]: Without dead ends: 1327 [2019-11-24 04:41:09,685 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:41:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2019-11-24 04:41:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1214. [2019-11-24 04:41:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-11-24 04:41:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2311 transitions. [2019-11-24 04:41:09,727 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2311 transitions. Word has length 17 [2019-11-24 04:41:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:09,727 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2311 transitions. [2019-11-24 04:41:09,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2311 transitions. [2019-11-24 04:41:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:41:09,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:09,729 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:41:09,729 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:41:09,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:09,730 INFO L82 PathProgramCache]: Analyzing trace with hash -988220801, now seen corresponding path program 1 times [2019-11-24 04:41:09,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:09,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814297707] [2019-11-24 04:41:09,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:09,812 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:41:09,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814297707] [2019-11-24 04:41:09,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:09,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:09,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244951420] [2019-11-24 04:41:09,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:09,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:09,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:09,815 INFO L87 Difference]: Start difference. First operand 1214 states and 2311 transitions. Second operand 3 states. [2019-11-24 04:41:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:10,055 INFO L93 Difference]: Finished difference Result 2045 states and 3885 transitions. [2019-11-24 04:41:10,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:10,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:41:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:10,064 INFO L225 Difference]: With dead ends: 2045 [2019-11-24 04:41:10,064 INFO L226 Difference]: Without dead ends: 1204 [2019-11-24 04:41:10,066 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:41:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-11-24 04:41:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204. [2019-11-24 04:41:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-11-24 04:41:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 2285 transitions. [2019-11-24 04:41:10,111 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 2285 transitions. Word has length 19 [2019-11-24 04:41:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:10,112 INFO L462 AbstractCegarLoop]: Abstraction has 1204 states and 2285 transitions. [2019-11-24 04:41:10,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 2285 transitions. [2019-11-24 04:41:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:41:10,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:10,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] [2019-11-24 04:41:10,114 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:41:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2040910926, now seen corresponding path program 1 times [2019-11-24 04:41:10,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:10,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185328883] [2019-11-24 04:41:10,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:10,225 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:41:10,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185328883] [2019-11-24 04:41:10,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:10,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:10,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485007506] [2019-11-24 04:41:10,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:10,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:10,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:10,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:10,228 INFO L87 Difference]: Start difference. First operand 1204 states and 2285 transitions. Second operand 3 states. [2019-11-24 04:41:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:10,493 INFO L93 Difference]: Finished difference Result 2758 states and 5223 transitions. [2019-11-24 04:41:10,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:10,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:41:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:10,505 INFO L225 Difference]: With dead ends: 2758 [2019-11-24 04:41:10,505 INFO L226 Difference]: Without dead ends: 1944 [2019-11-24 04:41:10,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:41:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2019-11-24 04:41:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1792. [2019-11-24 04:41:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-11-24 04:41:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 3386 transitions. [2019-11-24 04:41:10,578 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 3386 transitions. Word has length 20 [2019-11-24 04:41:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:10,578 INFO L462 AbstractCegarLoop]: Abstraction has 1792 states and 3386 transitions. [2019-11-24 04:41:10,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 3386 transitions. [2019-11-24 04:41:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:41:10,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:10,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:10,580 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:41:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1156287831, now seen corresponding path program 1 times [2019-11-24 04:41:10,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:10,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109019248] [2019-11-24 04:41:10,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:10,679 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:41:10,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109019248] [2019-11-24 04:41:10,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:10,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:10,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624415815] [2019-11-24 04:41:10,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:10,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:10,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:10,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:10,681 INFO L87 Difference]: Start difference. First operand 1792 states and 3386 transitions. Second operand 3 states. [2019-11-24 04:41:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:10,911 INFO L93 Difference]: Finished difference Result 1792 states and 3386 transitions. [2019-11-24 04:41:10,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:10,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:41:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:10,922 INFO L225 Difference]: With dead ends: 1792 [2019-11-24 04:41:10,922 INFO L226 Difference]: Without dead ends: 1785 [2019-11-24 04:41:10,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:41:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-11-24 04:41:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1785. [2019-11-24 04:41:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2019-11-24 04:41:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 3374 transitions. [2019-11-24 04:41:10,993 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 3374 transitions. Word has length 21 [2019-11-24 04:41:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:10,994 INFO L462 AbstractCegarLoop]: Abstraction has 1785 states and 3374 transitions. [2019-11-24 04:41:10,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 3374 transitions. [2019-11-24 04:41:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:41:10,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:10,996 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] [2019-11-24 04:41:10,996 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:41:10,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:10,997 INFO L82 PathProgramCache]: Analyzing trace with hash 59305967, now seen corresponding path program 1 times [2019-11-24 04:41:10,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:10,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251756917] [2019-11-24 04:41:10,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:11,171 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:41:11,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251756917] [2019-11-24 04:41:11,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:11,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:11,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752953225] [2019-11-24 04:41:11,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:41:11,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:11,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:41:11,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:41:11,174 INFO L87 Difference]: Start difference. First operand 1785 states and 3374 transitions. Second operand 4 states. [2019-11-24 04:41:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:12,276 INFO L93 Difference]: Finished difference Result 3507 states and 6615 transitions. [2019-11-24 04:41:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:12,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-24 04:41:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:12,287 INFO L225 Difference]: With dead ends: 3507 [2019-11-24 04:41:12,287 INFO L226 Difference]: Without dead ends: 1932 [2019-11-24 04:41:12,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2019-11-24 04:41:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1785. [2019-11-24 04:41:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2019-11-24 04:41:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 3324 transitions. [2019-11-24 04:41:12,356 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 3324 transitions. Word has length 31 [2019-11-24 04:41:12,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:12,357 INFO L462 AbstractCegarLoop]: Abstraction has 1785 states and 3324 transitions. [2019-11-24 04:41:12,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:41:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 3324 transitions. [2019-11-24 04:41:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:41:12,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:12,360 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:12,361 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:41:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:12,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1877618219, now seen corresponding path program 1 times [2019-11-24 04:41:12,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:12,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028333101] [2019-11-24 04:41:12,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:12,561 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:41:12,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028333101] [2019-11-24 04:41:12,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:12,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:12,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050945736] [2019-11-24 04:41:12,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:12,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:12,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:12,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:12,564 INFO L87 Difference]: Start difference. First operand 1785 states and 3324 transitions. Second operand 3 states. [2019-11-24 04:41:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:13,473 INFO L93 Difference]: Finished difference Result 4523 states and 8416 transitions. [2019-11-24 04:41:13,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:13,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 04:41:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:13,492 INFO L225 Difference]: With dead ends: 4523 [2019-11-24 04:41:13,493 INFO L226 Difference]: Without dead ends: 2969 [2019-11-24 04:41:13,497 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:41:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2019-11-24 04:41:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1755. [2019-11-24 04:41:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-11-24 04:41:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 3244 transitions. [2019-11-24 04:41:13,595 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 3244 transitions. Word has length 36 [2019-11-24 04:41:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:13,596 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 3244 transitions. [2019-11-24 04:41:13,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3244 transitions. [2019-11-24 04:41:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:41:13,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:13,598 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:41:13,599 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:41:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash 731307138, now seen corresponding path program 1 times [2019-11-24 04:41:13,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:13,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323112059] [2019-11-24 04:41:13,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:13,814 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:41:13,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323112059] [2019-11-24 04:41:13,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:13,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:13,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617811318] [2019-11-24 04:41:13,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:13,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:13,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:13,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:13,819 INFO L87 Difference]: Start difference. First operand 1755 states and 3244 transitions. Second operand 3 states. [2019-11-24 04:41:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:14,680 INFO L93 Difference]: Finished difference Result 4444 states and 8237 transitions. [2019-11-24 04:41:14,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:14,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:41:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:14,696 INFO L225 Difference]: With dead ends: 4444 [2019-11-24 04:41:14,696 INFO L226 Difference]: Without dead ends: 2947 [2019-11-24 04:41:14,699 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:41:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2019-11-24 04:41:14,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1735. [2019-11-24 04:41:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-11-24 04:41:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 3174 transitions. [2019-11-24 04:41:14,792 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 3174 transitions. Word has length 37 [2019-11-24 04:41:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:14,792 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 3174 transitions. [2019-11-24 04:41:14,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 3174 transitions. [2019-11-24 04:41:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:41:14,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:14,795 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] [2019-11-24 04:41:14,795 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:41:14,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:14,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1816178557, now seen corresponding path program 1 times [2019-11-24 04:41:14,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:14,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243032084] [2019-11-24 04:41:14,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:15,034 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:41:15,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243032084] [2019-11-24 04:41:15,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:15,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:15,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860782269] [2019-11-24 04:41:15,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:15,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:15,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:15,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:15,037 INFO L87 Difference]: Start difference. First operand 1735 states and 3174 transitions. Second operand 3 states. [2019-11-24 04:41:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:15,932 INFO L93 Difference]: Finished difference Result 4380 states and 8073 transitions. [2019-11-24 04:41:15,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:15,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:41:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:15,947 INFO L225 Difference]: With dead ends: 4380 [2019-11-24 04:41:15,947 INFO L226 Difference]: Without dead ends: 2935 [2019-11-24 04:41:15,951 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:41:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2019-11-24 04:41:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1725. [2019-11-24 04:41:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-11-24 04:41:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3114 transitions. [2019-11-24 04:41:16,043 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3114 transitions. Word has length 39 [2019-11-24 04:41:16,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:16,044 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3114 transitions. [2019-11-24 04:41:16,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3114 transitions. [2019-11-24 04:41:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 04:41:16,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:16,046 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:16,046 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:41:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:16,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2072697713, now seen corresponding path program 1 times [2019-11-24 04:41:16,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:16,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715649877] [2019-11-24 04:41:16,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:16,258 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:41:16,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715649877] [2019-11-24 04:41:16,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:16,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:16,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406497492] [2019-11-24 04:41:16,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:16,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:16,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:16,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:16,260 INFO L87 Difference]: Start difference. First operand 1725 states and 3114 transitions. Second operand 3 states. [2019-11-24 04:41:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:16,960 INFO L93 Difference]: Finished difference Result 3270 states and 5938 transitions. [2019-11-24 04:41:16,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:16,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 04:41:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:16,969 INFO L225 Difference]: With dead ends: 3270 [2019-11-24 04:41:16,970 INFO L226 Difference]: Without dead ends: 1872 [2019-11-24 04:41:16,973 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:41:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-11-24 04:41:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1725. [2019-11-24 04:41:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-11-24 04:41:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3064 transitions. [2019-11-24 04:41:17,053 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3064 transitions. Word has length 42 [2019-11-24 04:41:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:17,054 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3064 transitions. [2019-11-24 04:41:17,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3064 transitions. [2019-11-24 04:41:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:41:17,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:17,056 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] [2019-11-24 04:41:17,056 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:41:17,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash 341211864, now seen corresponding path program 1 times [2019-11-24 04:41:17,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:17,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225351046] [2019-11-24 04:41:17,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:17,307 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:41:17,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225351046] [2019-11-24 04:41:17,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:17,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:17,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509325715] [2019-11-24 04:41:17,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:17,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:17,310 INFO L87 Difference]: Start difference. First operand 1725 states and 3064 transitions. Second operand 5 states. [2019-11-24 04:41:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:18,551 INFO L93 Difference]: Finished difference Result 6713 states and 12252 transitions. [2019-11-24 04:41:18,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:41:18,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-24 04:41:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:18,591 INFO L225 Difference]: With dead ends: 6713 [2019-11-24 04:41:18,591 INFO L226 Difference]: Without dead ends: 5003 [2019-11-24 04:41:18,595 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:41:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2019-11-24 04:41:18,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 2093. [2019-11-24 04:41:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2019-11-24 04:41:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 3605 transitions. [2019-11-24 04:41:18,739 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 3605 transitions. Word has length 45 [2019-11-24 04:41:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:18,740 INFO L462 AbstractCegarLoop]: Abstraction has 2093 states and 3605 transitions. [2019-11-24 04:41:18,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 3605 transitions. [2019-11-24 04:41:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:41:18,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:18,742 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] [2019-11-24 04:41:18,742 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:41:18,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:18,742 INFO L82 PathProgramCache]: Analyzing trace with hash 546459781, now seen corresponding path program 1 times [2019-11-24 04:41:18,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:18,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550460584] [2019-11-24 04:41:18,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:19,456 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:41:19,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550460584] [2019-11-24 04:41:19,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:19,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:19,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933096599] [2019-11-24 04:41:19,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:19,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:19,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:19,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:19,459 INFO L87 Difference]: Start difference. First operand 2093 states and 3605 transitions. Second operand 21 states. [2019-11-24 04:41:21,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:21,199 INFO L93 Difference]: Finished difference Result 6298 states and 11052 transitions. [2019-11-24 04:41:21,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:21,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2019-11-24 04:41:21,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:21,209 INFO L225 Difference]: With dead ends: 6298 [2019-11-24 04:41:21,210 INFO L226 Difference]: Without dead ends: 4344 [2019-11-24 04:41:21,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:41:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4344 states. [2019-11-24 04:41:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4344 to 2071. [2019-11-24 04:41:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-11-24 04:41:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 3550 transitions. [2019-11-24 04:41:21,406 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 3550 transitions. Word has length 46 [2019-11-24 04:41:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:21,406 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 3550 transitions. [2019-11-24 04:41:21,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 3550 transitions. [2019-11-24 04:41:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:41:21,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:21,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:21,408 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:41:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1782795585, now seen corresponding path program 1 times [2019-11-24 04:41:21,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:21,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268080045] [2019-11-24 04:41:21,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:22,229 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:41:22,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268080045] [2019-11-24 04:41:22,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:22,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:22,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061765956] [2019-11-24 04:41:22,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:22,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:22,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:22,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:22,231 INFO L87 Difference]: Start difference. First operand 2071 states and 3550 transitions. Second operand 21 states. [2019-11-24 04:41:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:24,010 INFO L93 Difference]: Finished difference Result 6424 states and 11198 transitions. [2019-11-24 04:41:24,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:24,010 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2019-11-24 04:41:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:24,020 INFO L225 Difference]: With dead ends: 6424 [2019-11-24 04:41:24,021 INFO L226 Difference]: Without dead ends: 4483 [2019-11-24 04:41:24,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:41:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4483 states. [2019-11-24 04:41:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4483 to 2233. [2019-11-24 04:41:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2233 states. [2019-11-24 04:41:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3734 transitions. [2019-11-24 04:41:24,264 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3734 transitions. Word has length 47 [2019-11-24 04:41:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:24,267 INFO L462 AbstractCegarLoop]: Abstraction has 2233 states and 3734 transitions. [2019-11-24 04:41:24,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3734 transitions. [2019-11-24 04:41:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:41:24,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:24,269 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:24,270 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:41:24,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash 319260408, now seen corresponding path program 1 times [2019-11-24 04:41:24,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:24,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410473473] [2019-11-24 04:41:24,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:25,009 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:41:25,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410473473] [2019-11-24 04:41:25,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:25,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:41:25,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644918888] [2019-11-24 04:41:25,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:41:25,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:25,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:41:25,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:41:25,012 INFO L87 Difference]: Start difference. First operand 2233 states and 3734 transitions. Second operand 21 states. [2019-11-24 04:41:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:28,514 INFO L93 Difference]: Finished difference Result 6343 states and 10660 transitions. [2019-11-24 04:41:28,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:28,514 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2019-11-24 04:41:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:28,522 INFO L225 Difference]: With dead ends: 6343 [2019-11-24 04:41:28,522 INFO L226 Difference]: Without dead ends: 4235 [2019-11-24 04:41:28,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:41:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2019-11-24 04:41:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 2618. [2019-11-24 04:41:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2618 states. [2019-11-24 04:41:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 4322 transitions. [2019-11-24 04:41:28,809 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 4322 transitions. Word has length 50 [2019-11-24 04:41:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:28,810 INFO L462 AbstractCegarLoop]: Abstraction has 2618 states and 4322 transitions. [2019-11-24 04:41:28,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:41:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 4322 transitions. [2019-11-24 04:41:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 04:41:28,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:28,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:28,814 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:41:28,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:28,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1337481647, now seen corresponding path program 1 times [2019-11-24 04:41:28,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:28,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229689145] [2019-11-24 04:41:28,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:28,943 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:41:28,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229689145] [2019-11-24 04:41:28,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:28,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:28,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021945074] [2019-11-24 04:41:28,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:28,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:28,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:28,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:28,945 INFO L87 Difference]: Start difference. First operand 2618 states and 4322 transitions. Second operand 5 states. [2019-11-24 04:41:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:29,805 INFO L93 Difference]: Finished difference Result 6659 states and 11307 transitions. [2019-11-24 04:41:29,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:29,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-24 04:41:29,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:29,812 INFO L225 Difference]: With dead ends: 6659 [2019-11-24 04:41:29,812 INFO L226 Difference]: Without dead ends: 4259 [2019-11-24 04:41:29,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2019-11-24 04:41:30,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 2700. [2019-11-24 04:41:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2700 states. [2019-11-24 04:41:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 4404 transitions. [2019-11-24 04:41:30,103 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 4404 transitions. Word has length 62 [2019-11-24 04:41:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:30,103 INFO L462 AbstractCegarLoop]: Abstraction has 2700 states and 4404 transitions. [2019-11-24 04:41:30,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 4404 transitions. [2019-11-24 04:41:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 04:41:30,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:30,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:30,106 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:41:30,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:30,107 INFO L82 PathProgramCache]: Analyzing trace with hash -702622668, now seen corresponding path program 1 times [2019-11-24 04:41:30,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:30,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930971523] [2019-11-24 04:41:30,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:30,255 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:41:30,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930971523] [2019-11-24 04:41:30,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:30,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:41:30,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833158841] [2019-11-24 04:41:30,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:41:30,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:30,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:41:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:30,257 INFO L87 Difference]: Start difference. First operand 2700 states and 4404 transitions. Second operand 6 states. [2019-11-24 04:41:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:31,145 INFO L93 Difference]: Finished difference Result 6741 states and 11349 transitions. [2019-11-24 04:41:31,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:31,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-11-24 04:41:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:31,153 INFO L225 Difference]: With dead ends: 6741 [2019-11-24 04:41:31,153 INFO L226 Difference]: Without dead ends: 4259 [2019-11-24 04:41:31,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:41:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2019-11-24 04:41:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 2700. [2019-11-24 04:41:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2700 states. [2019-11-24 04:41:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 4364 transitions. [2019-11-24 04:41:31,538 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 4364 transitions. Word has length 63 [2019-11-24 04:41:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:31,538 INFO L462 AbstractCegarLoop]: Abstraction has 2700 states and 4364 transitions. [2019-11-24 04:41:31,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:41:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 4364 transitions. [2019-11-24 04:41:31,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 04:41:31,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:31,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:31,542 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:41:31,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:31,543 INFO L82 PathProgramCache]: Analyzing trace with hash 595359099, now seen corresponding path program 1 times [2019-11-24 04:41:31,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:31,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376957823] [2019-11-24 04:41:31,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:31,749 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:41:31,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376957823] [2019-11-24 04:41:31,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:31,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:31,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579677532] [2019-11-24 04:41:31,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:31,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:31,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:31,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:31,751 INFO L87 Difference]: Start difference. First operand 2700 states and 4364 transitions. Second operand 5 states. [2019-11-24 04:41:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:32,810 INFO L93 Difference]: Finished difference Result 6805 states and 11355 transitions. [2019-11-24 04:41:32,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:32,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-24 04:41:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:32,815 INFO L225 Difference]: With dead ends: 6805 [2019-11-24 04:41:32,816 INFO L226 Difference]: Without dead ends: 4323 [2019-11-24 04:41:32,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2019-11-24 04:41:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 2675. [2019-11-24 04:41:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2675 states. [2019-11-24 04:41:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 4312 transitions. [2019-11-24 04:41:33,221 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 4312 transitions. Word has length 64 [2019-11-24 04:41:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:33,222 INFO L462 AbstractCegarLoop]: Abstraction has 2675 states and 4312 transitions. [2019-11-24 04:41:33,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 4312 transitions. [2019-11-24 04:41:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 04:41:33,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:33,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:33,225 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:41:33,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:33,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1214526503, now seen corresponding path program 1 times [2019-11-24 04:41:33,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:33,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579723773] [2019-11-24 04:41:33,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:33,421 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:41:33,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579723773] [2019-11-24 04:41:33,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:33,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:41:33,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492480533] [2019-11-24 04:41:33,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:41:33,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:33,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:41:33,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:33,423 INFO L87 Difference]: Start difference. First operand 2675 states and 4312 transitions. Second operand 6 states. [2019-11-24 04:41:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:35,450 INFO L93 Difference]: Finished difference Result 8744 states and 14411 transitions. [2019-11-24 04:41:35,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:35,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-24 04:41:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:35,457 INFO L225 Difference]: With dead ends: 8744 [2019-11-24 04:41:35,457 INFO L226 Difference]: Without dead ends: 6287 [2019-11-24 04:41:35,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:41:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6287 states. [2019-11-24 04:41:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6287 to 3091. [2019-11-24 04:41:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3091 states. [2019-11-24 04:41:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 5029 transitions. [2019-11-24 04:41:35,843 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 5029 transitions. Word has length 67 [2019-11-24 04:41:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:35,843 INFO L462 AbstractCegarLoop]: Abstraction has 3091 states and 5029 transitions. [2019-11-24 04:41:35,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:41:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 5029 transitions. [2019-11-24 04:41:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 04:41:35,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:35,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:35,845 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:41:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1193648690, now seen corresponding path program 1 times [2019-11-24 04:41:35,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:35,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622466641] [2019-11-24 04:41:35,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:36,484 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:41:36,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622466641] [2019-11-24 04:41:36,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:36,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:41:36,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009444479] [2019-11-24 04:41:36,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:41:36,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:41:36,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:41:36,487 INFO L87 Difference]: Start difference. First operand 3091 states and 5029 transitions. Second operand 22 states. [2019-11-24 04:41:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:42,104 INFO L93 Difference]: Finished difference Result 11072 states and 18405 transitions. [2019-11-24 04:41:42,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-24 04:41:42,104 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-11-24 04:41:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:42,112 INFO L225 Difference]: With dead ends: 11072 [2019-11-24 04:41:42,113 INFO L226 Difference]: Without dead ends: 8197 [2019-11-24 04:41:42,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=571, Invalid=1591, Unknown=0, NotChecked=0, Total=2162 [2019-11-24 04:41:42,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8197 states. [2019-11-24 04:41:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8197 to 5153. [2019-11-24 04:41:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2019-11-24 04:41:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 8676 transitions. [2019-11-24 04:41:42,790 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 8676 transitions. Word has length 67 [2019-11-24 04:41:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:42,791 INFO L462 AbstractCegarLoop]: Abstraction has 5153 states and 8676 transitions. [2019-11-24 04:41:42,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:41:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 8676 transitions. [2019-11-24 04:41:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 04:41:42,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:42,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:42,794 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:41:42,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:42,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1643374298, now seen corresponding path program 1 times [2019-11-24 04:41:42,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:42,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734584769] [2019-11-24 04:41:42,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:42,978 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:41:42,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734584769] [2019-11-24 04:41:42,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:42,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:42,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66528346] [2019-11-24 04:41:42,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:42,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:42,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:42,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:42,980 INFO L87 Difference]: Start difference. First operand 5153 states and 8676 transitions. Second operand 5 states. [2019-11-24 04:41:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:44,792 INFO L93 Difference]: Finished difference Result 12152 states and 20764 transitions. [2019-11-24 04:41:44,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:41:44,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-24 04:41:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:44,801 INFO L225 Difference]: With dead ends: 12152 [2019-11-24 04:41:44,802 INFO L226 Difference]: Without dead ends: 7217 [2019-11-24 04:41:44,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:41:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7217 states. [2019-11-24 04:41:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7217 to 5109. [2019-11-24 04:41:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5109 states. [2019-11-24 04:41:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 8587 transitions. [2019-11-24 04:41:45,541 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 8587 transitions. Word has length 67 [2019-11-24 04:41:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:45,541 INFO L462 AbstractCegarLoop]: Abstraction has 5109 states and 8587 transitions. [2019-11-24 04:41:45,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 8587 transitions. [2019-11-24 04:41:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 04:41:45,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:45,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:45,545 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:41:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:45,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1110029352, now seen corresponding path program 1 times [2019-11-24 04:41:45,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:45,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440847574] [2019-11-24 04:41:45,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:45,744 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:41:45,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440847574] [2019-11-24 04:41:45,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:45,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:41:45,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868844499] [2019-11-24 04:41:45,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:45,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:45,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:45,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:45,747 INFO L87 Difference]: Start difference. First operand 5109 states and 8587 transitions. Second operand 5 states. [2019-11-24 04:41:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:48,144 INFO L93 Difference]: Finished difference Result 14582 states and 24371 transitions. [2019-11-24 04:41:48,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:41:48,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-24 04:41:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:48,157 INFO L225 Difference]: With dead ends: 14582 [2019-11-24 04:41:48,157 INFO L226 Difference]: Without dead ends: 9593 [2019-11-24 04:41:48,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:41:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9593 states. [2019-11-24 04:41:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9593 to 5496. [2019-11-24 04:41:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5496 states. [2019-11-24 04:41:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 9072 transitions. [2019-11-24 04:41:48,845 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 9072 transitions. Word has length 68 [2019-11-24 04:41:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:48,845 INFO L462 AbstractCegarLoop]: Abstraction has 5496 states and 9072 transitions. [2019-11-24 04:41:48,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 9072 transitions. [2019-11-24 04:41:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 04:41:48,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:48,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:48,848 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:41:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1702333803, now seen corresponding path program 1 times [2019-11-24 04:41:48,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:48,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70401690] [2019-11-24 04:41:48,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:49,452 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:41:49,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70401690] [2019-11-24 04:41:49,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676475490] [2019-11-24 04:41:49,453 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:41:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:49,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:41:49,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:41:49,973 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:41:49,973 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:41:50,104 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:41:50,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [709195137] [2019-11-24 04:41:50,138 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2019-11-24 04:41:50,138 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:41:50,144 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:41:50,151 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:41:50,151 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs