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/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:51:49,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:51:49,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:51:49,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:51:49,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:51:49,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:51:49,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:51:49,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:51:49,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:51:49,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:51:49,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:51:49,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:51:49,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:51:49,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:51:49,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:51:49,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:51:49,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:51:49,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:51:49,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:51:49,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:51:49,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:51:49,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:51:49,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:51:49,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:51:49,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:51:49,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:51:49,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:51:49,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:51:49,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:51:49,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:51:49,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:51:49,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:51:49,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:51:49,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:51:49,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:51:49,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:51:49,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:51:49,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:51:49,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:51:49,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:51:49,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:51:49,167 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:49,181 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:51:49,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:51:49,182 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:51:49,182 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:51:49,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:51:49,183 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:51:49,183 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:51:49,183 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:51:49,183 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:51:49,184 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:51:49,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:51:49,184 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:51:49,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:51:49,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:51:49,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:51:49,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:51:49,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:51:49,185 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:51:49,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:51:49,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:51:49,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:51:49,186 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:51:49,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:51:49,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:49,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:51:49,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:51:49,187 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:51:49,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:51:49,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:51:49,188 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:51:49,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:51:49,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:51:49,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:51:49,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:51:49,233 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:51:49,233 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-09-03 20:51:49,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28fc0914a/159be8849f97481e9b90877ae4a024fb/FLAG5bb3447d2 [2019-09-03 20:51:49,683 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:51:49,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-09-03 20:51:49,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28fc0914a/159be8849f97481e9b90877ae4a024fb/FLAG5bb3447d2 [2019-09-03 20:51:50,037 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28fc0914a/159be8849f97481e9b90877ae4a024fb [2019-09-03 20:51:50,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:51:50,050 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:51:50,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:50,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:51:50,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:51:50,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:50" (1/1) ... [2019-09-03 20:51:50,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac0f941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50, skipping insertion in model container [2019-09-03 20:51:50,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:50" (1/1) ... [2019-09-03 20:51:50,066 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:51:50,084 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:51:50,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:50,284 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:51:50,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:50,331 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:51:50,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50 WrapperNode [2019-09-03 20:51:50,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:50,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:51:50,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:51:50,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:51:50,346 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:50" (1/1) ... [2019-09-03 20:51:50,346 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:50" (1/1) ... [2019-09-03 20:51:50,433 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:50" (1/1) ... [2019-09-03 20:51:50,433 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:50" (1/1) ... [2019-09-03 20:51:50,437 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:50" (1/1) ... [2019-09-03 20:51:50,442 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:50" (1/1) ... [2019-09-03 20:51:50,443 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:50" (1/1) ... [2019-09-03 20:51:50,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:51:50,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:51:50,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:51:50,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:51:50,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50" (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:50,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:51:50,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:51:50,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:51:50,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:51:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:51:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:51:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:51:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:51:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:51:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:51:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:51:50,760 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:51:50,760 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:51:50,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:50 BoogieIcfgContainer [2019-09-03 20:51:50,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:51:50,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:51:50,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:51:50,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:51:50,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:51:50" (1/3) ... [2019-09-03 20:51:50,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650293fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:50, skipping insertion in model container [2019-09-03 20:51:50,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50" (2/3) ... [2019-09-03 20:51:50,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650293fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:50, skipping insertion in model container [2019-09-03 20:51:50,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:50" (3/3) ... [2019-09-03 20:51:50,777 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2019-09-03 20:51:50,793 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:51:50,799 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:51:50,815 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:51:50,841 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:51:50,841 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:51:50,841 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:51:50,841 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:51:50,842 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:51:50,842 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:51:50,842 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:51:50,842 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:51:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-09-03 20:51:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:51:50,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:50,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:50,870 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1778619980, now seen corresponding path program 1 times [2019-09-03 20:51:50,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:50,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:50,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:50,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:50,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:51,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:51,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:51,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:51,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:51,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:51,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:51,086 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-09-03 20:51:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:51,243 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2019-09-03 20:51:51,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:51,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-03 20:51:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:51,255 INFO L225 Difference]: With dead ends: 48 [2019-09-03 20:51:51,255 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:51:51,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:51:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-09-03 20:51:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:51:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-09-03 20:51:51,326 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 13 [2019-09-03 20:51:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:51,327 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-09-03 20:51:51,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-09-03 20:51:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:51:51,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:51,330 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:51,330 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:51,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:51,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1756664013, now seen corresponding path program 1 times [2019-09-03 20:51:51,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:51,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:51,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:51,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:51,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:51,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:51,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:51,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:51,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:51,431 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 5 states. [2019-09-03 20:51:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:51,536 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2019-09-03 20:51:51,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:51,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-03 20:51:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:51,539 INFO L225 Difference]: With dead ends: 54 [2019-09-03 20:51:51,540 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 20:51:51,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 20:51:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-09-03 20:51:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:51:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2019-09-03 20:51:51,553 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2019-09-03 20:51:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:51,554 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-09-03 20:51:51,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2019-09-03 20:51:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:51:51,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:51,555 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:51,555 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:51,556 INFO L82 PathProgramCache]: Analyzing trace with hash -276218857, now seen corresponding path program 1 times [2019-09-03 20:51:51,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:51,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:51,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:51,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:51,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:51,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:51,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:51,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:51,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:51,621 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 5 states. [2019-09-03 20:51:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:51,730 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2019-09-03 20:51:51,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:51,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 20:51:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:51,737 INFO L225 Difference]: With dead ends: 54 [2019-09-03 20:51:51,737 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 20:51:51,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 20:51:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-03 20:51:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 20:51:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2019-09-03 20:51:51,755 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2019-09-03 20:51:51,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:51,756 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-09-03 20:51:51,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2019-09-03 20:51:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:51:51,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:51,759 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:51,759 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:51,760 INFO L82 PathProgramCache]: Analyzing trace with hash -12086036, now seen corresponding path program 1 times [2019-09-03 20:51:51,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:51:51,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:51,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:51:51,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:51,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:51:51,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:51:51,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:51,851 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 6 states. [2019-09-03 20:51:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:52,005 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-09-03 20:51:52,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:51:52,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-03 20:51:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:52,008 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:51:52,008 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:51:52,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:51:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:51:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-03 20:51:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 20:51:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-09-03 20:51:52,037 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2019-09-03 20:51:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:52,037 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-09-03 20:51:52,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:51:52,038 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-09-03 20:51:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:51:52,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:52,039 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:52,040 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:52,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1403678473, now seen corresponding path program 1 times [2019-09-03 20:51:52,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:52,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:52,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:51:52,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:52,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:52,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:52,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:52,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:52,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:52,114 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 5 states. [2019-09-03 20:51:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:52,206 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2019-09-03 20:51:52,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:52,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-03 20:51:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:52,208 INFO L225 Difference]: With dead ends: 63 [2019-09-03 20:51:52,208 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 20:51:52,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 20:51:52,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-03 20:51:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 20:51:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-09-03 20:51:52,217 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2019-09-03 20:51:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:52,217 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-09-03 20:51:52,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-09-03 20:51:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:51:52,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:52,222 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 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:51:52,222 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:52,223 INFO L82 PathProgramCache]: Analyzing trace with hash -869865180, now seen corresponding path program 1 times [2019-09-03 20:51:52,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:52,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:52,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:51:52,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:52,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:51:52,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:52,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:51:52,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:51:52,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:52,339 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 6 states. [2019-09-03 20:51:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:52,469 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-09-03 20:51:52,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:51:52,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-09-03 20:51:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:52,473 INFO L225 Difference]: With dead ends: 72 [2019-09-03 20:51:52,473 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:51:52,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:51:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:51:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-09-03 20:51:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 20:51:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-09-03 20:51:52,489 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2019-09-03 20:51:52,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:52,490 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-09-03 20:51:52,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:51:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-09-03 20:51:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:51:52,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:52,495 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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:51:52,495 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:52,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:52,496 INFO L82 PathProgramCache]: Analyzing trace with hash -863098428, now seen corresponding path program 1 times [2019-09-03 20:51:52,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:52,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:51:52,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:52,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:51:52,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:52,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:51:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:51:52,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:51:52,616 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2019-09-03 20:51:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:52,785 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2019-09-03 20:51:52,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:51:52,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-09-03 20:51:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:52,787 INFO L225 Difference]: With dead ends: 72 [2019-09-03 20:51:52,787 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:51:52,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:51:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:51:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-09-03 20:51:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:51:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-09-03 20:51:52,795 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2019-09-03 20:51:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:52,796 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-09-03 20:51:52,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:51:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-09-03 20:51:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-03 20:51:52,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:52,798 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:52,798 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:52,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1349635161, now seen corresponding path program 1 times [2019-09-03 20:51:52,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:51:52,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:52,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-03 20:51:52,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:52,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:51:52,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:51:52,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:51:52,879 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2019-09-03 20:51:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:53,050 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2019-09-03 20:51:53,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:51:53,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-09-03 20:51:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:53,051 INFO L225 Difference]: With dead ends: 70 [2019-09-03 20:51:53,051 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:51:53,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:51:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:51:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:51:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:51:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:51:53,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-09-03 20:51:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:53,053 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:51:53,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:51:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:51:53,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:51:53,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:51:53 BoogieIcfgContainer [2019-09-03 20:51:53,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:51:53,061 INFO L168 Benchmark]: Toolchain (without parser) took 3010.26 ms. Allocated memory was 131.1 MB in the beginning and 219.7 MB in the end (delta: 88.6 MB). Free memory was 87.2 MB in the beginning and 67.7 MB in the end (delta: 19.5 MB). Peak memory consumption was 108.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:53,062 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 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:51:53,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.74 ms. Allocated memory is still 131.1 MB. Free memory was 87.0 MB in the beginning and 77.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:53,064 INFO L168 Benchmark]: Boogie Preprocessor took 118.11 ms. Allocated memory was 131.1 MB in the beginning and 199.2 MB in the end (delta: 68.2 MB). Free memory was 77.2 MB in the beginning and 175.6 MB in the end (delta: -98.4 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:53,065 INFO L168 Benchmark]: RCFGBuilder took 311.48 ms. Allocated memory is still 199.2 MB. Free memory was 175.6 MB in the beginning and 160.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:53,066 INFO L168 Benchmark]: TraceAbstraction took 2295.16 ms. Allocated memory was 199.2 MB in the beginning and 219.7 MB in the end (delta: 20.4 MB). Free memory was 160.3 MB in the beginning and 67.7 MB in the end (delta: 92.6 MB). Peak memory consumption was 113.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:53,070 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.20 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 280.74 ms. Allocated memory is still 131.1 MB. Free memory was 87.0 MB in the beginning and 77.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.11 ms. Allocated memory was 131.1 MB in the beginning and 199.2 MB in the end (delta: 68.2 MB). Free memory was 77.2 MB in the beginning and 175.6 MB in the end (delta: -98.4 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 311.48 ms. Allocated memory is still 199.2 MB. Free memory was 175.6 MB in the beginning and 160.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2295.16 ms. Allocated memory was 199.2 MB in the beginning and 219.7 MB in the end (delta: 20.4 MB). Free memory was 160.3 MB in the beginning and 67.7 MB in the end (delta: 92.6 MB). Peak memory consumption was 113.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. SAFE Result, 2.2s OverallTime, 8 OverallIterations, 11 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 395 SDtfs, 102 SDslu, 1026 SDs, 0 SdLazy, 528 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, 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, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 23798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...