java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:32:48,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:32:48,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:32:48,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:32:48,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:32:48,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:32:48,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:32:48,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:32:48,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:32:48,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:32:48,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:32:48,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:32:48,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:32:48,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:32:48,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:32:48,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:32:48,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:32:48,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:32:48,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:32:48,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:32:48,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:32:48,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:32:48,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:32:48,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:32:48,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:32:48,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:32:48,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:32:48,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:32:48,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:32:48,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:32:48,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:32:48,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:32:48,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:32:48,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:32:48,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:32:48,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:32:48,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:32:48,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:32:48,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:32:48,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:32:48,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:32:48,080 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:32:48,096 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:32:48,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:32:48,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:32:48,097 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:32:48,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:32:48,098 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:32:48,098 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:32:48,098 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:32:48,098 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:32:48,098 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:32:48,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:32:48,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:32:48,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:32:48,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:32:48,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:32:48,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:32:48,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:32:48,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:32:48,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:32:48,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:32:48,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:32:48,101 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:32:48,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:32:48,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:32:48,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:32:48,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:32:48,102 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:32:48,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:32:48,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:32:48,103 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:32:48,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:32:48,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:32:48,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:32:48,150 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:32:48,150 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:32:48,151 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-10-03 02:32:48,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78118a9e4/3bf92d5ef17f4d6b9b05e8630605a8d7/FLAG4b29fde67 [2019-10-03 02:32:48,648 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:32:48,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-10-03 02:32:48,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78118a9e4/3bf92d5ef17f4d6b9b05e8630605a8d7/FLAG4b29fde67 [2019-10-03 02:32:49,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78118a9e4/3bf92d5ef17f4d6b9b05e8630605a8d7 [2019-10-03 02:32:49,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:32:49,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:32:49,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:49,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:32:49,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:32:49,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:49" (1/1) ... [2019-10-03 02:32:49,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2089993a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:49, skipping insertion in model container [2019-10-03 02:32:49,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:49" (1/1) ... [2019-10-03 02:32:49,097 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:32:49,134 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:32:49,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:49,318 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:32:49,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:49,469 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:32:49,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:49 WrapperNode [2019-10-03 02:32:49,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:49,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:32:49,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:32:49,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:32:49,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:49" (1/1) ... [2019-10-03 02:32:49,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:49" (1/1) ... [2019-10-03 02:32:49,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:49" (1/1) ... [2019-10-03 02:32:49,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:49" (1/1) ... [2019-10-03 02:32:49,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:49" (1/1) ... [2019-10-03 02:32:49,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:49" (1/1) ... [2019-10-03 02:32:49,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:49" (1/1) ... [2019-10-03 02:32:49,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:32:49,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:32:49,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:32:49,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:32:49,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:49" (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-10-03 02:32:49,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:32:49,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:32:49,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:32:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:32:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:32:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:32:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:32:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:32:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:32:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:32:50,018 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:32:50,019 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:32:50,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:50 BoogieIcfgContainer [2019-10-03 02:32:50,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:32:50,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:32:50,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:32:50,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:32:50,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:32:49" (1/3) ... [2019-10-03 02:32:50,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ddde5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:50, skipping insertion in model container [2019-10-03 02:32:50,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:49" (2/3) ... [2019-10-03 02:32:50,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ddde5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:50, skipping insertion in model container [2019-10-03 02:32:50,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:50" (3/3) ... [2019-10-03 02:32:50,028 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-10-03 02:32:50,039 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:32:50,046 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-03 02:32:50,064 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-03 02:32:50,093 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:32:50,093 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:32:50,093 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:32:50,093 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:32:50,093 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:32:50,094 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:32:50,094 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:32:50,094 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:32:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-10-03 02:32:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:32:50,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:50,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:50,133 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-10-03 02:32:50,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:50,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:50,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:50,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:50,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:50,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:50,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:50,379 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2019-10-03 02:32:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:50,592 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2019-10-03 02:32:50,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:50,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-03 02:32:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:50,613 INFO L225 Difference]: With dead ends: 125 [2019-10-03 02:32:50,613 INFO L226 Difference]: Without dead ends: 111 [2019-10-03 02:32:50,617 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:50,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-03 02:32:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-10-03 02:32:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-03 02:32:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-03 02:32:50,684 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-10-03 02:32:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:50,685 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-03 02:32:50,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-03 02:32:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:32:50,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:50,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:50,689 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:50,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-10-03 02:32:50,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:50,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:50,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:50,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:50,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:50,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:50,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:50,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:50,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:50,805 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-10-03 02:32:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:50,903 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-10-03 02:32:50,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:50,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-03 02:32:50,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:50,906 INFO L225 Difference]: With dead ends: 109 [2019-10-03 02:32:50,906 INFO L226 Difference]: Without dead ends: 109 [2019-10-03 02:32:50,907 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-03 02:32:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-10-03 02:32:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-03 02:32:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-03 02:32:50,916 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-10-03 02:32:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:50,916 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-03 02:32:50,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-03 02:32:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-03 02:32:50,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:50,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:50,919 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:50,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:50,919 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-10-03 02:32:50,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:50,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:50,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:50,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:50,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:50,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:50,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:50,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:50,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:50,991 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2019-10-03 02:32:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:51,119 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-10-03 02:32:51,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:51,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-03 02:32:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:51,120 INFO L225 Difference]: With dead ends: 71 [2019-10-03 02:32:51,120 INFO L226 Difference]: Without dead ends: 71 [2019-10-03 02:32:51,121 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-03 02:32:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-10-03 02:32:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-03 02:32:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-03 02:32:51,126 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-10-03 02:32:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:51,127 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-03 02:32:51,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-03 02:32:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-03 02:32:51,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:51,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:51,130 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:51,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-10-03 02:32:51,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:51,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:51,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:51,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:51,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:51,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:51,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:51,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:51,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:51,187 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-10-03 02:32:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:51,305 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-10-03 02:32:51,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:51,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-03 02:32:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:51,307 INFO L225 Difference]: With dead ends: 69 [2019-10-03 02:32:51,307 INFO L226 Difference]: Without dead ends: 69 [2019-10-03 02:32:51,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-03 02:32:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-03 02:32:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-03 02:32:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-03 02:32:51,313 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-10-03 02:32:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:51,313 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-03 02:32:51,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-03 02:32:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-03 02:32:51,314 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:51,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:51,315 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-10-03 02:32:51,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:51,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:51,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:51,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:51,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:51,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:51,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:51,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:51,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:51,366 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-10-03 02:32:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:51,517 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-10-03 02:32:51,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:51,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-03 02:32:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:51,519 INFO L225 Difference]: With dead ends: 114 [2019-10-03 02:32:51,519 INFO L226 Difference]: Without dead ends: 114 [2019-10-03 02:32:51,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-03 02:32:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-10-03 02:32:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-03 02:32:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-03 02:32:51,525 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-10-03 02:32:51,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:51,526 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-03 02:32:51,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-03 02:32:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-03 02:32:51,527 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:51,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:51,528 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:51,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:51,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-10-03 02:32:51,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:51,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:51,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:51,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:51,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:51,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:51,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:51,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:51,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:51,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:51,585 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-10-03 02:32:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:51,692 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2019-10-03 02:32:51,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:51,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-03 02:32:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:51,694 INFO L225 Difference]: With dead ends: 99 [2019-10-03 02:32:51,694 INFO L226 Difference]: Without dead ends: 99 [2019-10-03 02:32:51,694 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-03 02:32:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-10-03 02:32:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-03 02:32:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-03 02:32:51,705 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-10-03 02:32:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:51,705 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-03 02:32:51,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-03 02:32:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-03 02:32:51,709 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:51,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:51,710 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-10-03 02:32:51,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:51,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:51,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:51,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:51,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:51,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:51,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:51,760 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-10-03 02:32:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:51,837 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-10-03 02:32:51,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:51,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-03 02:32:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:51,838 INFO L225 Difference]: With dead ends: 63 [2019-10-03 02:32:51,839 INFO L226 Difference]: Without dead ends: 61 [2019-10-03 02:32:51,839 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-03 02:32:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-03 02:32:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-03 02:32:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-03 02:32:51,843 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-10-03 02:32:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:51,843 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-03 02:32:51,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-03 02:32:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-03 02:32:51,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:51,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:51,845 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:51,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-10-03 02:32:51,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:51,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:51,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:51,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:51,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:51,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:51,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:51,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:51,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:51,882 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-10-03 02:32:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:51,943 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-10-03 02:32:51,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:51,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-03 02:32:51,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:51,944 INFO L225 Difference]: With dead ends: 59 [2019-10-03 02:32:51,944 INFO L226 Difference]: Without dead ends: 57 [2019-10-03 02:32:51,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-03 02:32:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-03 02:32:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-03 02:32:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-03 02:32:51,949 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-10-03 02:32:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:51,949 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-03 02:32:51,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-03 02:32:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:51,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:51,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:51,951 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:51,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-10-03 02:32:51,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:52,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:52,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:52,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:52,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:52,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:52,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:52,023 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-10-03 02:32:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:52,162 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-10-03 02:32:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:52,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-03 02:32:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:52,164 INFO L225 Difference]: With dead ends: 92 [2019-10-03 02:32:52,164 INFO L226 Difference]: Without dead ends: 92 [2019-10-03 02:32:52,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:52,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-03 02:32:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-10-03 02:32:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-03 02:32:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-10-03 02:32:52,171 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2019-10-03 02:32:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:52,176 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-10-03 02:32:52,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-10-03 02:32:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:52,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:52,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:52,180 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:52,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:52,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2019-10-03 02:32:52,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:52,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:52,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:52,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:52,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:52,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:52,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:52,283 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2019-10-03 02:32:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:52,408 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-10-03 02:32:52,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:52,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-03 02:32:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:52,410 INFO L225 Difference]: With dead ends: 82 [2019-10-03 02:32:52,410 INFO L226 Difference]: Without dead ends: 82 [2019-10-03 02:32:52,411 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-03 02:32:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-10-03 02:32:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-03 02:32:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-03 02:32:52,420 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2019-10-03 02:32:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:52,421 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-03 02:32:52,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-03 02:32:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:52,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:52,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:52,425 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:52,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:52,425 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2019-10-03 02:32:52,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:52,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:52,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:52,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:52,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:52,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:52,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:52,483 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-10-03 02:32:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:52,549 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-10-03 02:32:52,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:52,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-03 02:32:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:52,551 INFO L225 Difference]: With dead ends: 68 [2019-10-03 02:32:52,551 INFO L226 Difference]: Without dead ends: 68 [2019-10-03 02:32:52,551 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:52,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-03 02:32:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2019-10-03 02:32:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-03 02:32:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-03 02:32:52,557 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2019-10-03 02:32:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:52,558 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-03 02:32:52,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-03 02:32:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:52,561 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:52,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:52,562 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:52,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:52,562 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2019-10-03 02:32:52,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:52,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:52,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:52,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:52,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:52,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:52,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:52,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:52,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:52,614 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-10-03 02:32:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:52,685 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-10-03 02:32:52,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:52,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-03 02:32:52,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:52,687 INFO L225 Difference]: With dead ends: 49 [2019-10-03 02:32:52,687 INFO L226 Difference]: Without dead ends: 49 [2019-10-03 02:32:52,687 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-03 02:32:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-03 02:32:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-03 02:32:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-03 02:32:52,690 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2019-10-03 02:32:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:52,691 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-03 02:32:52,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:52,693 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-03 02:32:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:32:52,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:52,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:52,695 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:52,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2019-10-03 02:32:52,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:52,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:52,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:52,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:52,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:52,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:52,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:52,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:52,742 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-10-03 02:32:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:52,822 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-10-03 02:32:52,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:52,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-03 02:32:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:52,823 INFO L225 Difference]: With dead ends: 67 [2019-10-03 02:32:52,824 INFO L226 Difference]: Without dead ends: 67 [2019-10-03 02:32:52,824 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-03 02:32:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-10-03 02:32:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-03 02:32:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-03 02:32:52,826 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-10-03 02:32:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:52,827 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-03 02:32:52,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-03 02:32:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:32:52,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:52,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:52,829 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:52,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:52,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2019-10-03 02:32:52,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:52,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:52,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:52,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:52,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:52,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:52,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:52,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:52,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:52,888 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-10-03 02:32:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:52,973 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-10-03 02:32:52,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:52,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-03 02:32:52,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:52,975 INFO L225 Difference]: With dead ends: 57 [2019-10-03 02:32:52,975 INFO L226 Difference]: Without dead ends: 57 [2019-10-03 02:32:52,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-03 02:32:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-10-03 02:32:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-03 02:32:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-03 02:32:52,978 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-10-03 02:32:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:52,978 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-03 02:32:52,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-03 02:32:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:32:52,979 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:52,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:52,980 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:52,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2019-10-03 02:32:52,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:52,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:53,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:53,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:53,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:53,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:53,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:53,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:53,043 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-10-03 02:32:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:53,110 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-10-03 02:32:53,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:53,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-03 02:32:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:53,111 INFO L225 Difference]: With dead ends: 41 [2019-10-03 02:32:53,111 INFO L226 Difference]: Without dead ends: 39 [2019-10-03 02:32:53,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-03 02:32:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-03 02:32:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-03 02:32:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-03 02:32:53,117 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-10-03 02:32:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:53,117 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-03 02:32:53,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-03 02:32:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:32:53,121 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:53,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:53,122 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2019-10-03 02:32:53,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:53,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:53,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:53,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:53,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:53,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:53,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:53,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:53,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:53,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:53,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:53,190 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-10-03 02:32:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:53,271 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-10-03 02:32:53,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:53,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-03 02:32:53,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:53,272 INFO L225 Difference]: With dead ends: 52 [2019-10-03 02:32:53,273 INFO L226 Difference]: Without dead ends: 52 [2019-10-03 02:32:53,273 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-03 02:32:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-10-03 02:32:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-03 02:32:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-03 02:32:53,275 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2019-10-03 02:32:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:53,275 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-03 02:32:53,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-03 02:32:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:32:53,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:53,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:53,277 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2019-10-03 02:32:53,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:53,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:53,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:53,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:53,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:53,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:32:53,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:53,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:32:53,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:32:53,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:53,355 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-10-03 02:32:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:53,470 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-10-03 02:32:53,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:53,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-03 02:32:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:53,472 INFO L225 Difference]: With dead ends: 54 [2019-10-03 02:32:53,473 INFO L226 Difference]: Without dead ends: 54 [2019-10-03 02:32:53,473 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-03 02:32:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2019-10-03 02:32:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-03 02:32:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-03 02:32:53,476 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2019-10-03 02:32:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:53,477 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-03 02:32:53,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:32:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-03 02:32:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:32:53,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:53,477 INFO L411 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-10-03 02:32:53,478 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:53,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:53,479 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2019-10-03 02:32:53,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:53,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:53,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:53,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:53,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:53,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:53,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:53,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:53,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:53,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:53,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:53,505 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-10-03 02:32:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:53,547 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-10-03 02:32:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:53,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-03 02:32:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:53,548 INFO L225 Difference]: With dead ends: 35 [2019-10-03 02:32:53,548 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:32:53,549 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:32:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:32:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:32:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:32:53,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-03 02:32:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:53,551 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:32:53,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:32:53,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:32:53,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:32:53 BoogieIcfgContainer [2019-10-03 02:32:53,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:32:53,559 INFO L168 Benchmark]: Toolchain (without parser) took 4479.57 ms. Allocated memory was 138.9 MB in the beginning and 265.3 MB in the end (delta: 126.4 MB). Free memory was 86.0 MB in the beginning and 96.8 MB in the end (delta: -10.8 MB). Peak memory consumption was 115.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:53,560 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:32:53,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.10 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 85.8 MB in the beginning and 177.9 MB in the end (delta: -92.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:53,562 INFO L168 Benchmark]: Boogie Preprocessor took 38.45 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 176.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:53,563 INFO L168 Benchmark]: RCFGBuilder took 511.32 ms. Allocated memory is still 200.3 MB. Free memory was 176.0 MB in the beginning and 150.5 MB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:53,564 INFO L168 Benchmark]: TraceAbstraction took 3535.16 ms. Allocated memory was 200.3 MB in the beginning and 265.3 MB in the end (delta: 65.0 MB). Free memory was 149.9 MB in the beginning and 96.8 MB in the end (delta: 53.1 MB). Peak memory consumption was 118.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:53,568 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.24 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 390.10 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 85.8 MB in the beginning and 177.9 MB in the end (delta: -92.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.45 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 176.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 511.32 ms. Allocated memory is still 200.3 MB. Free memory was 176.0 MB in the beginning and 150.5 MB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3535.16 ms. Allocated memory was 200.3 MB in the beginning and 265.3 MB in the end (delta: 65.0 MB). Free memory was 149.9 MB in the beginning and 96.8 MB in the end (delta: 53.1 MB). Peak memory consumption was 118.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. SAFE Result, 3.4s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 852 SDtfs, 1451 SDslu, 903 SDs, 0 SdLazy, 1093 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 330 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 11162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...