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.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:51:56,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:51:56,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:51:56,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:51:56,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:51:56,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:51:56,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:51:56,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:51:56,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:51:56,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:51:56,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:51:56,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:51:56,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:51:56,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:51:56,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:51:56,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:51:56,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:51:56,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:51:56,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:51:56,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:51:56,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:51:56,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:51:56,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:51:56,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:51:56,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:51:56,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:51:56,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:51:56,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:51:56,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:51:56,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:51:56,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:51:56,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:51:56,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:51:56,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:51:56,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:51:56,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:51:56,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:51:56,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:51:56,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:51:56,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:51:56,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:51:56,058 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:56,075 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:51:56,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:51:56,076 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:51:56,076 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:51:56,077 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:51:56,077 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:51:56,078 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:51:56,078 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:51:56,079 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:51:56,079 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:51:56,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:51:56,080 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:51:56,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:51:56,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:51:56,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:51:56,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:51:56,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:51:56,082 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:51:56,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:51:56,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:51:56,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:51:56,083 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:51:56,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:51:56,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:56,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:51:56,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:51:56,085 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:51:56,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:51:56,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:51:56,086 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:51:56,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:51:56,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:51:56,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:51:56,148 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:51:56,149 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:51:56,150 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.p+sep-reducer.c [2019-09-03 20:51:56,226 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a726983f/8529165388384a36923c07c55924cc23/FLAG3bb6805b4 [2019-09-03 20:51:56,893 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:51:56,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-09-03 20:51:56,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a726983f/8529165388384a36923c07c55924cc23/FLAG3bb6805b4 [2019-09-03 20:51:57,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a726983f/8529165388384a36923c07c55924cc23 [2019-09-03 20:51:57,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:51:57,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:51:57,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:57,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:51:57,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:51:57,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:57" (1/1) ... [2019-09-03 20:51:57,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@688de287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:57, skipping insertion in model container [2019-09-03 20:51:57,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:57" (1/1) ... [2019-09-03 20:51:57,099 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:51:57,210 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:51:58,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:58,150 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:51:58,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:58,442 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:51:58,443 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,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:58,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:51:58,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:51:58,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:51:58,459 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,459 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,492 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,551 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,595 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,614 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,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:51:58,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:51:58,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:51:58,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:51:58,639 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,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:51:58,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:51:58,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:51:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:51:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:51:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:51:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:51:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:51:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:51:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:52:00,892 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:52:00,892 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 20:52:00,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:00 BoogieIcfgContainer [2019-09-03 20:52:00,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:52:00,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:52:00,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:52:00,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:52:00,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:51:57" (1/3) ... [2019-09-03 20:52:00,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e93e64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:00, skipping insertion in model container [2019-09-03 20:52:00,904 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:52:00,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e93e64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:00, skipping insertion in model container [2019-09-03 20:52:00,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:00" (3/3) ... [2019-09-03 20:52:00,906 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-09-03 20:52:00,917 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:52:00,925 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-03 20:52:00,942 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-03 20:52:00,970 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:52:00,970 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:52:00,970 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:52:00,970 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:52:00,971 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:52:00,971 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:52:00,971 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:52:00,971 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:52:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states. [2019-09-03 20:52:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 20:52:01,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:01,011 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:01,014 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:01,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1514750688, now seen corresponding path program 1 times [2019-09-03 20:52:01,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:01,231 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,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:01,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:01,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:01,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:01,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:01,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:01,260 INFO L87 Difference]: Start difference. First operand 480 states. Second operand 4 states. [2019-09-03 20:52:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:02,595 INFO L93 Difference]: Finished difference Result 484 states and 894 transitions. [2019-09-03 20:52:02,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:02,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-03 20:52:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:02,611 INFO L225 Difference]: With dead ends: 484 [2019-09-03 20:52:02,611 INFO L226 Difference]: Without dead ends: 301 [2019-09-03 20:52:02,612 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,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-03 20:52:02,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-09-03 20:52:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-03 20:52:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2019-09-03 20:52:02,671 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 11 [2019-09-03 20:52:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:02,671 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2019-09-03 20:52:02,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2019-09-03 20:52:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:52:02,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:02,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:02,673 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:02,674 INFO L82 PathProgramCache]: Analyzing trace with hash 287371989, now seen corresponding path program 1 times [2019-09-03 20:52:02,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:02,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:02,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:02,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:02,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:02,725 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,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:02,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:02,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:02,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:02,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:02,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:02,728 INFO L87 Difference]: Start difference. First operand 301 states and 364 transitions. Second operand 4 states. [2019-09-03 20:52:03,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:03,213 INFO L93 Difference]: Finished difference Result 299 states and 362 transitions. [2019-09-03 20:52:03,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:03,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:52:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:03,216 INFO L225 Difference]: With dead ends: 299 [2019-09-03 20:52:03,216 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 20:52:03,217 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:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 20:52:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-03 20:52:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-03 20:52:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2019-09-03 20:52:03,234 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 12 [2019-09-03 20:52:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:03,234 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2019-09-03 20:52:03,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2019-09-03 20:52:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-03 20:52:03,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:03,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:03,249 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:03,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:03,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1097283636, now seen corresponding path program 1 times [2019-09-03 20:52:03,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:03,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:03,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:03,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:03,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:05,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:05,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:05,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-09-03 20:52:05,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:05,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:52:05,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:52:05,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:52:05,810 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 63 states. [2019-09-03 20:52:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:07,082 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-09-03 20:52:07,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 20:52:07,083 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-09-03 20:52:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:07,086 INFO L225 Difference]: With dead ends: 295 [2019-09-03 20:52:07,086 INFO L226 Difference]: Without dead ends: 295 [2019-09-03 20:52:07,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:52:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-03 20:52:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2019-09-03 20:52:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-03 20:52:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 297 transitions. [2019-09-03 20:52:07,101 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 297 transitions. Word has length 248 [2019-09-03 20:52:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:07,102 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 297 transitions. [2019-09-03 20:52:07,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:52:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 297 transitions. [2019-09-03 20:52:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-03 20:52:07,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:07,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:07,109 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:07,113 INFO L82 PathProgramCache]: Analyzing trace with hash -343940819, now seen corresponding path program 1 times [2019-09-03 20:52:07,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,134 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:08,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:08,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:08,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:08,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:08,137 INFO L87 Difference]: Start difference. First operand 294 states and 297 transitions. Second operand 6 states. [2019-09-03 20:52:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,686 INFO L93 Difference]: Finished difference Result 294 states and 297 transitions. [2019-09-03 20:52:08,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:08,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-03 20:52:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,690 INFO L225 Difference]: With dead ends: 294 [2019-09-03 20:52:08,690 INFO L226 Difference]: Without dead ends: 294 [2019-09-03 20:52:08,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 119 SyntacticMatches, 59 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:52:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-03 20:52:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-09-03 20:52:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-03 20:52:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2019-09-03 20:52:08,700 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 249 [2019-09-03 20:52:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:08,701 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2019-09-03 20:52:08,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2019-09-03 20:52:08,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 20:52:08,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:08,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:08,707 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1455800989, now seen corresponding path program 1 times [2019-09-03 20:52:08,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:08,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:08,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:11,090 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:11,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:11,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-03 20:52:11,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:11,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:52:11,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:52:11,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:52:11,095 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand 65 states. [2019-09-03 20:52:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:12,739 INFO L93 Difference]: Finished difference Result 293 states and 296 transitions. [2019-09-03 20:52:12,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:52:12,740 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-09-03 20:52:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:12,742 INFO L225 Difference]: With dead ends: 293 [2019-09-03 20:52:12,742 INFO L226 Difference]: Without dead ends: 293 [2019-09-03 20:52:12,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:52:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-03 20:52:12,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2019-09-03 20:52:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-03 20:52:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2019-09-03 20:52:12,749 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 252 [2019-09-03 20:52:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:12,751 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2019-09-03 20:52:12,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:52:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2019-09-03 20:52:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-03 20:52:12,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:12,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:12,756 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:12,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:12,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2114804744, now seen corresponding path program 1 times [2019-09-03 20:52:12,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:12,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:12,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:13,840 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:13,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:13,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:13,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:13,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:13,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:13,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:13,842 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand 6 states. [2019-09-03 20:52:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:14,439 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2019-09-03 20:52:14,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:14,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-03 20:52:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:14,443 INFO L225 Difference]: With dead ends: 288 [2019-09-03 20:52:14,443 INFO L226 Difference]: Without dead ends: 288 [2019-09-03 20:52:14,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 121 SyntacticMatches, 60 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:52:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-03 20:52:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-03 20:52:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-03 20:52:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2019-09-03 20:52:14,450 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 253 [2019-09-03 20:52:14,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:14,451 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2019-09-03 20:52:14,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2019-09-03 20:52:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-03 20:52:14,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:14,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:14,455 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:14,455 INFO L82 PathProgramCache]: Analyzing trace with hash -807674468, now seen corresponding path program 1 times [2019-09-03 20:52:14,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:14,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:14,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:14,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:14,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:14,776 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:14,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:14,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:14,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:14,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:14,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:14,778 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand 5 states. [2019-09-03 20:52:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:15,016 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-09-03 20:52:15,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:15,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2019-09-03 20:52:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:15,019 INFO L225 Difference]: With dead ends: 286 [2019-09-03 20:52:15,019 INFO L226 Difference]: Without dead ends: 286 [2019-09-03 20:52:15,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-03 20:52:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2019-09-03 20:52:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-03 20:52:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2019-09-03 20:52:15,027 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 255 [2019-09-03 20:52:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:15,027 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2019-09-03 20:52:15,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2019-09-03 20:52:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-03 20:52:15,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:15,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:15,032 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:15,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash 731900137, now seen corresponding path program 1 times [2019-09-03 20:52:15,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:15,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:15,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:15,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:15,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:15,242 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:15,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:15,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:15,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:15,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:15,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:15,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:15,245 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand 4 states. [2019-09-03 20:52:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:15,573 INFO L93 Difference]: Finished difference Result 284 states and 287 transitions. [2019-09-03 20:52:15,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:15,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-09-03 20:52:15,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:15,580 INFO L225 Difference]: With dead ends: 284 [2019-09-03 20:52:15,581 INFO L226 Difference]: Without dead ends: 282 [2019-09-03 20:52:15,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-03 20:52:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-09-03 20:52:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-03 20:52:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2019-09-03 20:52:15,589 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 256 [2019-09-03 20:52:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:15,590 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2019-09-03 20:52:15,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2019-09-03 20:52:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-03 20:52:15,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:15,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:15,595 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1228876781, now seen corresponding path program 1 times [2019-09-03 20:52:15,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:15,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:15,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:17,959 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:17,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:17,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-09-03 20:52:17,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:17,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:52:17,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:52:17,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:52:17,962 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand 66 states. [2019-09-03 20:52:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:19,665 INFO L93 Difference]: Finished difference Result 290 states and 294 transitions. [2019-09-03 20:52:19,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:52:19,666 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 257 [2019-09-03 20:52:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:19,668 INFO L225 Difference]: With dead ends: 290 [2019-09-03 20:52:19,669 INFO L226 Difference]: Without dead ends: 290 [2019-09-03 20:52:19,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:52:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-03 20:52:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2019-09-03 20:52:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-03 20:52:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 283 transitions. [2019-09-03 20:52:19,677 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 283 transitions. Word has length 257 [2019-09-03 20:52:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:19,677 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 283 transitions. [2019-09-03 20:52:19,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 20:52:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 283 transitions. [2019-09-03 20:52:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-03 20:52:19,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:19,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:19,680 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:19,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1227337581, now seen corresponding path program 1 times [2019-09-03 20:52:19,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:19,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:19,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:19,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:19,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:21,469 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:21,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:21,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-03 20:52:21,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:21,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:52:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:52:21,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:52:21,473 INFO L87 Difference]: Start difference. First operand 280 states and 283 transitions. Second operand 65 states. [2019-09-03 20:52:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:23,139 INFO L93 Difference]: Finished difference Result 296 states and 301 transitions. [2019-09-03 20:52:23,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:52:23,139 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-09-03 20:52:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:23,142 INFO L225 Difference]: With dead ends: 296 [2019-09-03 20:52:23,142 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 20:52:23,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:52:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 20:52:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 278. [2019-09-03 20:52:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-03 20:52:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2019-09-03 20:52:23,151 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 257 [2019-09-03 20:52:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:23,151 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2019-09-03 20:52:23,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:52:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2019-09-03 20:52:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 20:52:23,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:23,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:23,154 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:23,154 INFO L82 PathProgramCache]: Analyzing trace with hash -559126279, now seen corresponding path program 1 times [2019-09-03 20:52:23,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:23,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:23,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:23,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:23,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:25,090 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:25,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:25,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-03 20:52:25,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:25,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:52:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:52:25,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:52:25,093 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand 65 states. [2019-09-03 20:52:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:26,839 INFO L93 Difference]: Finished difference Result 299 states and 304 transitions. [2019-09-03 20:52:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:52:26,840 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 258 [2019-09-03 20:52:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:26,843 INFO L225 Difference]: With dead ends: 299 [2019-09-03 20:52:26,844 INFO L226 Difference]: Without dead ends: 299 [2019-09-03 20:52:26,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:52:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-03 20:52:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 276. [2019-09-03 20:52:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-03 20:52:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2019-09-03 20:52:26,855 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 258 [2019-09-03 20:52:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:26,856 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2019-09-03 20:52:26,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:52:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2019-09-03 20:52:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 20:52:26,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:26,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:26,860 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:26,861 INFO L82 PathProgramCache]: Analyzing trace with hash -559520514, now seen corresponding path program 1 times [2019-09-03 20:52:26,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:26,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:26,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:27,728 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:27,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:27,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:27,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:27,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:27,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:27,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:27,731 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand 6 states. [2019-09-03 20:52:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:28,315 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-09-03 20:52:28,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:28,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-03 20:52:28,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:28,319 INFO L225 Difference]: With dead ends: 274 [2019-09-03 20:52:28,319 INFO L226 Difference]: Without dead ends: 272 [2019-09-03 20:52:28,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-03 20:52:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-03 20:52:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-03 20:52:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 275 transitions. [2019-09-03 20:52:28,325 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 275 transitions. Word has length 258 [2019-09-03 20:52:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:28,326 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 275 transitions. [2019-09-03 20:52:28,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:28,326 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 275 transitions. [2019-09-03 20:52:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 20:52:28,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:28,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:28,328 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:28,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash -607235764, now seen corresponding path program 1 times [2019-09-03 20:52:28,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:28,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:28,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:28,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:28,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:28,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:28,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:28,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:28,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:28,992 INFO L87 Difference]: Start difference. First operand 272 states and 275 transitions. Second operand 6 states. [2019-09-03 20:52:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:29,642 INFO L93 Difference]: Finished difference Result 280 states and 285 transitions. [2019-09-03 20:52:29,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:29,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-03 20:52:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:29,646 INFO L225 Difference]: With dead ends: 280 [2019-09-03 20:52:29,647 INFO L226 Difference]: Without dead ends: 280 [2019-09-03 20:52:29,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:52:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-03 20:52:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2019-09-03 20:52:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-03 20:52:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2019-09-03 20:52:29,653 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 258 [2019-09-03 20:52:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:29,654 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2019-09-03 20:52:29,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2019-09-03 20:52:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-03 20:52:29,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:29,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:29,656 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash -153040543, now seen corresponding path program 1 times [2019-09-03 20:52:29,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:29,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:29,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:30,346 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:30,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:30,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:30,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:30,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:30,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:30,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:30,348 INFO L87 Difference]: Start difference. First operand 270 states and 273 transitions. Second operand 6 states. [2019-09-03 20:52:31,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:31,020 INFO L93 Difference]: Finished difference Result 283 states and 288 transitions. [2019-09-03 20:52:31,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:31,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-03 20:52:31,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:31,023 INFO L225 Difference]: With dead ends: 283 [2019-09-03 20:52:31,023 INFO L226 Difference]: Without dead ends: 283 [2019-09-03 20:52:31,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:52:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-03 20:52:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2019-09-03 20:52:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-03 20:52:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2019-09-03 20:52:31,032 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 259 [2019-09-03 20:52:31,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:31,032 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2019-09-03 20:52:31,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2019-09-03 20:52:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-03 20:52:31,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:31,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:31,037 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:31,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:31,038 INFO L82 PathProgramCache]: Analyzing trace with hash 562136719, now seen corresponding path program 1 times [2019-09-03 20:52:31,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:31,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:31,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:31,330 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:31,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:31,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:31,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:31,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:31,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:31,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:31,332 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 6 states. [2019-09-03 20:52:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:31,545 INFO L93 Difference]: Finished difference Result 266 states and 269 transitions. [2019-09-03 20:52:31,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:31,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 260 [2019-09-03 20:52:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:31,548 INFO L225 Difference]: With dead ends: 266 [2019-09-03 20:52:31,548 INFO L226 Difference]: Without dead ends: 266 [2019-09-03 20:52:31,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:31,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-03 20:52:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-09-03 20:52:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-03 20:52:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2019-09-03 20:52:31,556 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 260 [2019-09-03 20:52:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:31,557 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2019-09-03 20:52:31,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2019-09-03 20:52:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-03 20:52:31,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:31,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:31,560 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:31,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:31,560 INFO L82 PathProgramCache]: Analyzing trace with hash 246374009, now seen corresponding path program 1 times [2019-09-03 20:52:31,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:31,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:31,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:31,730 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:31,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:31,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:31,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:31,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:31,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:31,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:31,731 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand 4 states. [2019-09-03 20:52:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:32,044 INFO L93 Difference]: Finished difference Result 264 states and 267 transitions. [2019-09-03 20:52:32,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:32,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-09-03 20:52:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:32,045 INFO L225 Difference]: With dead ends: 264 [2019-09-03 20:52:32,046 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:52:32,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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:32,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:52:32,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:52:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:52:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:52:32,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-09-03 20:52:32,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:32,047 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:52:32,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:52:32,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:52:32,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:52:32 BoogieIcfgContainer [2019-09-03 20:52:32,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:52:32,059 INFO L168 Benchmark]: Toolchain (without parser) took 34977.15 ms. Allocated memory was 140.0 MB in the beginning and 913.3 MB in the end (delta: 773.3 MB). Free memory was 84.3 MB in the beginning and 732.8 MB in the end (delta: -648.4 MB). Peak memory consumption was 124.9 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:32,061 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 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:32,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1361.83 ms. Allocated memory was 140.0 MB in the beginning and 219.7 MB in the end (delta: 79.7 MB). Free memory was 83.9 MB in the beginning and 163.2 MB in the end (delta: -79.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:32,069 INFO L168 Benchmark]: Boogie Preprocessor took 192.96 ms. Allocated memory is still 219.7 MB. Free memory was 163.2 MB in the beginning and 155.6 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:32,070 INFO L168 Benchmark]: RCFGBuilder took 2258.41 ms. Allocated memory was 219.7 MB in the beginning and 263.2 MB in the end (delta: 43.5 MB). Free memory was 155.6 MB in the beginning and 184.2 MB in the end (delta: -28.6 MB). Peak memory consumption was 121.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:32,071 INFO L168 Benchmark]: TraceAbstraction took 31159.21 ms. Allocated memory was 263.2 MB in the beginning and 913.3 MB in the end (delta: 650.1 MB). Free memory was 184.2 MB in the beginning and 732.8 MB in the end (delta: -548.6 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:32,080 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.26 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1361.83 ms. Allocated memory was 140.0 MB in the beginning and 219.7 MB in the end (delta: 79.7 MB). Free memory was 83.9 MB in the beginning and 163.2 MB in the end (delta: -79.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 192.96 ms. Allocated memory is still 219.7 MB. Free memory was 163.2 MB in the beginning and 155.6 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2258.41 ms. Allocated memory was 219.7 MB in the beginning and 263.2 MB in the end (delta: 43.5 MB). Free memory was 155.6 MB in the beginning and 184.2 MB in the end (delta: -28.6 MB). Peak memory consumption was 121.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31159.21 ms. Allocated memory was 263.2 MB in the beginning and 913.3 MB in the end (delta: 650.1 MB). Free memory was 184.2 MB in the beginning and 732.8 MB in the end (delta: -548.6 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4790]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4721]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4738]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4778]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4861]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4750]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4818]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4888]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4709]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4806]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4849]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4673]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 480 locations, 16 error locations. SAFE Result, 31.0s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1858 SDtfs, 37107 SDslu, 1966 SDs, 0 SdLazy, 9582 SolverSat, 9730 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1319 GetRequests, 643 SyntacticMatches, 307 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=480occurred 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, 16 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 3604 NumberOfCodeBlocks, 3604 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3588 ConstructedInterpolants, 0 QuantifiedInterpolants, 3599162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...