java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/locks/test_locks_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:47,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:47,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:47,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:47,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:47,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:47,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:47,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:47,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:47,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:47,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:47,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:47,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:47,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:47,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:47,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:47,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:47,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:47,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:47,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:47,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:47,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:47,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:47,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:47,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:47,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:47,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:47,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:47,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:47,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:47,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:47,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:47,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:47,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:47,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:47,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:47,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:47,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:47,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:47,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:47,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:47,377 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:26:47,391 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:47,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:47,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:47,392 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:47,392 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:47,392 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:47,393 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:47,393 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:47,393 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:47,393 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:47,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:47,394 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:47,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:47,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:47,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:47,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:47,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:47,395 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:47,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:47,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:47,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:47,396 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:47,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:47,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:47,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:47,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:47,397 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:47,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:47,398 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:47,398 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:47,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:47,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:47,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:47,460 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:47,460 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:47,461 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-09-20 13:26:47,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e47d575/50c219ab0a0f408b84580b7b2c139a35/FLAG60a5998b3 [2019-09-20 13:26:48,040 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:48,042 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-09-20 13:26:48,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e47d575/50c219ab0a0f408b84580b7b2c139a35/FLAG60a5998b3 [2019-09-20 13:26:48,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e47d575/50c219ab0a0f408b84580b7b2c139a35 [2019-09-20 13:26:48,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:48,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:48,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:48,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:48,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:48,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:48,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2459b071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48, skipping insertion in model container [2019-09-20 13:26:48,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:48,407 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:48,435 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:48,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:48,608 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:48,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:48,766 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:48,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48 WrapperNode [2019-09-20 13:26:48,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:48,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:48,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:48,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:48,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:48,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:48,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:48,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:48,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:48,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:48,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:48,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:48,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:48,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:48,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:48,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (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-09-20 13:26:48,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:48,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:48,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:49,244 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:49,244 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:49,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:49 BoogieIcfgContainer [2019-09-20 13:26:49,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:49,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:49,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:49,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:49,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:48" (1/3) ... [2019-09-20 13:26:49,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b0a677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:49, skipping insertion in model container [2019-09-20 13:26:49,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (2/3) ... [2019-09-20 13:26:49,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b0a677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:49, skipping insertion in model container [2019-09-20 13:26:49,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:49" (3/3) ... [2019-09-20 13:26:49,254 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-09-20 13:26:49,264 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:49,274 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:49,288 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:49,319 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:49,320 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:49,320 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:49,320 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:49,320 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:49,320 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:49,321 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:49,321 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-09-20 13:26:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:49,345 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:49,346 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:49,349 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:49,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:49,355 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2019-09-20 13:26:49,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:49,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:49,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:49,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:49,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:49,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:49,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:49,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:49,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:49,568 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-09-20 13:26:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:49,623 INFO L93 Difference]: Finished difference Result 86 states and 149 transitions. [2019-09-20 13:26:49,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:49,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:49,637 INFO L225 Difference]: With dead ends: 86 [2019-09-20 13:26:49,637 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 13:26:49,639 INFO L636 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-09-20 13:26:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 13:26:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2019-09-20 13:26:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-20 13:26:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-09-20 13:26:49,685 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2019-09-20 13:26:49,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:49,686 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-09-20 13:26:49,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-09-20 13:26:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:49,689 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:49,689 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:49,691 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2019-09-20 13:26:49,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:49,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:49,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:49,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:49,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:49,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:49,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:49,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:49,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:49,763 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-09-20 13:26:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:49,802 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2019-09-20 13:26:49,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:49,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:49,805 INFO L225 Difference]: With dead ends: 78 [2019-09-20 13:26:49,805 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 13:26:49,806 INFO L636 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-09-20 13:26:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 13:26:49,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-20 13:26:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-20 13:26:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2019-09-20 13:26:49,817 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2019-09-20 13:26:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:49,818 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2019-09-20 13:26:49,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2019-09-20 13:26:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:49,820 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:49,820 INFO L407 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] [2019-09-20 13:26:49,820 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:49,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:49,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2019-09-20 13:26:49,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:49,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:49,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:49,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:49,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:49,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:49,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:49,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:49,885 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2019-09-20 13:26:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:49,928 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2019-09-20 13:26:49,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:49,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:49,930 INFO L225 Difference]: With dead ends: 81 [2019-09-20 13:26:49,930 INFO L226 Difference]: Without dead ends: 81 [2019-09-20 13:26:49,931 INFO L636 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-09-20 13:26:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-20 13:26:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-09-20 13:26:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-20 13:26:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2019-09-20 13:26:49,948 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2019-09-20 13:26:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:49,949 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2019-09-20 13:26:49,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2019-09-20 13:26:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:49,953 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:49,954 INFO L407 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] [2019-09-20 13:26:49,954 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:49,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2019-09-20 13:26:49,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,046 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2019-09-20 13:26:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,074 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2019-09-20 13:26:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,077 INFO L225 Difference]: With dead ends: 146 [2019-09-20 13:26:50,077 INFO L226 Difference]: Without dead ends: 146 [2019-09-20 13:26:50,078 INFO L636 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-09-20 13:26:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-20 13:26:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-09-20 13:26:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-20 13:26:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2019-09-20 13:26:50,095 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2019-09-20 13:26:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,096 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2019-09-20 13:26:50,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2019-09-20 13:26:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:50,097 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,097 INFO L407 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] [2019-09-20 13:26:50,098 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,098 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2019-09-20 13:26:50,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,147 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2019-09-20 13:26:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,171 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2019-09-20 13:26:50,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:50,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,173 INFO L225 Difference]: With dead ends: 148 [2019-09-20 13:26:50,173 INFO L226 Difference]: Without dead ends: 148 [2019-09-20 13:26:50,174 INFO L636 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-09-20 13:26:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-20 13:26:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2019-09-20 13:26:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-20 13:26:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2019-09-20 13:26:50,189 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2019-09-20 13:26:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,190 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2019-09-20 13:26:50,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2019-09-20 13:26:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:50,191 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,192 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,192 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,193 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2019-09-20 13:26:50,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,241 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2019-09-20 13:26:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,279 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2019-09-20 13:26:50,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:50,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,282 INFO L225 Difference]: With dead ends: 150 [2019-09-20 13:26:50,282 INFO L226 Difference]: Without dead ends: 150 [2019-09-20 13:26:50,283 INFO L636 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-09-20 13:26:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-20 13:26:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-20 13:26:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-20 13:26:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2019-09-20 13:26:50,310 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2019-09-20 13:26:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,310 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2019-09-20 13:26:50,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2019-09-20 13:26:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:50,314 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,314 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,314 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2019-09-20 13:26:50,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,390 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2019-09-20 13:26:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,420 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2019-09-20 13:26:50,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,425 INFO L225 Difference]: With dead ends: 274 [2019-09-20 13:26:50,425 INFO L226 Difference]: Without dead ends: 274 [2019-09-20 13:26:50,426 INFO L636 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-09-20 13:26:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-20 13:26:50,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2019-09-20 13:26:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:26:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2019-09-20 13:26:50,441 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2019-09-20 13:26:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,441 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2019-09-20 13:26:50,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2019-09-20 13:26:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:50,444 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,444 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,444 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2019-09-20 13:26:50,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,488 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2019-09-20 13:26:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,526 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2019-09-20 13:26:50,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,528 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:26:50,528 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:26:50,529 INFO L636 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-09-20 13:26:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:26:50,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-09-20 13:26:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-20 13:26:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2019-09-20 13:26:50,539 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2019-09-20 13:26:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,539 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2019-09-20 13:26:50,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2019-09-20 13:26:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:50,541 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,541 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,541 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2019-09-20 13:26:50,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,590 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2019-09-20 13:26:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,604 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2019-09-20 13:26:50,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,607 INFO L225 Difference]: With dead ends: 286 [2019-09-20 13:26:50,607 INFO L226 Difference]: Without dead ends: 286 [2019-09-20 13:26:50,607 INFO L636 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-09-20 13:26:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-20 13:26:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-09-20 13:26:50,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-20 13:26:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2019-09-20 13:26:50,616 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2019-09-20 13:26:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,617 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2019-09-20 13:26:50,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2019-09-20 13:26:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:50,618 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,618 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,619 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2019-09-20 13:26:50,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,673 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2019-09-20 13:26:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,699 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2019-09-20 13:26:50,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,705 INFO L225 Difference]: With dead ends: 522 [2019-09-20 13:26:50,705 INFO L226 Difference]: Without dead ends: 522 [2019-09-20 13:26:50,706 INFO L636 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-09-20 13:26:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-20 13:26:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2019-09-20 13:26:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-20 13:26:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2019-09-20 13:26:50,728 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2019-09-20 13:26:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,733 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2019-09-20 13:26:50,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2019-09-20 13:26:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:50,735 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,735 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,736 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2019-09-20 13:26:50,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,786 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2019-09-20 13:26:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,813 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2019-09-20 13:26:50,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,818 INFO L225 Difference]: With dead ends: 546 [2019-09-20 13:26:50,818 INFO L226 Difference]: Without dead ends: 546 [2019-09-20 13:26:50,818 INFO L636 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-09-20 13:26:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-20 13:26:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-09-20 13:26:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-20 13:26:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2019-09-20 13:26:50,833 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2019-09-20 13:26:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,833 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2019-09-20 13:26:50,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2019-09-20 13:26:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:50,837 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,838 INFO L407 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] [2019-09-20 13:26:50,838 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,838 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2019-09-20 13:26:50,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,874 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2019-09-20 13:26:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,891 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2019-09-20 13:26:50,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,896 INFO L225 Difference]: With dead ends: 554 [2019-09-20 13:26:50,896 INFO L226 Difference]: Without dead ends: 554 [2019-09-20 13:26:50,896 INFO L636 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-09-20 13:26:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-20 13:26:50,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-09-20 13:26:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-20 13:26:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2019-09-20 13:26:50,911 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2019-09-20 13:26:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,912 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2019-09-20 13:26:50,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2019-09-20 13:26:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:50,913 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,913 INFO L407 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] [2019-09-20 13:26:50,913 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2019-09-20 13:26:50,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,951 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2019-09-20 13:26:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,970 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2019-09-20 13:26:50,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,976 INFO L225 Difference]: With dead ends: 1002 [2019-09-20 13:26:50,976 INFO L226 Difference]: Without dead ends: 1002 [2019-09-20 13:26:50,976 INFO L636 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-09-20 13:26:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-09-20 13:26:50,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2019-09-20 13:26:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-09-20 13:26:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2019-09-20 13:26:50,997 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2019-09-20 13:26:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,997 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2019-09-20 13:26:50,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2019-09-20 13:26:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:50,999 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,999 INFO L407 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] [2019-09-20 13:26:51,000 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2019-09-20 13:26:51,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,029 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2019-09-20 13:26:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,049 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2019-09-20 13:26:51,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,055 INFO L225 Difference]: With dead ends: 1066 [2019-09-20 13:26:51,055 INFO L226 Difference]: Without dead ends: 1066 [2019-09-20 13:26:51,056 INFO L636 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-09-20 13:26:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-09-20 13:26:51,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2019-09-20 13:26:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-09-20 13:26:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2019-09-20 13:26:51,083 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2019-09-20 13:26:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,083 INFO L475 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2019-09-20 13:26:51,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2019-09-20 13:26:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:51,086 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,086 INFO L407 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] [2019-09-20 13:26:51,086 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2019-09-20 13:26:51,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,108 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2019-09-20 13:26:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,126 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2019-09-20 13:26:51,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,132 INFO L225 Difference]: With dead ends: 1082 [2019-09-20 13:26:51,132 INFO L226 Difference]: Without dead ends: 1082 [2019-09-20 13:26:51,133 INFO L636 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-09-20 13:26:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-20 13:26:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2019-09-20 13:26:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-09-20 13:26:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2019-09-20 13:26:51,158 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2019-09-20 13:26:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,158 INFO L475 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2019-09-20 13:26:51,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2019-09-20 13:26:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:51,161 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,161 INFO L407 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] [2019-09-20 13:26:51,161 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2019-09-20 13:26:51,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,185 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2019-09-20 13:26:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,208 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2019-09-20 13:26:51,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,218 INFO L225 Difference]: With dead ends: 1930 [2019-09-20 13:26:51,219 INFO L226 Difference]: Without dead ends: 1930 [2019-09-20 13:26:51,219 INFO L636 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-09-20 13:26:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-09-20 13:26:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2019-09-20 13:26:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-09-20 13:26:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2019-09-20 13:26:51,263 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2019-09-20 13:26:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,263 INFO L475 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2019-09-20 13:26:51,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2019-09-20 13:26:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:51,267 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,267 INFO L407 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] [2019-09-20 13:26:51,268 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2019-09-20 13:26:51,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,304 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2019-09-20 13:26:51,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,331 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2019-09-20 13:26:51,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:51,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,342 INFO L225 Difference]: With dead ends: 2090 [2019-09-20 13:26:51,343 INFO L226 Difference]: Without dead ends: 2090 [2019-09-20 13:26:51,343 INFO L636 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-09-20 13:26:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-09-20 13:26:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2019-09-20 13:26:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-09-20 13:26:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2019-09-20 13:26:51,392 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2019-09-20 13:26:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,392 INFO L475 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2019-09-20 13:26:51,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2019-09-20 13:26:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:51,396 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,396 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,396 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2019-09-20 13:26:51,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,417 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2019-09-20 13:26:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,444 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2019-09-20 13:26:51,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,455 INFO L225 Difference]: With dead ends: 2122 [2019-09-20 13:26:51,456 INFO L226 Difference]: Without dead ends: 2122 [2019-09-20 13:26:51,456 INFO L636 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-09-20 13:26:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-09-20 13:26:51,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2019-09-20 13:26:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-09-20 13:26:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2019-09-20 13:26:51,525 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2019-09-20 13:26:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,525 INFO L475 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2019-09-20 13:26:51,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2019-09-20 13:26:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:51,530 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,531 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,531 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2019-09-20 13:26:51,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,560 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2019-09-20 13:26:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,608 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2019-09-20 13:26:51,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,632 INFO L225 Difference]: With dead ends: 3722 [2019-09-20 13:26:51,632 INFO L226 Difference]: Without dead ends: 3722 [2019-09-20 13:26:51,633 INFO L636 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-09-20 13:26:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-20 13:26:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2019-09-20 13:26:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-09-20 13:26:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2019-09-20 13:26:51,742 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2019-09-20 13:26:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,742 INFO L475 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2019-09-20 13:26:51,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2019-09-20 13:26:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:51,751 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,751 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,752 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,753 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2019-09-20 13:26:51,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,783 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2019-09-20 13:26:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,830 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2019-09-20 13:26:51,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,855 INFO L225 Difference]: With dead ends: 4106 [2019-09-20 13:26:51,856 INFO L226 Difference]: Without dead ends: 4106 [2019-09-20 13:26:51,856 INFO L636 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-09-20 13:26:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-09-20 13:26:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2019-09-20 13:26:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-09-20 13:26:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2019-09-20 13:26:51,983 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2019-09-20 13:26:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,983 INFO L475 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2019-09-20 13:26:51,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2019-09-20 13:26:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:51,991 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,991 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,992 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2019-09-20 13:26:51,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,026 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2019-09-20 13:26:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,066 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2019-09-20 13:26:52,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,112 INFO L225 Difference]: With dead ends: 4170 [2019-09-20 13:26:52,112 INFO L226 Difference]: Without dead ends: 4170 [2019-09-20 13:26:52,113 INFO L636 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-09-20 13:26:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-09-20 13:26:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2019-09-20 13:26:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-09-20 13:26:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2019-09-20 13:26:52,262 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2019-09-20 13:26:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,263 INFO L475 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2019-09-20 13:26:52,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2019-09-20 13:26:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:52,269 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,269 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:52,270 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,270 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2019-09-20 13:26:52,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,306 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2019-09-20 13:26:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,358 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2019-09-20 13:26:52,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,378 INFO L225 Difference]: With dead ends: 8074 [2019-09-20 13:26:52,378 INFO L226 Difference]: Without dead ends: 8074 [2019-09-20 13:26:52,379 INFO L636 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-09-20 13:26:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-09-20 13:26:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2019-09-20 13:26:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-09-20 13:26:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2019-09-20 13:26:52,535 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2019-09-20 13:26:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,536 INFO L475 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2019-09-20 13:26:52,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2019-09-20 13:26:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:52,546 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,546 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:52,547 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2019-09-20 13:26:52,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,579 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2019-09-20 13:26:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,635 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2019-09-20 13:26:52,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,658 INFO L225 Difference]: With dead ends: 9098 [2019-09-20 13:26:52,659 INFO L226 Difference]: Without dead ends: 9098 [2019-09-20 13:26:52,660 INFO L636 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-09-20 13:26:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2019-09-20 13:26:52,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2019-09-20 13:26:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-09-20 13:26:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2019-09-20 13:26:52,935 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2019-09-20 13:26:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,936 INFO L475 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2019-09-20 13:26:52,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2019-09-20 13:26:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:52,952 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,952 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:52,953 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2019-09-20 13:26:52,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,980 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2019-09-20 13:26:53,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,042 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2019-09-20 13:26:53,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,074 INFO L225 Difference]: With dead ends: 13706 [2019-09-20 13:26:53,075 INFO L226 Difference]: Without dead ends: 13706 [2019-09-20 13:26:53,080 INFO L636 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-09-20 13:26:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2019-09-20 13:26:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2019-09-20 13:26:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2019-09-20 13:26:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2019-09-20 13:26:53,320 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2019-09-20 13:26:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,320 INFO L475 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2019-09-20 13:26:53,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2019-09-20 13:26:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:53,341 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,341 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:53,341 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2019-09-20 13:26:53,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,365 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2019-09-20 13:26:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,430 INFO L93 Difference]: Finished difference Result 15754 states and 19975 transitions. [2019-09-20 13:26:53,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,465 INFO L225 Difference]: With dead ends: 15754 [2019-09-20 13:26:53,465 INFO L226 Difference]: Without dead ends: 15754 [2019-09-20 13:26:53,466 INFO L636 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-09-20 13:26:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2019-09-20 13:26:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2019-09-20 13:26:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-09-20 13:26:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2019-09-20 13:26:53,890 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2019-09-20 13:26:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,891 INFO L475 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2019-09-20 13:26:53,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2019-09-20 13:26:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:53,914 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,914 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:53,915 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2019-09-20 13:26:53,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,939 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2019-09-20 13:26:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,997 INFO L93 Difference]: Finished difference Result 16138 states and 20231 transitions. [2019-09-20 13:26:53,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,030 INFO L225 Difference]: With dead ends: 16138 [2019-09-20 13:26:54,031 INFO L226 Difference]: Without dead ends: 16138 [2019-09-20 13:26:54,031 INFO L636 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-09-20 13:26:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2019-09-20 13:26:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2019-09-20 13:26:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-09-20 13:26:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2019-09-20 13:26:54,311 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2019-09-20 13:26:54,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,311 INFO L475 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2019-09-20 13:26:54,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2019-09-20 13:26:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:54,332 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,333 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,333 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,336 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2019-09-20 13:26:54,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:54,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,828 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2019-09-20 13:26:54,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,912 INFO L93 Difference]: Finished difference Result 26634 states and 33031 transitions. [2019-09-20 13:26:54,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,974 INFO L225 Difference]: With dead ends: 26634 [2019-09-20 13:26:54,974 INFO L226 Difference]: Without dead ends: 26634 [2019-09-20 13:26:54,975 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-09-20 13:26:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2019-09-20 13:26:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-09-20 13:26:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2019-09-20 13:26:55,333 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2019-09-20 13:26:55,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,333 INFO L475 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2019-09-20 13:26:55,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2019-09-20 13:26:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:55,374 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,374 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,374 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,375 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2019-09-20 13:26:55,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,400 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2019-09-20 13:26:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,495 INFO L93 Difference]: Finished difference Result 31242 states and 36871 transitions. [2019-09-20 13:26:55,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:55,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,560 INFO L225 Difference]: With dead ends: 31242 [2019-09-20 13:26:55,560 INFO L226 Difference]: Without dead ends: 31242 [2019-09-20 13:26:55,560 INFO L636 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-09-20 13:26:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2019-09-20 13:26:56,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2019-09-20 13:26:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2019-09-20 13:26:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2019-09-20 13:26:56,125 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2019-09-20 13:26:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:56,125 INFO L475 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2019-09-20 13:26:56,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2019-09-20 13:26:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:56,162 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,162 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:56,162 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2019-09-20 13:26:56,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:56,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:56,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:56,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,190 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2019-09-20 13:26:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,287 INFO L93 Difference]: Finished difference Result 31754 states and 36871 transitions. [2019-09-20 13:26:56,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:56,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,349 INFO L225 Difference]: With dead ends: 31754 [2019-09-20 13:26:56,349 INFO L226 Difference]: Without dead ends: 31754 [2019-09-20 13:26:56,351 INFO L636 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-09-20 13:26:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-09-20 13:26:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2019-09-20 13:26:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2019-09-20 13:26:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2019-09-20 13:26:56,872 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2019-09-20 13:26:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:56,872 INFO L475 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2019-09-20 13:26:56,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2019-09-20 13:26:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:56,904 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,905 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:56,905 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2019-09-20 13:26:56,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:56,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:56,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:56,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,932 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2019-09-20 13:26:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:57,049 INFO L93 Difference]: Finished difference Result 51208 states and 57862 transitions. [2019-09-20 13:26:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:57,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:57,119 INFO L225 Difference]: With dead ends: 51208 [2019-09-20 13:26:57,120 INFO L226 Difference]: Without dead ends: 51208 [2019-09-20 13:26:57,121 INFO L636 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-09-20 13:26:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2019-09-20 13:26:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2019-09-20 13:26:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2019-09-20 13:26:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2019-09-20 13:26:57,900 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2019-09-20 13:26:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:57,900 INFO L475 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2019-09-20 13:26:57,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2019-09-20 13:26:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:57,965 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:57,965 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:57,966 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:57,966 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2019-09-20 13:26:57,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:57,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:57,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:57,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:57,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:57,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:57,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:57,991 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2019-09-20 13:26:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,143 INFO L93 Difference]: Finished difference Result 61446 states and 66565 transitions. [2019-09-20 13:26:58,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,144 INFO L225 Difference]: With dead ends: 61446 [2019-09-20 13:26:58,144 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:26:58,144 INFO L636 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-09-20 13:26:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:26:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:26:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:26:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:26:58,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-09-20 13:26:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,145 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:26:58,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:26:58,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:26:58,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:26:58 BoogieIcfgContainer [2019-09-20 13:26:58,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:26:58,159 INFO L168 Benchmark]: Toolchain (without parser) took 9771.30 ms. Allocated memory was 132.1 MB in the beginning and 643.3 MB in the end (delta: 511.2 MB). Free memory was 87.0 MB in the beginning and 217.7 MB in the end (delta: -130.7 MB). Peak memory consumption was 380.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:58,161 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 132.1 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:26:58,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.03 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 86.8 MB in the beginning and 176.2 MB in the end (delta: -89.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:58,167 INFO L168 Benchmark]: Boogie Preprocessor took 41.51 ms. Allocated memory is still 198.7 MB. Free memory was 176.2 MB in the beginning and 173.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:58,168 INFO L168 Benchmark]: RCFGBuilder took 436.16 ms. Allocated memory is still 198.7 MB. Free memory was 173.3 MB in the beginning and 153.8 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:58,168 INFO L168 Benchmark]: TraceAbstraction took 8909.00 ms. Allocated memory was 198.7 MB in the beginning and 643.3 MB in the end (delta: 444.6 MB). Free memory was 153.2 MB in the beginning and 217.7 MB in the end (delta: -64.6 MB). Peak memory consumption was 380.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:58,176 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 132.1 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 378.03 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 86.8 MB in the beginning and 176.2 MB in the end (delta: -89.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.51 ms. Allocated memory is still 198.7 MB. Free memory was 176.2 MB in the beginning and 173.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 436.16 ms. Allocated memory is still 198.7 MB. Free memory was 173.3 MB in the beginning and 153.8 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8909.00 ms. Allocated memory was 198.7 MB in the beginning and 643.3 MB in the end (delta: 444.6 MB). Free memory was 153.2 MB in the beginning and 217.7 MB in the end (delta: -64.6 MB). Peak memory consumption was 380.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. SAFE Result, 8.8s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...