/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:47:37,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:47:37,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:47:37,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:47:37,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:47:37,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:47:37,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:47:37,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:47:37,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:47:37,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:47:37,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:47:37,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:47:37,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:47:37,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:47:37,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:47:37,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:47:37,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:47:37,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:47:37,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:47:37,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:47:37,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:47:37,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:47:37,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:47:37,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:47:37,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:47:37,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:47:37,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:47:37,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:47:37,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:47:37,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:47:37,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:47:37,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:47:37,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:47:37,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:47:37,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:47:37,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:47:37,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:47:37,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:47:37,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:47:37,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:47:37,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:47:37,139 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 05:47:37,166 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:47:37,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:47:37,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:47:37,168 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:47:37,168 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:47:37,168 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:47:37,168 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:47:37,169 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:47:37,169 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:47:37,169 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:47:37,169 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:47:37,169 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:47:37,170 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:47:37,170 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:47:37,170 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:47:37,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:47:37,171 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:47:37,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:47:37,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:47:37,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:47:37,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:47:37,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:47:37,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:47:37,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:47:37,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:47:37,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:47:37,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:47:37,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:47:37,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:47:37,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:47:37,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:47:37,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:47:37,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:47:37,174 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:47:37,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:47:37,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:47:37,175 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:47:37,175 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:47:37,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:47:37,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:47:37,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:47:37,521 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:47:37,522 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:47:37,522 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-24 05:47:37,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34385599/d7292fcc60e048faac4e16b67c1ea709/FLAGd4efa0b63 [2019-11-24 05:47:38,258 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:47:38,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-24 05:47:38,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34385599/d7292fcc60e048faac4e16b67c1ea709/FLAGd4efa0b63 [2019-11-24 05:47:38,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34385599/d7292fcc60e048faac4e16b67c1ea709 [2019-11-24 05:47:38,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:47:38,452 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:47:38,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:47:38,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:47:38,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:47:38,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:47:38" (1/1) ... [2019-11-24 05:47:38,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc4791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:38, skipping insertion in model container [2019-11-24 05:47:38,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:47:38" (1/1) ... [2019-11-24 05:47:38,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:47:38,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:47:39,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:47:39,711 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:47:40,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:47:40,201 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:47:40,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40 WrapperNode [2019-11-24 05:47:40,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:47:40,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:47:40,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:47:40,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:47:40,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40" (1/1) ... [2019-11-24 05:47:40,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40" (1/1) ... [2019-11-24 05:47:40,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:47:40,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:47:40,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:47:40,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:47:40,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40" (1/1) ... [2019-11-24 05:47:40,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40" (1/1) ... [2019-11-24 05:47:40,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40" (1/1) ... [2019-11-24 05:47:40,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40" (1/1) ... [2019-11-24 05:47:40,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40" (1/1) ... [2019-11-24 05:47:40,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40" (1/1) ... [2019-11-24 05:47:40,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40" (1/1) ... [2019-11-24 05:47:40,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:47:40,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:47:40,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:47:40,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:47:40,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:47:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:47:40,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:47:44,386 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:47:44,387 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:47:44,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:47:44 BoogieIcfgContainer [2019-11-24 05:47:44,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:47:44,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:47:44,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:47:44,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:47:44,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:47:38" (1/3) ... [2019-11-24 05:47:44,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9df0dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:47:44, skipping insertion in model container [2019-11-24 05:47:44,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:40" (2/3) ... [2019-11-24 05:47:44,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9df0dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:47:44, skipping insertion in model container [2019-11-24 05:47:44,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:47:44" (3/3) ... [2019-11-24 05:47:44,397 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-24 05:47:44,406 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:47:44,414 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:47:44,426 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:47:44,463 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:47:44,463 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:47:44,463 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:47:44,463 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:47:44,463 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:47:44,463 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:47:44,464 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:47:44,464 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:47:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states. [2019-11-24 05:47:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:47:44,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:44,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:44,533 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:44,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2020000843, now seen corresponding path program 1 times [2019-11-24 05:47:44,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:44,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641653628] [2019-11-24 05:47:44,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:45,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641653628] [2019-11-24 05:47:45,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:45,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:47:45,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183324660] [2019-11-24 05:47:45,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:47:45,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:45,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:47:45,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:45,161 INFO L87 Difference]: Start difference. First operand 1053 states. Second operand 5 states. [2019-11-24 05:47:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:46,791 INFO L93 Difference]: Finished difference Result 1879 states and 3332 transitions. [2019-11-24 05:47:46,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:47:46,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-24 05:47:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:46,823 INFO L225 Difference]: With dead ends: 1879 [2019-11-24 05:47:46,824 INFO L226 Difference]: Without dead ends: 1220 [2019-11-24 05:47:46,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:47:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2019-11-24 05:47:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1208. [2019-11-24 05:47:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-11-24 05:47:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1558 transitions. [2019-11-24 05:47:46,979 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1558 transitions. Word has length 50 [2019-11-24 05:47:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:46,980 INFO L462 AbstractCegarLoop]: Abstraction has 1208 states and 1558 transitions. [2019-11-24 05:47:46,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:47:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1558 transitions. [2019-11-24 05:47:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:47:46,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:46,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:46,985 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:46,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash -371948326, now seen corresponding path program 1 times [2019-11-24 05:47:46,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:46,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174795988] [2019-11-24 05:47:46,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:47,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174795988] [2019-11-24 05:47:47,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:47,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:47:47,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144194025] [2019-11-24 05:47:47,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:47:47,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:47:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:47,136 INFO L87 Difference]: Start difference. First operand 1208 states and 1558 transitions. Second operand 5 states. [2019-11-24 05:47:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:48,318 INFO L93 Difference]: Finished difference Result 2197 states and 2879 transitions. [2019-11-24 05:47:48,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:47:48,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-24 05:47:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:48,334 INFO L225 Difference]: With dead ends: 2197 [2019-11-24 05:47:48,334 INFO L226 Difference]: Without dead ends: 1474 [2019-11-24 05:47:48,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:47:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-11-24 05:47:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1464. [2019-11-24 05:47:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2019-11-24 05:47:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1906 transitions. [2019-11-24 05:47:48,427 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1906 transitions. Word has length 50 [2019-11-24 05:47:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:48,428 INFO L462 AbstractCegarLoop]: Abstraction has 1464 states and 1906 transitions. [2019-11-24 05:47:48,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:47:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1906 transitions. [2019-11-24 05:47:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:47:48,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:48,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:48,432 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1656171021, now seen corresponding path program 1 times [2019-11-24 05:47:48,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:48,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049596290] [2019-11-24 05:47:48,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:48,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049596290] [2019-11-24 05:47:48,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:48,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:47:48,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665803517] [2019-11-24 05:47:48,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:47:48,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:48,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:47:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:48,563 INFO L87 Difference]: Start difference. First operand 1464 states and 1906 transitions. Second operand 5 states. [2019-11-24 05:47:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:49,638 INFO L93 Difference]: Finished difference Result 2827 states and 3713 transitions. [2019-11-24 05:47:49,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:47:49,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-24 05:47:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:49,648 INFO L225 Difference]: With dead ends: 2827 [2019-11-24 05:47:49,648 INFO L226 Difference]: Without dead ends: 2099 [2019-11-24 05:47:49,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:47:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2019-11-24 05:47:49,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2093. [2019-11-24 05:47:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2019-11-24 05:47:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2709 transitions. [2019-11-24 05:47:49,736 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2709 transitions. Word has length 50 [2019-11-24 05:47:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:49,736 INFO L462 AbstractCegarLoop]: Abstraction has 2093 states and 2709 transitions. [2019-11-24 05:47:49,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:47:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2709 transitions. [2019-11-24 05:47:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:49,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:49,740 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:49,740 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:49,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:49,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1156025879, now seen corresponding path program 1 times [2019-11-24 05:47:49,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:49,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304956837] [2019-11-24 05:47:49,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:49,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304956837] [2019-11-24 05:47:49,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:49,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:49,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701881735] [2019-11-24 05:47:49,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:49,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:49,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:49,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:49,915 INFO L87 Difference]: Start difference. First operand 2093 states and 2709 transitions. Second operand 8 states. [2019-11-24 05:47:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:52,558 INFO L93 Difference]: Finished difference Result 3181 states and 4160 transitions. [2019-11-24 05:47:52,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:47:52,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-24 05:47:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:52,586 INFO L225 Difference]: With dead ends: 3181 [2019-11-24 05:47:52,587 INFO L226 Difference]: Without dead ends: 3176 [2019-11-24 05:47:52,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:47:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3176 states. [2019-11-24 05:47:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3176 to 2093. [2019-11-24 05:47:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2019-11-24 05:47:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2708 transitions. [2019-11-24 05:47:52,783 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2708 transitions. Word has length 51 [2019-11-24 05:47:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:52,784 INFO L462 AbstractCegarLoop]: Abstraction has 2093 states and 2708 transitions. [2019-11-24 05:47:52,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2708 transitions. [2019-11-24 05:47:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:52,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:52,788 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:52,789 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:52,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:52,789 INFO L82 PathProgramCache]: Analyzing trace with hash 544097692, now seen corresponding path program 1 times [2019-11-24 05:47:52,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:52,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125348756] [2019-11-24 05:47:52,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:53,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125348756] [2019-11-24 05:47:53,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:53,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:53,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995869853] [2019-11-24 05:47:53,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:53,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:53,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:53,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:53,005 INFO L87 Difference]: Start difference. First operand 2093 states and 2708 transitions. Second operand 8 states. [2019-11-24 05:47:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:56,245 INFO L93 Difference]: Finished difference Result 3833 states and 5088 transitions. [2019-11-24 05:47:56,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:47:56,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-24 05:47:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:56,261 INFO L225 Difference]: With dead ends: 3833 [2019-11-24 05:47:56,261 INFO L226 Difference]: Without dead ends: 3510 [2019-11-24 05:47:56,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-11-24 05:47:56,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2019-11-24 05:47:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 2093. [2019-11-24 05:47:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2019-11-24 05:47:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2707 transitions. [2019-11-24 05:47:56,401 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2707 transitions. Word has length 51 [2019-11-24 05:47:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:56,403 INFO L462 AbstractCegarLoop]: Abstraction has 2093 states and 2707 transitions. [2019-11-24 05:47:56,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2707 transitions. [2019-11-24 05:47:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:56,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:56,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:56,408 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:56,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1134807775, now seen corresponding path program 1 times [2019-11-24 05:47:56,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:56,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272321619] [2019-11-24 05:47:56,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:56,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272321619] [2019-11-24 05:47:56,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:56,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:47:56,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007166205] [2019-11-24 05:47:56,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:47:56,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:56,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:47:56,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:47:56,584 INFO L87 Difference]: Start difference. First operand 2093 states and 2707 transitions. Second operand 7 states. [2019-11-24 05:47:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:58,424 INFO L93 Difference]: Finished difference Result 3455 states and 4567 transitions. [2019-11-24 05:47:58,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:47:58,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-24 05:47:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:58,437 INFO L225 Difference]: With dead ends: 3455 [2019-11-24 05:47:58,437 INFO L226 Difference]: Without dead ends: 3008 [2019-11-24 05:47:58,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-11-24 05:47:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-11-24 05:47:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2093. [2019-11-24 05:47:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2019-11-24 05:47:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2706 transitions. [2019-11-24 05:47:58,577 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2706 transitions. Word has length 51 [2019-11-24 05:47:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:58,578 INFO L462 AbstractCegarLoop]: Abstraction has 2093 states and 2706 transitions. [2019-11-24 05:47:58,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:47:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2706 transitions. [2019-11-24 05:47:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:47:58,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:58,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:58,585 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1876349593, now seen corresponding path program 1 times [2019-11-24 05:47:58,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:58,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581462470] [2019-11-24 05:47:58,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:58,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 05:47:58,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581462470] [2019-11-24 05:47:58,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:58,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:58,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355503908] [2019-11-24 05:47:58,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:58,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:58,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:58,682 INFO L87 Difference]: Start difference. First operand 2093 states and 2706 transitions. Second operand 3 states. [2019-11-24 05:47:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:58,975 INFO L93 Difference]: Finished difference Result 2855 states and 3765 transitions. [2019-11-24 05:47:58,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:58,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-24 05:47:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:58,983 INFO L225 Difference]: With dead ends: 2855 [2019-11-24 05:47:58,983 INFO L226 Difference]: Without dead ends: 1802 [2019-11-24 05:47:58,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2019-11-24 05:47:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1800. [2019-11-24 05:47:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-11-24 05:47:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2280 transitions. [2019-11-24 05:47:59,111 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2280 transitions. Word has length 52 [2019-11-24 05:47:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:59,112 INFO L462 AbstractCegarLoop]: Abstraction has 1800 states and 2280 transitions. [2019-11-24 05:47:59,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:47:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2280 transitions. [2019-11-24 05:47:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:47:59,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:59,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:59,115 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:59,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:59,115 INFO L82 PathProgramCache]: Analyzing trace with hash -128279793, now seen corresponding path program 1 times [2019-11-24 05:47:59,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:59,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695049161] [2019-11-24 05:47:59,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:59,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695049161] [2019-11-24 05:47:59,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:59,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:59,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512230866] [2019-11-24 05:47:59,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:59,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:59,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:59,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:59,207 INFO L87 Difference]: Start difference. First operand 1800 states and 2280 transitions. Second operand 3 states. [2019-11-24 05:47:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:59,396 INFO L93 Difference]: Finished difference Result 2757 states and 3658 transitions. [2019-11-24 05:47:59,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:59,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-24 05:47:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:59,405 INFO L225 Difference]: With dead ends: 2757 [2019-11-24 05:47:59,405 INFO L226 Difference]: Without dead ends: 2057 [2019-11-24 05:47:59,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2019-11-24 05:47:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2055. [2019-11-24 05:47:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-11-24 05:47:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2669 transitions. [2019-11-24 05:47:59,561 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2669 transitions. Word has length 52 [2019-11-24 05:47:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:59,562 INFO L462 AbstractCegarLoop]: Abstraction has 2055 states and 2669 transitions. [2019-11-24 05:47:59,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:47:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2669 transitions. [2019-11-24 05:47:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:47:59,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:59,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:59,565 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:59,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:59,565 INFO L82 PathProgramCache]: Analyzing trace with hash -678266137, now seen corresponding path program 1 times [2019-11-24 05:47:59,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:59,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558514455] [2019-11-24 05:47:59,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:59,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558514455] [2019-11-24 05:47:59,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:59,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:59,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282222973] [2019-11-24 05:47:59,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:59,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:59,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:59,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:59,607 INFO L87 Difference]: Start difference. First operand 2055 states and 2669 transitions. Second operand 3 states. [2019-11-24 05:47:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:59,872 INFO L93 Difference]: Finished difference Result 3729 states and 5048 transitions. [2019-11-24 05:47:59,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:59,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-24 05:47:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:59,880 INFO L225 Difference]: With dead ends: 3729 [2019-11-24 05:47:59,881 INFO L226 Difference]: Without dead ends: 2601 [2019-11-24 05:47:59,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2019-11-24 05:48:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2599. [2019-11-24 05:48:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2599 states. [2019-11-24 05:48:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 3427 transitions. [2019-11-24 05:48:00,087 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 3427 transitions. Word has length 52 [2019-11-24 05:48:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:00,087 INFO L462 AbstractCegarLoop]: Abstraction has 2599 states and 3427 transitions. [2019-11-24 05:48:00,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3427 transitions. [2019-11-24 05:48:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 05:48:00,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:00,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:00,090 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:00,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash 396589116, now seen corresponding path program 1 times [2019-11-24 05:48:00,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:00,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142225572] [2019-11-24 05:48:00,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:00,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142225572] [2019-11-24 05:48:00,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:00,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:00,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352965379] [2019-11-24 05:48:00,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:00,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:00,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:00,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:00,127 INFO L87 Difference]: Start difference. First operand 2599 states and 3427 transitions. Second operand 3 states. [2019-11-24 05:48:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:00,461 INFO L93 Difference]: Finished difference Result 4611 states and 6191 transitions. [2019-11-24 05:48:00,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:00,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 05:48:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:00,475 INFO L225 Difference]: With dead ends: 4611 [2019-11-24 05:48:00,475 INFO L226 Difference]: Without dead ends: 2525 [2019-11-24 05:48:00,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2019-11-24 05:48:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2213. [2019-11-24 05:48:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2019-11-24 05:48:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2930 transitions. [2019-11-24 05:48:00,759 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2930 transitions. Word has length 53 [2019-11-24 05:48:00,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:00,759 INFO L462 AbstractCegarLoop]: Abstraction has 2213 states and 2930 transitions. [2019-11-24 05:48:00,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2930 transitions. [2019-11-24 05:48:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 05:48:00,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:00,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:00,762 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:00,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:00,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1097574629, now seen corresponding path program 1 times [2019-11-24 05:48:00,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:00,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109303459] [2019-11-24 05:48:00,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:00,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109303459] [2019-11-24 05:48:00,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:00,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:00,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569751566] [2019-11-24 05:48:00,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:00,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:00,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:00,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:00,798 INFO L87 Difference]: Start difference. First operand 2213 states and 2930 transitions. Second operand 3 states. [2019-11-24 05:48:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:01,118 INFO L93 Difference]: Finished difference Result 4102 states and 5512 transitions. [2019-11-24 05:48:01,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:01,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 05:48:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:01,125 INFO L225 Difference]: With dead ends: 4102 [2019-11-24 05:48:01,125 INFO L226 Difference]: Without dead ends: 2233 [2019-11-24 05:48:01,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2019-11-24 05:48:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1971. [2019-11-24 05:48:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-11-24 05:48:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2626 transitions. [2019-11-24 05:48:01,272 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2626 transitions. Word has length 53 [2019-11-24 05:48:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:01,272 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 2626 transitions. [2019-11-24 05:48:01,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2626 transitions. [2019-11-24 05:48:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:48:01,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:01,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:01,275 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:01,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:01,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1858325642, now seen corresponding path program 1 times [2019-11-24 05:48:01,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:01,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440893437] [2019-11-24 05:48:01,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:01,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440893437] [2019-11-24 05:48:01,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:01,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-24 05:48:01,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491429495] [2019-11-24 05:48:01,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:48:01,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:48:01,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:48:01,699 INFO L87 Difference]: Start difference. First operand 1971 states and 2626 transitions. Second operand 12 states. [2019-11-24 05:48:02,071 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-11-24 05:48:02,229 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-11-24 05:48:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:03,583 INFO L93 Difference]: Finished difference Result 3713 states and 4935 transitions. [2019-11-24 05:48:03,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:48:03,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-24 05:48:03,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:03,597 INFO L225 Difference]: With dead ends: 3713 [2019-11-24 05:48:03,597 INFO L226 Difference]: Without dead ends: 3491 [2019-11-24 05:48:03,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-11-24 05:48:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2019-11-24 05:48:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 1959. [2019-11-24 05:48:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-11-24 05:48:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2612 transitions. [2019-11-24 05:48:03,778 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2612 transitions. Word has length 54 [2019-11-24 05:48:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:03,779 INFO L462 AbstractCegarLoop]: Abstraction has 1959 states and 2612 transitions. [2019-11-24 05:48:03,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:48:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2612 transitions. [2019-11-24 05:48:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:48:03,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:03,781 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:03,781 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1760291884, now seen corresponding path program 1 times [2019-11-24 05:48:03,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:03,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154499967] [2019-11-24 05:48:03,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:04,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154499967] [2019-11-24 05:48:04,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:04,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:48:04,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111020821] [2019-11-24 05:48:04,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:48:04,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:48:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:48:04,055 INFO L87 Difference]: Start difference. First operand 1959 states and 2612 transitions. Second operand 11 states. [2019-11-24 05:48:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:06,068 INFO L93 Difference]: Finished difference Result 4069 states and 5389 transitions. [2019-11-24 05:48:06,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-24 05:48:06,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-11-24 05:48:06,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:06,078 INFO L225 Difference]: With dead ends: 4069 [2019-11-24 05:48:06,078 INFO L226 Difference]: Without dead ends: 3831 [2019-11-24 05:48:06,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-11-24 05:48:06,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2019-11-24 05:48:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 1931. [2019-11-24 05:48:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2019-11-24 05:48:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2578 transitions. [2019-11-24 05:48:06,429 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2578 transitions. Word has length 54 [2019-11-24 05:48:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:06,430 INFO L462 AbstractCegarLoop]: Abstraction has 1931 states and 2578 transitions. [2019-11-24 05:48:06,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:48:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2578 transitions. [2019-11-24 05:48:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:48:06,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:06,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:06,432 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:06,432 INFO L82 PathProgramCache]: Analyzing trace with hash 915713314, now seen corresponding path program 1 times [2019-11-24 05:48:06,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:06,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439156922] [2019-11-24 05:48:06,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:06,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439156922] [2019-11-24 05:48:06,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:06,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-24 05:48:06,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204420225] [2019-11-24 05:48:06,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:48:06,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:48:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:48:06,779 INFO L87 Difference]: Start difference. First operand 1931 states and 2578 transitions. Second operand 12 states. [2019-11-24 05:48:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:09,153 INFO L93 Difference]: Finished difference Result 4292 states and 5685 transitions. [2019-11-24 05:48:09,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-24 05:48:09,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-24 05:48:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:09,161 INFO L225 Difference]: With dead ends: 4292 [2019-11-24 05:48:09,161 INFO L226 Difference]: Without dead ends: 4061 [2019-11-24 05:48:09,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2019-11-24 05:48:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states. [2019-11-24 05:48:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 1910. [2019-11-24 05:48:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-11-24 05:48:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2552 transitions. [2019-11-24 05:48:09,448 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2552 transitions. Word has length 54 [2019-11-24 05:48:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:09,448 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2552 transitions. [2019-11-24 05:48:09,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:48:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2552 transitions. [2019-11-24 05:48:09,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:48:09,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:09,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:09,449 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:09,450 INFO L82 PathProgramCache]: Analyzing trace with hash 740512263, now seen corresponding path program 1 times [2019-11-24 05:48:09,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:09,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24546058] [2019-11-24 05:48:09,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:09,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24546058] [2019-11-24 05:48:09,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:09,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:48:09,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573315256] [2019-11-24 05:48:09,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:48:09,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:09,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:48:09,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:48:09,625 INFO L87 Difference]: Start difference. First operand 1910 states and 2552 transitions. Second operand 12 states. [2019-11-24 05:48:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:11,976 INFO L93 Difference]: Finished difference Result 6349 states and 8530 transitions. [2019-11-24 05:48:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-24 05:48:11,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-11-24 05:48:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:11,987 INFO L225 Difference]: With dead ends: 6349 [2019-11-24 05:48:11,987 INFO L226 Difference]: Without dead ends: 5194 [2019-11-24 05:48:11,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=833, Unknown=0, NotChecked=0, Total=1122 [2019-11-24 05:48:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5194 states. [2019-11-24 05:48:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5194 to 2752. [2019-11-24 05:48:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2752 states. [2019-11-24 05:48:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3639 transitions. [2019-11-24 05:48:12,482 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3639 transitions. Word has length 55 [2019-11-24 05:48:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:12,483 INFO L462 AbstractCegarLoop]: Abstraction has 2752 states and 3639 transitions. [2019-11-24 05:48:12,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:48:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3639 transitions. [2019-11-24 05:48:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:48:12,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:12,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:12,484 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1991196533, now seen corresponding path program 1 times [2019-11-24 05:48:12,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:12,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934836753] [2019-11-24 05:48:12,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:12,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934836753] [2019-11-24 05:48:12,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:12,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-24 05:48:12,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906018907] [2019-11-24 05:48:12,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-24 05:48:12,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:12,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-24 05:48:12,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:48:12,686 INFO L87 Difference]: Start difference. First operand 2752 states and 3639 transitions. Second operand 13 states. [2019-11-24 05:48:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:15,870 INFO L93 Difference]: Finished difference Result 10007 states and 13470 transitions. [2019-11-24 05:48:15,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-24 05:48:15,871 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-11-24 05:48:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:15,882 INFO L225 Difference]: With dead ends: 10007 [2019-11-24 05:48:15,882 INFO L226 Difference]: Without dead ends: 7993 [2019-11-24 05:48:15,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2019-11-24 05:48:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states. [2019-11-24 05:48:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 4684. [2019-11-24 05:48:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-11-24 05:48:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 6162 transitions. [2019-11-24 05:48:16,708 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 6162 transitions. Word has length 56 [2019-11-24 05:48:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:16,709 INFO L462 AbstractCegarLoop]: Abstraction has 4684 states and 6162 transitions. [2019-11-24 05:48:16,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-24 05:48:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 6162 transitions. [2019-11-24 05:48:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:48:16,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:16,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:16,710 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:16,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:16,711 INFO L82 PathProgramCache]: Analyzing trace with hash 499216226, now seen corresponding path program 1 times [2019-11-24 05:48:16,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:16,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934582481] [2019-11-24 05:48:16,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:16,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934582481] [2019-11-24 05:48:16,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:16,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:16,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103400483] [2019-11-24 05:48:16,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:16,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:16,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:16,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:16,777 INFO L87 Difference]: Start difference. First operand 4684 states and 6162 transitions. Second operand 3 states. [2019-11-24 05:48:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:17,840 INFO L93 Difference]: Finished difference Result 8795 states and 11787 transitions. [2019-11-24 05:48:17,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:17,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-24 05:48:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:17,850 INFO L225 Difference]: With dead ends: 8795 [2019-11-24 05:48:17,850 INFO L226 Difference]: Without dead ends: 5743 [2019-11-24 05:48:17,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5743 states. [2019-11-24 05:48:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5743 to 5374. [2019-11-24 05:48:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5374 states. [2019-11-24 05:48:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5374 states to 5374 states and 7059 transitions. [2019-11-24 05:48:18,757 INFO L78 Accepts]: Start accepts. Automaton has 5374 states and 7059 transitions. Word has length 56 [2019-11-24 05:48:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:18,758 INFO L462 AbstractCegarLoop]: Abstraction has 5374 states and 7059 transitions. [2019-11-24 05:48:18,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 5374 states and 7059 transitions. [2019-11-24 05:48:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 05:48:18,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:18,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:18,760 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:18,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash 799550387, now seen corresponding path program 1 times [2019-11-24 05:48:18,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:18,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791171498] [2019-11-24 05:48:18,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:18,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791171498] [2019-11-24 05:48:18,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:18,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-24 05:48:18,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730500840] [2019-11-24 05:48:18,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:48:18,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:18,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:48:18,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:48:18,947 INFO L87 Difference]: Start difference. First operand 5374 states and 7059 transitions. Second operand 11 states. [2019-11-24 05:48:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:21,499 INFO L93 Difference]: Finished difference Result 8988 states and 11924 transitions. [2019-11-24 05:48:21,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-24 05:48:21,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-11-24 05:48:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:21,509 INFO L225 Difference]: With dead ends: 8988 [2019-11-24 05:48:21,509 INFO L226 Difference]: Without dead ends: 7406 [2019-11-24 05:48:21,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2019-11-24 05:48:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7406 states. [2019-11-24 05:48:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7406 to 6082. [2019-11-24 05:48:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6082 states. [2019-11-24 05:48:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6082 states to 6082 states and 7988 transitions. [2019-11-24 05:48:22,603 INFO L78 Accepts]: Start accepts. Automaton has 6082 states and 7988 transitions. Word has length 61 [2019-11-24 05:48:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:22,604 INFO L462 AbstractCegarLoop]: Abstraction has 6082 states and 7988 transitions. [2019-11-24 05:48:22,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:48:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6082 states and 7988 transitions. [2019-11-24 05:48:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 05:48:22,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:22,607 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:22,607 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:22,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:22,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1441547489, now seen corresponding path program 1 times [2019-11-24 05:48:22,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:22,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750350023] [2019-11-24 05:48:22,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:22,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750350023] [2019-11-24 05:48:22,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:22,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:22,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465475419] [2019-11-24 05:48:22,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:22,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:22,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:22,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:22,659 INFO L87 Difference]: Start difference. First operand 6082 states and 7988 transitions. Second operand 3 states. [2019-11-24 05:48:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:24,359 INFO L93 Difference]: Finished difference Result 14158 states and 18809 transitions. [2019-11-24 05:48:24,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:24,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-24 05:48:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:24,368 INFO L225 Difference]: With dead ends: 14158 [2019-11-24 05:48:24,369 INFO L226 Difference]: Without dead ends: 9058 [2019-11-24 05:48:24,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9058 states. [2019-11-24 05:48:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9058 to 7918. [2019-11-24 05:48:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7918 states. [2019-11-24 05:48:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 10303 transitions. [2019-11-24 05:48:25,752 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 10303 transitions. Word has length 63 [2019-11-24 05:48:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:25,753 INFO L462 AbstractCegarLoop]: Abstraction has 7918 states and 10303 transitions. [2019-11-24 05:48:25,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 10303 transitions. [2019-11-24 05:48:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 05:48:25,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:25,755 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:25,755 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:25,755 INFO L82 PathProgramCache]: Analyzing trace with hash 445410937, now seen corresponding path program 1 times [2019-11-24 05:48:25,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:25,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683408983] [2019-11-24 05:48:25,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:25,952 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-24 05:48:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:48:25,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683408983] [2019-11-24 05:48:25,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:25,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:48:25,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524311978] [2019-11-24 05:48:25,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:25,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:25,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:25,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:25,967 INFO L87 Difference]: Start difference. First operand 7918 states and 10303 transitions. Second operand 5 states. [2019-11-24 05:48:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:27,018 INFO L93 Difference]: Finished difference Result 11417 states and 14969 transitions. [2019-11-24 05:48:27,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:27,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-24 05:48:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:27,023 INFO L225 Difference]: With dead ends: 11417 [2019-11-24 05:48:27,023 INFO L226 Difference]: Without dead ends: 4905 [2019-11-24 05:48:27,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:27,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-11-24 05:48:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4094. [2019-11-24 05:48:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4094 states. [2019-11-24 05:48:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 5259 transitions. [2019-11-24 05:48:27,878 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 5259 transitions. Word has length 65 [2019-11-24 05:48:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:27,879 INFO L462 AbstractCegarLoop]: Abstraction has 4094 states and 5259 transitions. [2019-11-24 05:48:27,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 5259 transitions. [2019-11-24 05:48:27,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 05:48:27,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:27,881 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:27,881 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:27,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:27,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1826334186, now seen corresponding path program 1 times [2019-11-24 05:48:27,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:27,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919248164] [2019-11-24 05:48:27,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:48:27,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919248164] [2019-11-24 05:48:27,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:27,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:48:27,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585208061] [2019-11-24 05:48:27,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:48:27,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:27,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:48:27,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:48:27,983 INFO L87 Difference]: Start difference. First operand 4094 states and 5259 transitions. Second operand 8 states. [2019-11-24 05:48:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:30,257 INFO L93 Difference]: Finished difference Result 6387 states and 8142 transitions. [2019-11-24 05:48:30,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-24 05:48:30,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-11-24 05:48:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:30,264 INFO L225 Difference]: With dead ends: 6387 [2019-11-24 05:48:30,264 INFO L226 Difference]: Without dead ends: 5902 [2019-11-24 05:48:30,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:48:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5902 states. [2019-11-24 05:48:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5902 to 4080. [2019-11-24 05:48:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4080 states. [2019-11-24 05:48:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 5244 transitions. [2019-11-24 05:48:31,077 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 5244 transitions. Word has length 68 [2019-11-24 05:48:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:31,077 INFO L462 AbstractCegarLoop]: Abstraction has 4080 states and 5244 transitions. [2019-11-24 05:48:31,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:48:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 5244 transitions. [2019-11-24 05:48:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 05:48:31,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:31,080 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:31,080 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:31,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:31,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1105899288, now seen corresponding path program 1 times [2019-11-24 05:48:31,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:31,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535505069] [2019-11-24 05:48:31,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:31,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535505069] [2019-11-24 05:48:31,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406616750] [2019-11-24 05:48:31,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:48:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:31,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-24 05:48:31,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:48:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:48:31,936 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:48:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:48:32,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:48:32,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [16] total 26 [2019-11-24 05:48:32,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097353843] [2019-11-24 05:48:32,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:48:32,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:32,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:48:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2019-11-24 05:48:32,151 INFO L87 Difference]: Start difference. First operand 4080 states and 5244 transitions. Second operand 12 states. [2019-11-24 05:48:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:34,065 INFO L93 Difference]: Finished difference Result 4699 states and 6012 transitions. [2019-11-24 05:48:34,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:48:34,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-11-24 05:48:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:34,075 INFO L225 Difference]: With dead ends: 4699 [2019-11-24 05:48:34,076 INFO L226 Difference]: Without dead ends: 4344 [2019-11-24 05:48:34,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2019-11-24 05:48:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4344 states. [2019-11-24 05:48:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4344 to 4080. [2019-11-24 05:48:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4080 states. [2019-11-24 05:48:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 5243 transitions. [2019-11-24 05:48:35,005 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 5243 transitions. Word has length 68 [2019-11-24 05:48:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:35,005 INFO L462 AbstractCegarLoop]: Abstraction has 4080 states and 5243 transitions. [2019-11-24 05:48:35,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:48:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 5243 transitions. [2019-11-24 05:48:35,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 05:48:35,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:35,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:35,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:48:35,216 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1720650340, now seen corresponding path program 1 times [2019-11-24 05:48:35,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:35,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155038885] [2019-11-24 05:48:35,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:35,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155038885] [2019-11-24 05:48:35,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:35,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:48:35,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814395769] [2019-11-24 05:48:35,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:48:35,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:35,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:48:35,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:35,314 INFO L87 Difference]: Start difference. First operand 4080 states and 5243 transitions. Second operand 7 states. [2019-11-24 05:48:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:36,610 INFO L93 Difference]: Finished difference Result 4974 states and 6357 transitions. [2019-11-24 05:48:36,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:48:36,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-11-24 05:48:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:36,616 INFO L225 Difference]: With dead ends: 4974 [2019-11-24 05:48:36,616 INFO L226 Difference]: Without dead ends: 4972 [2019-11-24 05:48:36,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:48:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2019-11-24 05:48:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 4266. [2019-11-24 05:48:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4266 states. [2019-11-24 05:48:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4266 states to 4266 states and 5480 transitions. [2019-11-24 05:48:37,748 INFO L78 Accepts]: Start accepts. Automaton has 4266 states and 5480 transitions. Word has length 69 [2019-11-24 05:48:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:37,748 INFO L462 AbstractCegarLoop]: Abstraction has 4266 states and 5480 transitions. [2019-11-24 05:48:37,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:48:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4266 states and 5480 transitions. [2019-11-24 05:48:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 05:48:37,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:37,750 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:37,750 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:37,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash 804309730, now seen corresponding path program 1 times [2019-11-24 05:48:37,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:37,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718287082] [2019-11-24 05:48:37,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:38,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718287082] [2019-11-24 05:48:38,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409914615] [2019-11-24 05:48:38,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:48:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:38,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 05:48:38,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:48:38,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:48:39,034 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:48:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:48:39,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:48:39,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [16] total 32 [2019-11-24 05:48:39,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49535964] [2019-11-24 05:48:39,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-24 05:48:39,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:39,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-24 05:48:39,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2019-11-24 05:48:39,338 INFO L87 Difference]: Start difference. First operand 4266 states and 5480 transitions. Second operand 18 states. [2019-11-24 05:48:40,023 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-24 05:48:40,621 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-24 05:48:41,180 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-24 05:48:41,563 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-24 05:48:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:43,882 INFO L93 Difference]: Finished difference Result 10249 states and 13291 transitions. [2019-11-24 05:48:43,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-24 05:48:43,883 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2019-11-24 05:48:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:43,896 INFO L225 Difference]: With dead ends: 10249 [2019-11-24 05:48:43,897 INFO L226 Difference]: Without dead ends: 7314 [2019-11-24 05:48:43,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 121 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=276, Invalid=1616, Unknown=0, NotChecked=0, Total=1892 [2019-11-24 05:48:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7314 states. [2019-11-24 05:48:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7314 to 4379. [2019-11-24 05:48:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4379 states. [2019-11-24 05:48:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4379 states to 4379 states and 5633 transitions. [2019-11-24 05:48:45,011 INFO L78 Accepts]: Start accepts. Automaton has 4379 states and 5633 transitions. Word has length 69 [2019-11-24 05:48:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:45,011 INFO L462 AbstractCegarLoop]: Abstraction has 4379 states and 5633 transitions. [2019-11-24 05:48:45,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-24 05:48:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4379 states and 5633 transitions. [2019-11-24 05:48:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 05:48:45,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:45,012 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:48:45,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:48:45,213 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:45,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1353579686, now seen corresponding path program 1 times [2019-11-24 05:48:45,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:45,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328559962] [2019-11-24 05:48:45,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:45,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328559962] [2019-11-24 05:48:45,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065275159] [2019-11-24 05:48:45,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:48:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:45,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 70 conjunts are in the unsatisfiable core [2019-11-24 05:48:45,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:48:46,830 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-11-24 05:48:46,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:46,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:46,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:46,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:47,249 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:48:47,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:48:47,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,718 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-11-24 05:48:47,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 05:48:47,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:47,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:48,109 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-11-24 05:48:48,331 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-24 05:48:48,598 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-24 05:48:48,822 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-24 05:48:49,109 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-11-24 05:48:49,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:48:49,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:49,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:49,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:49,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:49,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [283845539] [2019-11-24 05:48:49,945 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2019-11-24 05:48:49,945 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:48:49,952 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:48:49,959 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:48:49,959 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs