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-112bae1 [2019-09-10 02:04:15,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:04:15,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:04:15,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:04:15,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:04:15,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:04:15,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:04:15,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:04:15,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:04:15,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:04:15,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:04:15,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:04:15,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:04:15,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:04:15,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:04:15,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:04:15,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:04:15,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:04:15,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:04:15,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:04:15,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:04:15,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:04:15,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:04:15,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:04:15,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:04:15,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:04:15,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:04:15,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:04:15,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:04:15,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:04:15,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:04:15,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:04:15,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:04:15,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:04:15,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:04:15,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:04:15,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:04:15,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:04:15,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:04:15,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:04:15,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:04:15,432 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-10 02:04:15,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:04:15,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:04:15,464 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:04:15,465 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:04:15,468 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:04:15,468 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:04:15,469 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:04:15,469 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:04:15,469 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:04:15,469 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:04:15,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:04:15,473 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:04:15,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:04:15,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:04:15,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:04:15,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:04:15,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:04:15,474 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:04:15,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:04:15,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:04:15,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:04:15,475 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:04:15,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:04:15,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:04:15,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:04:15,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:04:15,477 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:04:15,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:04:15,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:04:15,477 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:04:15,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:04:15,542 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:04:15,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:04:15,546 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:04:15,546 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:04:15,547 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-10 02:04:15,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c61567a6/2cba716e289a49d6ac5b95b2dc21bb56/FLAGc626b3081 [2019-09-10 02:04:15,975 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:04:15,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-09-10 02:04:15,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c61567a6/2cba716e289a49d6ac5b95b2dc21bb56/FLAGc626b3081 [2019-09-10 02:04:16,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c61567a6/2cba716e289a49d6ac5b95b2dc21bb56 [2019-09-10 02:04:16,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:04:16,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:04:16,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:16,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:04:16,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:04:16,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:16" (1/1) ... [2019-09-10 02:04:16,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc9efcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:16, skipping insertion in model container [2019-09-10 02:04:16,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:16" (1/1) ... [2019-09-10 02:04:16,397 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:04:16,417 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:04:16,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:16,591 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:04:16,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:16,648 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:04:16,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:16 WrapperNode [2019-09-10 02:04:16,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:16,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:04:16,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:04:16,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:04:16,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:16" (1/1) ... [2019-09-10 02:04:16,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:16" (1/1) ... [2019-09-10 02:04:16,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:16" (1/1) ... [2019-09-10 02:04:16,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:16" (1/1) ... [2019-09-10 02:04:16,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:16" (1/1) ... [2019-09-10 02:04:16,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:16" (1/1) ... [2019-09-10 02:04:16,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:16" (1/1) ... [2019-09-10 02:04:16,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:04:16,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:04:16,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:04:16,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:04:16,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:16" (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-10 02:04:16,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:04:16,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:04:16,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:04:16,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:04:16,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:04:16,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:04:16,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:04:16,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:04:16,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:04:16,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:04:16,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:04:17,082 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:04:17,082 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 02:04:17,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:17 BoogieIcfgContainer [2019-09-10 02:04:17,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:04:17,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:04:17,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:04:17,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:04:17,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:04:16" (1/3) ... [2019-09-10 02:04:17,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6b58a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:17, skipping insertion in model container [2019-09-10 02:04:17,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:16" (2/3) ... [2019-09-10 02:04:17,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6b58a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:17, skipping insertion in model container [2019-09-10 02:04:17,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:17" (3/3) ... [2019-09-10 02:04:17,110 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2019-09-10 02:04:17,121 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:04:17,129 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:04:17,145 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:04:17,173 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:04:17,175 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:04:17,175 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:04:17,175 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:04:17,176 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:04:17,176 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:04:17,176 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:04:17,176 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:04:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-09-10 02:04:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:04:17,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:17,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:17,207 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1778619980, now seen corresponding path program 1 times [2019-09-10 02:04:17,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:17,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:17,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:17,417 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-10 02:04:17,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:17,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:17,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:17,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:17,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:17,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:17,438 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-09-10 02:04:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:17,615 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2019-09-10 02:04:17,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:17,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 02:04:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:17,629 INFO L225 Difference]: With dead ends: 48 [2019-09-10 02:04:17,629 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 02:04:17,631 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-10 02:04:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 02:04:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-09-10 02:04:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 02:04:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-09-10 02:04:17,681 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 13 [2019-09-10 02:04:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:17,682 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-09-10 02:04:17,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-09-10 02:04:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:04:17,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:17,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:17,685 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:17,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1756664013, now seen corresponding path program 1 times [2019-09-10 02:04:17,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:17,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:17,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:17,736 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-10 02:04:17,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:17,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:17,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:17,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:17,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:17,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:17,741 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 5 states. [2019-09-10 02:04:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:17,864 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2019-09-10 02:04:17,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:17,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 02:04:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:17,867 INFO L225 Difference]: With dead ends: 54 [2019-09-10 02:04:17,867 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 02:04:17,868 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-10 02:04:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 02:04:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-09-10 02:04:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 02:04:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2019-09-10 02:04:17,881 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2019-09-10 02:04:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:17,882 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-09-10 02:04:17,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2019-09-10 02:04:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:17,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:17,883 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:17,883 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:17,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:17,884 INFO L82 PathProgramCache]: Analyzing trace with hash -276218857, now seen corresponding path program 1 times [2019-09-10 02:04:17,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:17,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:17,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:17,941 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-10 02:04:17,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:17,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:17,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:17,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:17,948 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 5 states. [2019-09-10 02:04:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,060 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2019-09-10 02:04:18,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:18,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:18,066 INFO L225 Difference]: With dead ends: 54 [2019-09-10 02:04:18,066 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 02:04:18,066 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-10 02:04:18,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 02:04:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-10 02:04:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-10 02:04:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2019-09-10 02:04:18,089 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2019-09-10 02:04:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:18,089 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-09-10 02:04:18,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2019-09-10 02:04:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 02:04:18,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:18,091 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-10 02:04:18,093 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash -12086036, now seen corresponding path program 1 times [2019-09-10 02:04:18,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:18,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:18,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:18,193 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-10 02:04:18,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:18,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:18,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:18,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:18,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:18,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:18,196 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 6 states. [2019-09-10 02:04:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,340 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-09-10 02:04:18,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:04:18,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-10 02:04:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:18,342 INFO L225 Difference]: With dead ends: 58 [2019-09-10 02:04:18,342 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 02:04:18,342 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-10 02:04:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 02:04:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-10 02:04:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-10 02:04:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-09-10 02:04:18,350 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2019-09-10 02:04:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:18,351 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-09-10 02:04:18,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-09-10 02:04:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 02:04:18,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:18,353 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-10 02:04:18,353 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:18,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:18,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1403678473, now seen corresponding path program 1 times [2019-09-10 02:04:18,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:18,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:18,404 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-10 02:04:18,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:18,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:18,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:18,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:18,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:18,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:18,406 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 5 states. [2019-09-10 02:04:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,492 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2019-09-10 02:04:18,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:18,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-10 02:04:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:18,495 INFO L225 Difference]: With dead ends: 63 [2019-09-10 02:04:18,495 INFO L226 Difference]: Without dead ends: 63 [2019-09-10 02:04:18,495 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-10 02:04:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-10 02:04:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-10 02:04:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-10 02:04:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-09-10 02:04:18,503 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2019-09-10 02:04:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:18,504 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-09-10 02:04:18,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-09-10 02:04:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 02:04:18,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:18,506 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-10 02:04:18,506 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:18,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:18,506 INFO L82 PathProgramCache]: Analyzing trace with hash -869865180, now seen corresponding path program 1 times [2019-09-10 02:04:18,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:18,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:18,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:18,598 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-10 02:04:18,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:18,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:18,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:18,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:18,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:18,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:18,601 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 6 states. [2019-09-10 02:04:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,736 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-09-10 02:04:18,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:04:18,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-09-10 02:04:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:18,738 INFO L225 Difference]: With dead ends: 72 [2019-09-10 02:04:18,738 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 02:04:18,739 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-10 02:04:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 02:04:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-09-10 02:04:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-10 02:04:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-09-10 02:04:18,747 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2019-09-10 02:04:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:18,747 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-09-10 02:04:18,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-09-10 02:04:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 02:04:18,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:18,750 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-10 02:04:18,750 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:18,751 INFO L82 PathProgramCache]: Analyzing trace with hash -863098428, now seen corresponding path program 1 times [2019-09-10 02:04:18,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:18,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:18,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:18,850 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-10 02:04:18,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:18,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:04:18,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:18,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:04:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:04:18,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:18,857 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2019-09-10 02:04:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,998 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2019-09-10 02:04:18,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:18,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-09-10 02:04:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:19,000 INFO L225 Difference]: With dead ends: 72 [2019-09-10 02:04:19,000 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 02:04:19,001 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-10 02:04:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 02:04:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-09-10 02:04:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 02:04:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-09-10 02:04:19,008 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2019-09-10 02:04:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:19,009 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-09-10 02:04:19,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:04:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-09-10 02:04:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 02:04:19,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:19,011 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-10 02:04:19,011 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:19,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1349635161, now seen corresponding path program 1 times [2019-09-10 02:04:19,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:19,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:19,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:19,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:19,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:19,105 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-10 02:04:19,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:19,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:04:19,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:19,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:04:19,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:04:19,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:04:19,108 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2019-09-10 02:04:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:19,300 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2019-09-10 02:04:19,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:04:19,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-09-10 02:04:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:19,307 INFO L225 Difference]: With dead ends: 70 [2019-09-10 02:04:19,308 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:04:19,310 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-10 02:04:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:04:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:04:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:04:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:04:19,311 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-09-10 02:04:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:19,311 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:04:19,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:04:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:04:19,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:04:19,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:04:19 BoogieIcfgContainer [2019-09-10 02:04:19,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:04:19,320 INFO L168 Benchmark]: Toolchain (without parser) took 2935.32 ms. Allocated memory was 140.5 MB in the beginning and 257.9 MB in the end (delta: 117.4 MB). Free memory was 88.4 MB in the beginning and 230.8 MB in the end (delta: -142.4 MB). Peak memory consumption was 102.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:19,322 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:04:19,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.71 ms. Allocated memory is still 140.5 MB. Free memory was 88.2 MB in the beginning and 78.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:19,326 INFO L168 Benchmark]: Boogie Preprocessor took 115.94 ms. Allocated memory was 140.5 MB in the beginning and 199.8 MB in the end (delta: 59.2 MB). Free memory was 78.3 MB in the beginning and 177.3 MB in the end (delta: -99.0 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:19,327 INFO L168 Benchmark]: RCFGBuilder took 317.77 ms. Allocated memory is still 199.8 MB. Free memory was 176.7 MB in the beginning and 162.0 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:19,334 INFO L168 Benchmark]: TraceAbstraction took 2226.06 ms. Allocated memory was 199.8 MB in the beginning and 257.9 MB in the end (delta: 58.2 MB). Free memory was 161.4 MB in the beginning and 230.8 MB in the end (delta: -69.3 MB). Peak memory consumption was 115.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:19,340 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.18 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 265.71 ms. Allocated memory is still 140.5 MB. Free memory was 88.2 MB in the beginning and 78.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.94 ms. Allocated memory was 140.5 MB in the beginning and 199.8 MB in the end (delta: 59.2 MB). Free memory was 78.3 MB in the beginning and 177.3 MB in the end (delta: -99.0 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 317.77 ms. Allocated memory is still 199.8 MB. Free memory was 176.7 MB in the beginning and 162.0 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2226.06 ms. Allocated memory was 199.8 MB in the beginning and 257.9 MB in the end (delta: 58.2 MB). Free memory was 161.4 MB in the beginning and 230.8 MB in the end (delta: -69.3 MB). Peak memory consumption was 115.8 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.1s 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.7s 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...