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-c6af20d [2019-09-03 20:51:56,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:51:56,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:51:56,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:51:56,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:51:56,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:51:56,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:51:56,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:51:56,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:51:56,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:51:56,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:51:56,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:51:56,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:51:56,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:51:56,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:51:56,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:51:57,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:51:57,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:51:57,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:51:57,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:51:57,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:51:57,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:51:57,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:51:57,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:51:57,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:51:57,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:51:57,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:51:57,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:51:57,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:51:57,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:51:57,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:51:57,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:51:57,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:51:57,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:51:57,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:51:57,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:51:57,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:51:57,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:51:57,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:51:57,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:51:57,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:51:57,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:51:57,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:51:57,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:51:57,058 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:51:57,058 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:51:57,059 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:51:57,059 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:51:57,059 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:51:57,059 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:51:57,059 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:51:57,060 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:51:57,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:51:57,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:51:57,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:51:57,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:51:57,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:51:57,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:51:57,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:51:57,062 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:51:57,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:51:57,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:51:57,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:51:57,062 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:51:57,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:51:57,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:57,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:51:57,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:51:57,063 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:51:57,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:51:57,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:51:57,064 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:51:57,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:51:57,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:51:57,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:51:57,119 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:51:57,120 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:51:57,121 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-09-03 20:51:57,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3efa23552/c183031d5837477db6bc47f97e2fa3e1/FLAGca49132d2 [2019-09-03 20:51:57,711 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:51:57,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-09-03 20:51:57,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3efa23552/c183031d5837477db6bc47f97e2fa3e1/FLAGca49132d2 [2019-09-03 20:51:58,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3efa23552/c183031d5837477db6bc47f97e2fa3e1 [2019-09-03 20:51:58,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:51:58,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:51:58,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:58,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:51:58,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:51:58,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:58" (1/1) ... [2019-09-03 20:51:58,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ebd57d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:58, skipping insertion in model container [2019-09-03 20:51:58,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:58" (1/1) ... [2019-09-03 20:51:58,052 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:51:58,091 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:51:58,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:58,309 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:51:58,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:58,463 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:51:58,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:58 WrapperNode [2019-09-03 20:51:58,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:58,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:51:58,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:51:58,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:51:58,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:58" (1/1) ... [2019-09-03 20:51:58,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:58" (1/1) ... [2019-09-03 20:51:58,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:58" (1/1) ... [2019-09-03 20:51:58,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:58" (1/1) ... [2019-09-03 20:51:58,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:58" (1/1) ... [2019-09-03 20:51:58,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:58" (1/1) ... [2019-09-03 20:51:58,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:58" (1/1) ... [2019-09-03 20:51:58,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:51:58,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:51:58,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:51:58,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:51:58,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:58,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:51:58,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:51:58,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:51:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:51:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:51:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:51:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:51:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:51:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:51:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:51:59,000 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:51:59,001 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 20:51:59,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:59 BoogieIcfgContainer [2019-09-03 20:51:59,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:51:59,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:51:59,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:51:59,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:51:59,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:51:58" (1/3) ... [2019-09-03 20:51:59,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7952dd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:59, skipping insertion in model container [2019-09-03 20:51:59,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:58" (2/3) ... [2019-09-03 20:51:59,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7952dd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:59, skipping insertion in model container [2019-09-03 20:51:59,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:59" (3/3) ... [2019-09-03 20:51:59,012 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-09-03 20:51:59,021 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:51:59,028 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-09-03 20:51:59,042 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-09-03 20:51:59,069 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:51:59,069 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:51:59,069 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:51:59,069 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:51:59,070 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:51:59,070 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:51:59,070 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:51:59,070 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:51:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-09-03 20:51:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:51:59,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:59,098 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:59,101 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:59,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:59,107 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-09-03 20:51:59,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:59,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:59,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:59,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:59,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:59,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:59,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:59,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:59,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:59,335 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2019-09-03 20:51:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:59,619 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2019-09-03 20:51:59,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:59,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:51:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:59,637 INFO L225 Difference]: With dead ends: 125 [2019-09-03 20:51:59,638 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 20:51:59,641 INFO L628 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-09-03 20:51:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 20:51:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-09-03 20:51:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 20:51:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-03 20:51:59,713 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-09-03 20:51:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:59,714 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-03 20:51:59,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-03 20:51:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:51:59,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:59,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:59,717 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:59,720 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-09-03 20:51:59,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:59,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:59,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:59,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:59,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:59,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:59,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:59,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:59,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:59,810 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-09-03 20:51:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:59,921 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-09-03 20:51:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:59,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:51:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:59,925 INFO L225 Difference]: With dead ends: 109 [2019-09-03 20:51:59,925 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 20:51:59,926 INFO L628 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-09-03 20:51:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 20:51:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-09-03 20:51:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:51:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-09-03 20:51:59,936 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-09-03 20:51:59,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:59,936 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-09-03 20:51:59,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-09-03 20:51:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:51:59,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:59,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:59,939 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:59,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:59,939 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-09-03 20:51:59,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:59,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:59,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:00,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:00,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:00,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:00,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:00,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:00,031 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2019-09-03 20:52:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:00,156 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-03 20:52:00,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:00,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 20:52:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:00,158 INFO L225 Difference]: With dead ends: 71 [2019-09-03 20:52:00,159 INFO L226 Difference]: Without dead ends: 71 [2019-09-03 20:52:00,159 INFO L628 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-09-03 20:52:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-03 20:52:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-03 20:52:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 20:52:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-03 20:52:00,166 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-09-03 20:52:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:00,167 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-03 20:52:00,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-03 20:52:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:52:00,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:00,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:00,169 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:00,170 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-09-03 20:52:00,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:00,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:00,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:00,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:00,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:00,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:00,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:00,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:00,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:00,240 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-09-03 20:52:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:00,326 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-03 20:52:00,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:00,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 20:52:00,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:00,328 INFO L225 Difference]: With dead ends: 69 [2019-09-03 20:52:00,328 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 20:52:00,329 INFO L628 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-09-03 20:52:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 20:52:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-03 20:52:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 20:52:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-03 20:52:00,334 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-09-03 20:52:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:00,335 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-03 20:52:00,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-03 20:52:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:52:00,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:00,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:00,337 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-09-03 20:52:00,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:00,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:00,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:00,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:00,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:00,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:00,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:00,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:00,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:00,386 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-09-03 20:52:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:00,516 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-09-03 20:52:00,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:00,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-03 20:52:00,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:00,519 INFO L225 Difference]: With dead ends: 114 [2019-09-03 20:52:00,519 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 20:52:00,520 INFO L628 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-09-03 20:52:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 20:52:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-09-03 20:52:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 20:52:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-03 20:52:00,531 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-09-03 20:52:00,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:00,531 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-03 20:52:00,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-03 20:52:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:52:00,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:00,537 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:00,538 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:00,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:00,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-09-03 20:52:00,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:00,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:00,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:00,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:00,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:00,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:00,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:00,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:00,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:00,597 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-09-03 20:52:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:00,693 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2019-09-03 20:52:00,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:00,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-03 20:52:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:00,695 INFO L225 Difference]: With dead ends: 99 [2019-09-03 20:52:00,695 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 20:52:00,696 INFO L628 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-09-03 20:52:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 20:52:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-09-03 20:52:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 20:52:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-03 20:52:00,701 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-09-03 20:52:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:00,701 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-03 20:52:00,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-03 20:52:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:52:00,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:00,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:00,703 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:00,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:00,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-09-03 20:52:00,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:00,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:00,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:00,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:00,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:00,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:00,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:00,754 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-09-03 20:52:00,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:00,814 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-09-03 20:52:00,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:00,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 20:52:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:00,815 INFO L225 Difference]: With dead ends: 63 [2019-09-03 20:52:00,816 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 20:52:00,816 INFO L628 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-09-03 20:52:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 20:52:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-03 20:52:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:52:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-03 20:52:00,820 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-09-03 20:52:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:00,820 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-03 20:52:00,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-03 20:52:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:52:00,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:00,822 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:00,822 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:00,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-09-03 20:52:00,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:00,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:00,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:00,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:00,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:00,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:00,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:00,858 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-09-03 20:52:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:00,927 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-09-03 20:52:00,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:00,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 20:52:00,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:00,928 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:52:00,928 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 20:52:00,929 INFO L628 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-09-03 20:52:00,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 20:52:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-03 20:52:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:52:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-03 20:52:00,932 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-09-03 20:52:00,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:00,932 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-03 20:52:00,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-03 20:52:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:52:00,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:00,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:00,934 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:00,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:00,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-09-03 20:52:00,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:00,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:00,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:01,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:01,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:01,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:01,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:01,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:01,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:01,031 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-09-03 20:52:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:01,152 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-09-03 20:52:01,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:01,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:52:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:01,154 INFO L225 Difference]: With dead ends: 92 [2019-09-03 20:52:01,154 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 20:52:01,155 INFO L628 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-09-03 20:52:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 20:52:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-09-03 20:52:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 20:52:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-03 20:52:01,161 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2019-09-03 20:52:01,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:01,163 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-03 20:52:01,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-03 20:52:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:52:01,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:01,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:01,167 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2019-09-03 20:52:01,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:01,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:01,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:01,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:01,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:01,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:01,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:01,243 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2019-09-03 20:52:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:01,353 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-09-03 20:52:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:01,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:52:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:01,355 INFO L225 Difference]: With dead ends: 82 [2019-09-03 20:52:01,355 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 20:52:01,356 INFO L628 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-09-03 20:52:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 20:52:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-09-03 20:52:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 20:52:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-03 20:52:01,359 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2019-09-03 20:52:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:01,359 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-03 20:52:01,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-03 20:52:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:52:01,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:01,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:01,361 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:01,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:01,362 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2019-09-03 20:52:01,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:01,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:01,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:01,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:01,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:01,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:01,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:01,392 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-09-03 20:52:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:01,479 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-09-03 20:52:01,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:01,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:52:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:01,481 INFO L225 Difference]: With dead ends: 68 [2019-09-03 20:52:01,481 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 20:52:01,481 INFO L628 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-09-03 20:52:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 20:52:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2019-09-03 20:52:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 20:52:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-09-03 20:52:01,484 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2019-09-03 20:52:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:01,484 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-09-03 20:52:01,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-09-03 20:52:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:52:01,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:01,485 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:01,486 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:01,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:01,486 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2019-09-03 20:52:01,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:01,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:01,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:01,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:01,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:01,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:01,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:01,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:01,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:01,532 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-09-03 20:52:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:01,619 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-09-03 20:52:01,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:01,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:52:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:01,621 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:52:01,621 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:52:01,621 INFO L628 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-09-03 20:52:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:52:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-09-03 20:52:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:52:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-03 20:52:01,624 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2019-09-03 20:52:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:01,625 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-03 20:52:01,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-03 20:52:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:52:01,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:01,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:01,627 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:01,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:01,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2019-09-03 20:52:01,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:01,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:01,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:01,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:01,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:01,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:01,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:01,659 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-09-03 20:52:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:01,738 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-09-03 20:52:01,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:01,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 20:52:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:01,740 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:52:01,740 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:52:01,740 INFO L628 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-09-03 20:52:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:52:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-09-03 20:52:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 20:52:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-03 20:52:01,743 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-09-03 20:52:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:01,743 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-03 20:52:01,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-03 20:52:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:52:01,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:01,744 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:01,745 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:01,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:01,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2019-09-03 20:52:01,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:01,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:01,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:01,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:01,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:01,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:01,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:01,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:01,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:01,805 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-09-03 20:52:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:01,880 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-09-03 20:52:01,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:01,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 20:52:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:01,881 INFO L225 Difference]: With dead ends: 57 [2019-09-03 20:52:01,882 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 20:52:01,882 INFO L628 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-09-03 20:52:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 20:52:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-09-03 20:52:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:52:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-03 20:52:01,884 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-09-03 20:52:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:01,884 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-03 20:52:01,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-03 20:52:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:52:01,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:01,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:01,886 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2019-09-03 20:52:01,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:01,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:01,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:01,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:01,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:01,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:01,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:01,933 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-09-03 20:52:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:01,987 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-03 20:52:01,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:01,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 20:52:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:01,988 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:52:01,988 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 20:52:01,989 INFO L628 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-09-03 20:52:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 20:52:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-03 20:52:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:52:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 20:52:01,991 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-09-03 20:52:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:01,991 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 20:52:01,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 20:52:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:52:01,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:01,993 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:01,993 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:01,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:01,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2019-09-03 20:52:01,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:01,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:01,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:02,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:02,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:02,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:02,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:02,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:02,053 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-09-03 20:52:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:02,138 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-09-03 20:52:02,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:02,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-03 20:52:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:02,139 INFO L225 Difference]: With dead ends: 52 [2019-09-03 20:52:02,140 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 20:52:02,141 INFO L628 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-09-03 20:52:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 20:52:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-09-03 20:52:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 20:52:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-03 20:52:02,143 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2019-09-03 20:52:02,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:02,144 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-03 20:52:02,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-03 20:52:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:52:02,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:02,146 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:02,148 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:02,149 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2019-09-03 20:52:02,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:02,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:02,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:02,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:02,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:02,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:02,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:02,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:02,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:02,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:02,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:02,183 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2019-09-03 20:52:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:02,210 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-03 20:52:02,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:02,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-03 20:52:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:02,211 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:52:02,212 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:52:02,212 INFO L628 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-09-03 20:52:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:52:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 20:52:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:52:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-03 20:52:02,214 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2019-09-03 20:52:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:02,215 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-03 20:52:02,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-03 20:52:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:52:02,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:02,216 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:02,216 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:02,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:02,217 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2019-09-03 20:52:02,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:02,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:02,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:02,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:02,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:02,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:02,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:02,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:02,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:02,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:02,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:02,241 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-09-03 20:52:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:02,287 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-03 20:52:02,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:02,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-03 20:52:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:02,288 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:52:02,288 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:52:02,289 INFO L628 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-09-03 20:52:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:52:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:52:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:52:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:52:02,289 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-03 20:52:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:02,290 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:52:02,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:52:02,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:52:02,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:52:02 BoogieIcfgContainer [2019-09-03 20:52:02,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:52:02,303 INFO L168 Benchmark]: Toolchain (without parser) took 4265.15 ms. Allocated memory was 137.4 MB in the beginning and 251.7 MB in the end (delta: 114.3 MB). Free memory was 93.2 MB in the beginning and 221.3 MB in the end (delta: -128.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-03 20:52:02,306 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 111.6 MB in the beginning and 111.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:52:02,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.18 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 93.0 MB in the beginning and 178.7 MB in the end (delta: -85.7 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:02,312 INFO L168 Benchmark]: Boogie Preprocessor took 54.45 ms. Allocated memory is still 201.9 MB. Free memory was 178.7 MB in the beginning and 176.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:02,315 INFO L168 Benchmark]: RCFGBuilder took 482.81 ms. Allocated memory is still 201.9 MB. Free memory was 176.6 MB in the beginning and 152.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:02,316 INFO L168 Benchmark]: TraceAbstraction took 3295.04 ms. Allocated memory was 201.9 MB in the beginning and 251.7 MB in the end (delta: 49.8 MB). Free memory was 151.9 MB in the beginning and 221.3 MB in the end (delta: -69.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-03 20:52:02,322 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.23 ms. Allocated memory is still 137.4 MB. Free memory was 111.6 MB in the beginning and 111.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 428.18 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 93.0 MB in the beginning and 178.7 MB in the end (delta: -85.7 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.45 ms. Allocated memory is still 201.9 MB. Free memory was 178.7 MB in the beginning and 176.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 482.81 ms. Allocated memory is still 201.9 MB. Free memory was 176.6 MB in the beginning and 152.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3295.04 ms. Allocated memory was 201.9 MB in the beginning and 251.7 MB in the end (delta: 49.8 MB). Free memory was 151.9 MB in the beginning and 221.3 MB in the end (delta: -69.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: 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: 219]: 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: 67]: 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: 47]: 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: 109]: 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: 171]: 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: 273]: 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: 304]: 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: 373]: 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.2s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 856 SDtfs, 1411 SDslu, 899 SDs, 0 SdLazy, 1023 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s 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, 311 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 10744 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...