/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:32:43,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:32:43,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:32:43,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:32:43,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:32:43,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:32:43,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:32:43,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:32:43,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:32:43,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:32:43,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:32:43,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:32:43,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:32:43,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:32:43,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:32:43,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:32:43,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:32:43,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:32:43,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:32:43,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:32:43,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:32:43,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:32:43,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:32:43,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:32:43,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:32:43,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:32:43,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:32:43,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:32:43,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:32:43,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:32:43,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:32:43,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:32:43,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:32:43,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:32:43,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:32:43,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:32:43,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:32:43,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:32:43,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:32:43,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:32:43,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:32:43,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 00:32:43,600 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:32:43,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:32:43,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:32:43,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:32:43,603 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:32:43,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:32:43,603 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:32:43,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:32:43,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:32:43,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:32:43,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:32:43,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:32:43,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:32:43,606 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:32:43,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:32:43,607 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:32:43,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:32:43,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:32:43,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:32:43,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:32:43,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:32:43,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:32:43,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:32:43,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:32:43,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:32:43,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:32:43,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:32:43,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:32:43,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:32:43,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:32:43,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:32:43,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:32:43,909 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:32:43,910 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:32:43,910 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2019-11-07 00:32:43,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacb9c442/76d578ee005f494aa2e31653e7ad1f45/FLAG7f8438367 [2019-11-07 00:32:44,462 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:32:44,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-11-07 00:32:44,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacb9c442/76d578ee005f494aa2e31653e7ad1f45/FLAG7f8438367 [2019-11-07 00:32:44,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacb9c442/76d578ee005f494aa2e31653e7ad1f45 [2019-11-07 00:32:44,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:32:44,853 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:32:44,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:32:44,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:32:44,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:32:44,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:44" (1/1) ... [2019-11-07 00:32:44,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af58c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:44, skipping insertion in model container [2019-11-07 00:32:44,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:44" (1/1) ... [2019-11-07 00:32:44,872 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:32:44,896 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:32:45,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:32:45,089 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:32:45,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:32:45,205 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:32:45,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:45 WrapperNode [2019-11-07 00:32:45,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:32:45,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:32:45,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:32:45,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:32:45,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:45" (1/1) ... [2019-11-07 00:32:45,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:45" (1/1) ... [2019-11-07 00:32:45,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:45" (1/1) ... [2019-11-07 00:32:45,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:45" (1/1) ... [2019-11-07 00:32:45,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:45" (1/1) ... [2019-11-07 00:32:45,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:45" (1/1) ... [2019-11-07 00:32:45,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:45" (1/1) ... [2019-11-07 00:32:45,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:32:45,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:32:45,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:32:45,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:32:45,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:32:45,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:32:45,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:32:45,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:32:45,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:32:45,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:32:45,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:32:45,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:32:45,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:32:45,564 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:32:45,564 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 00:32:45,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:45 BoogieIcfgContainer [2019-11-07 00:32:45,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:32:45,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:32:45,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:32:45,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:32:45,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:32:44" (1/3) ... [2019-11-07 00:32:45,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1a8343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:45, skipping insertion in model container [2019-11-07 00:32:45,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:45" (2/3) ... [2019-11-07 00:32:45,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1a8343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:45, skipping insertion in model container [2019-11-07 00:32:45,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:45" (3/3) ... [2019-11-07 00:32:45,583 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-11-07 00:32:45,594 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:32:45,602 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:32:45,619 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:32:45,642 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:32:45,642 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:32:45,643 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:32:45,643 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:32:45,643 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:32:45,643 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:32:45,643 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:32:45,643 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:32:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-07 00:32:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:32:45,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:45,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:45,671 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:45,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:45,677 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-11-07 00:32:45,687 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:45,687 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289394484] [2019-11-07 00:32:45,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:45,845 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289394484] [2019-11-07 00:32:45,845 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:45,846 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:45,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326672604] [2019-11-07 00:32:45,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:45,853 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:45,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:45,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:45,870 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-11-07 00:32:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:45,951 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2019-11-07 00:32:45,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:45,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-07 00:32:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:45,971 INFO L225 Difference]: With dead ends: 63 [2019-11-07 00:32:45,972 INFO L226 Difference]: Without dead ends: 48 [2019-11-07 00:32:45,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-07 00:32:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-11-07 00:32:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-07 00:32:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-11-07 00:32:46,049 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-11-07 00:32:46,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,050 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-11-07 00:32:46,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-11-07 00:32:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:32:46,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,056 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-11-07 00:32:46,057 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,059 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789317238] [2019-11-07 00:32:46,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,185 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789317238] [2019-11-07 00:32:46,185 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,185 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673978593] [2019-11-07 00:32:46,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,188 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,190 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-11-07 00:32:46,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,229 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2019-11-07 00:32:46,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-07 00:32:46,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,234 INFO L225 Difference]: With dead ends: 77 [2019-11-07 00:32:46,234 INFO L226 Difference]: Without dead ends: 48 [2019-11-07 00:32:46,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-07 00:32:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-11-07 00:32:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-07 00:32:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-11-07 00:32:46,250 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-11-07 00:32:46,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,250 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-11-07 00:32:46,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-11-07 00:32:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:32:46,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,253 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-11-07 00:32:46,254 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,255 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390946404] [2019-11-07 00:32:46,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,324 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390946404] [2019-11-07 00:32:46,325 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,325 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230768503] [2019-11-07 00:32:46,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,326 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,327 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-11-07 00:32:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,358 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2019-11-07 00:32:46,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-07 00:32:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,360 INFO L225 Difference]: With dead ends: 72 [2019-11-07 00:32:46,361 INFO L226 Difference]: Without dead ends: 51 [2019-11-07 00:32:46,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-07 00:32:46,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-11-07 00:32:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-07 00:32:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-11-07 00:32:46,375 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-11-07 00:32:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,375 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-11-07 00:32:46,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-11-07 00:32:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:32:46,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,377 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,377 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-11-07 00:32:46,378 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,378 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951687247] [2019-11-07 00:32:46,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,422 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951687247] [2019-11-07 00:32:46,422 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,422 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612724965] [2019-11-07 00:32:46,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,424 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,425 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-11-07 00:32:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,462 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2019-11-07 00:32:46,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-07 00:32:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,466 INFO L225 Difference]: With dead ends: 88 [2019-11-07 00:32:46,466 INFO L226 Difference]: Without dead ends: 86 [2019-11-07 00:32:46,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-07 00:32:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-11-07 00:32:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-07 00:32:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-11-07 00:32:46,487 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-11-07 00:32:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,488 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-11-07 00:32:46,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-11-07 00:32:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:32:46,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,490 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-11-07 00:32:46,491 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,491 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572771710] [2019-11-07 00:32:46,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,521 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572771710] [2019-11-07 00:32:46,522 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,522 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259512744] [2019-11-07 00:32:46,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,523 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,524 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-11-07 00:32:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,561 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2019-11-07 00:32:46,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-07 00:32:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,564 INFO L225 Difference]: With dead ends: 144 [2019-11-07 00:32:46,567 INFO L226 Difference]: Without dead ends: 88 [2019-11-07 00:32:46,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-07 00:32:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-07 00:32:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-07 00:32:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-11-07 00:32:46,578 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-11-07 00:32:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,579 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-11-07 00:32:46,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-11-07 00:32:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:32:46,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,581 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-11-07 00:32:46,581 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,582 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020282092] [2019-11-07 00:32:46,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,614 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020282092] [2019-11-07 00:32:46,614 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,614 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287548137] [2019-11-07 00:32:46,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,615 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,616 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-11-07 00:32:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,642 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2019-11-07 00:32:46,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 00:32:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,646 INFO L225 Difference]: With dead ends: 129 [2019-11-07 00:32:46,648 INFO L226 Difference]: Without dead ends: 90 [2019-11-07 00:32:46,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-07 00:32:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-07 00:32:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-07 00:32:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-11-07 00:32:46,669 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-11-07 00:32:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,670 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-11-07 00:32:46,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-11-07 00:32:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:32:46,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,673 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,673 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-11-07 00:32:46,674 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,674 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039181848] [2019-11-07 00:32:46,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,704 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039181848] [2019-11-07 00:32:46,704 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,704 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135726989] [2019-11-07 00:32:46,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,705 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,706 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-11-07 00:32:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,735 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2019-11-07 00:32:46,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 00:32:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,737 INFO L225 Difference]: With dead ends: 156 [2019-11-07 00:32:46,737 INFO L226 Difference]: Without dead ends: 154 [2019-11-07 00:32:46,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-07 00:32:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-11-07 00:32:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-07 00:32:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-11-07 00:32:46,759 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-11-07 00:32:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,763 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-11-07 00:32:46,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-11-07 00:32:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:32:46,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,766 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-11-07 00:32:46,766 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,767 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249422251] [2019-11-07 00:32:46,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,812 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249422251] [2019-11-07 00:32:46,812 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,813 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926069258] [2019-11-07 00:32:46,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,814 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,814 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-11-07 00:32:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,840 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2019-11-07 00:32:46,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 00:32:46,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,843 INFO L225 Difference]: With dead ends: 272 [2019-11-07 00:32:46,843 INFO L226 Difference]: Without dead ends: 162 [2019-11-07 00:32:46,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-07 00:32:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-11-07 00:32:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-07 00:32:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-11-07 00:32:46,858 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-11-07 00:32:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,858 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-11-07 00:32:46,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-11-07 00:32:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:32:46,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,860 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,860 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-11-07 00:32:46,861 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,861 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075379733] [2019-11-07 00:32:46,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,892 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075379733] [2019-11-07 00:32:46,892 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,893 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445689374] [2019-11-07 00:32:46,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,894 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,894 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-11-07 00:32:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,925 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2019-11-07 00:32:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-07 00:32:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,927 INFO L225 Difference]: With dead ends: 240 [2019-11-07 00:32:46,927 INFO L226 Difference]: Without dead ends: 166 [2019-11-07 00:32:46,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-07 00:32:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-11-07 00:32:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-07 00:32:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-11-07 00:32:46,938 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-11-07 00:32:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:46,939 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-11-07 00:32:46,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-11-07 00:32:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:32:46,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:46,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:46,941 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:46,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:46,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-11-07 00:32:46,941 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:46,941 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059964613] [2019-11-07 00:32:46,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:46,968 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059964613] [2019-11-07 00:32:46,968 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:46,968 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:46,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29184111] [2019-11-07 00:32:46,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:46,969 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:46,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,969 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-11-07 00:32:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:46,994 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2019-11-07 00:32:46,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:46,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-07 00:32:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:46,996 INFO L225 Difference]: With dead ends: 284 [2019-11-07 00:32:46,997 INFO L226 Difference]: Without dead ends: 282 [2019-11-07 00:32:46,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-07 00:32:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-11-07 00:32:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-07 00:32:47,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-11-07 00:32:47,008 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-11-07 00:32:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,008 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-11-07 00:32:47,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-11-07 00:32:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:32:47,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,010 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,011 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-11-07 00:32:47,011 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,012 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109078020] [2019-11-07 00:32:47,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,038 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109078020] [2019-11-07 00:32:47,039 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,039 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72662999] [2019-11-07 00:32:47,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,040 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,040 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-11-07 00:32:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,081 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2019-11-07 00:32:47,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-07 00:32:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,087 INFO L225 Difference]: With dead ends: 524 [2019-11-07 00:32:47,087 INFO L226 Difference]: Without dead ends: 306 [2019-11-07 00:32:47,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-07 00:32:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-11-07 00:32:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-07 00:32:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-11-07 00:32:47,110 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-11-07 00:32:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,110 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-11-07 00:32:47,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-11-07 00:32:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:32:47,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,115 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,115 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-11-07 00:32:47,116 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,116 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685206644] [2019-11-07 00:32:47,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,156 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685206644] [2019-11-07 00:32:47,156 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,157 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497049489] [2019-11-07 00:32:47,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,157 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,158 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-11-07 00:32:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,177 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2019-11-07 00:32:47,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-07 00:32:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,182 INFO L225 Difference]: With dead ends: 456 [2019-11-07 00:32:47,182 INFO L226 Difference]: Without dead ends: 314 [2019-11-07 00:32:47,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-07 00:32:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-11-07 00:32:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-07 00:32:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-11-07 00:32:47,197 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-11-07 00:32:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,197 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-11-07 00:32:47,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-11-07 00:32:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:32:47,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,199 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,199 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-11-07 00:32:47,199 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,199 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611795901] [2019-11-07 00:32:47,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,246 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611795901] [2019-11-07 00:32:47,247 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,247 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218469493] [2019-11-07 00:32:47,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,249 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,249 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-11-07 00:32:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,272 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2019-11-07 00:32:47,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-07 00:32:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,277 INFO L225 Difference]: With dead ends: 524 [2019-11-07 00:32:47,277 INFO L226 Difference]: Without dead ends: 522 [2019-11-07 00:32:47,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-07 00:32:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-11-07 00:32:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-07 00:32:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-11-07 00:32:47,295 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-11-07 00:32:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,295 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-11-07 00:32:47,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-11-07 00:32:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:32:47,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,300 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-11-07 00:32:47,300 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,302 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271384512] [2019-11-07 00:32:47,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,343 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271384512] [2019-11-07 00:32:47,344 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,344 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688947947] [2019-11-07 00:32:47,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,345 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,345 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-11-07 00:32:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,381 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2019-11-07 00:32:47,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-07 00:32:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,386 INFO L225 Difference]: With dead ends: 1020 [2019-11-07 00:32:47,386 INFO L226 Difference]: Without dead ends: 586 [2019-11-07 00:32:47,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-07 00:32:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-11-07 00:32:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-07 00:32:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-11-07 00:32:47,413 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-11-07 00:32:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,414 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-11-07 00:32:47,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-11-07 00:32:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:32:47,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,416 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,417 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-11-07 00:32:47,417 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,417 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819406380] [2019-11-07 00:32:47,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,436 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819406380] [2019-11-07 00:32:47,436 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,436 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495339206] [2019-11-07 00:32:47,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,437 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,438 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-11-07 00:32:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,463 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2019-11-07 00:32:47,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 00:32:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,467 INFO L225 Difference]: With dead ends: 876 [2019-11-07 00:32:47,467 INFO L226 Difference]: Without dead ends: 602 [2019-11-07 00:32:47,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-07 00:32:47,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-11-07 00:32:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-07 00:32:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-11-07 00:32:47,488 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-11-07 00:32:47,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,489 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-11-07 00:32:47,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-11-07 00:32:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:32:47,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,490 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,491 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-11-07 00:32:47,491 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,491 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325573248] [2019-11-07 00:32:47,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,509 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325573248] [2019-11-07 00:32:47,510 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,510 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652346841] [2019-11-07 00:32:47,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,511 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,511 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-11-07 00:32:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,540 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2019-11-07 00:32:47,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 00:32:47,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,545 INFO L225 Difference]: With dead ends: 970 [2019-11-07 00:32:47,545 INFO L226 Difference]: Without dead ends: 968 [2019-11-07 00:32:47,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-11-07 00:32:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-11-07 00:32:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-11-07 00:32:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-11-07 00:32:47,575 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-11-07 00:32:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,576 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-11-07 00:32:47,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-11-07 00:32:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:32:47,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,579 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-11-07 00:32:47,580 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,580 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071581887] [2019-11-07 00:32:47,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,595 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071581887] [2019-11-07 00:32:47,596 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,596 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948252650] [2019-11-07 00:32:47,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,597 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,597 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-11-07 00:32:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,641 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2019-11-07 00:32:47,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 00:32:47,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,642 INFO L225 Difference]: With dead ends: 1992 [2019-11-07 00:32:47,643 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:32:47,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:32:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:32:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:32:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:32:47,648 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-07 00:32:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,648 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:32:47,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:32:47,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:32:47,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:32:47,671 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 00:32:47,671 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:32:47,671 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:32:47,671 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:32:47,672 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:32:47,672 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:32:47,672 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-07 00:32:47,672 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2019-11-07 00:32:47,672 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-11-07 00:32:47,672 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-07 00:32:47,672 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-11-07 00:32:47,673 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-11-07 00:32:47,673 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-11-07 00:32:47,673 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-11-07 00:32:47,673 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-11-07 00:32:47,673 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-07 00:32:47,673 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2019-11-07 00:32:47,674 INFO L443 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-11-07 00:32:47,674 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2019-11-07 00:32:47,674 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-07 00:32:47,674 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-11-07 00:32:47,674 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-11-07 00:32:47,674 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-11-07 00:32:47,675 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-07 00:32:47,675 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-11-07 00:32:47,675 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-11-07 00:32:47,675 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-11-07 00:32:47,675 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-11-07 00:32:47,675 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-11-07 00:32:47,675 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-07 00:32:47,676 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-11-07 00:32:47,676 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-11-07 00:32:47,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:32:47 BoogieIcfgContainer [2019-11-07 00:32:47,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:32:47,687 INFO L168 Benchmark]: Toolchain (without parser) took 2833.27 ms. Allocated memory was 137.9 MB in the beginning and 233.8 MB in the end (delta: 95.9 MB). Free memory was 101.7 MB in the beginning and 92.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:47,688 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 00:32:47,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.29 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 181.2 MB in the end (delta: -79.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:47,690 INFO L168 Benchmark]: Boogie Preprocessor took 28.05 ms. Allocated memory is still 201.9 MB. Free memory was 181.2 MB in the beginning and 178.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:47,691 INFO L168 Benchmark]: RCFGBuilder took 329.82 ms. Allocated memory is still 201.9 MB. Free memory was 178.9 MB in the beginning and 164.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:47,692 INFO L168 Benchmark]: TraceAbstraction took 2117.19 ms. Allocated memory was 201.9 MB in the beginning and 233.8 MB in the end (delta: 32.0 MB). Free memory was 163.6 MB in the beginning and 92.5 MB in the end (delta: 71.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:47,695 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.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 353.29 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 181.2 MB in the end (delta: -79.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.05 ms. Allocated memory is still 201.9 MB. Free memory was 181.2 MB in the beginning and 178.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 329.82 ms. Allocated memory is still 201.9 MB. Free memory was 178.9 MB in the beginning and 164.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2117.19 ms. Allocated memory was 201.9 MB in the beginning and 233.8 MB in the end (delta: 32.0 MB). Free memory was 163.6 MB in the beginning and 92.5 MB in the end (delta: 71.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 2.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...