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/float-benchs/drift_tenth.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:30:52,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:30:52,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:30:52,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:30:52,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:30:52,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:30:52,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:30:52,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:30:52,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:30:52,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:30:52,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:30:52,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:30:52,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:30:52,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:30:52,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:30:52,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:30:52,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:30:52,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:30:52,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:30:52,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:30:52,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:30:52,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:30:52,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:30:52,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:30:52,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:30:52,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:30:52,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:30:52,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:30:52,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:30:52,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:30:52,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:30:52,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:30:52,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:30:52,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:30:52,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:30:52,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:30:52,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:30:52,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:30:52,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:30:52,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:30:52,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:30:52,523 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 01:30:52,548 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:30:52,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:30:52,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:30:52,549 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:30:52,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:30:52,550 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:30:52,550 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:30:52,550 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:30:52,550 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:30:52,550 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:30:52,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:30:52,551 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:30:52,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:30:52,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:30:52,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:30:52,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:30:52,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:30:52,552 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:30:52,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:30:52,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:30:52,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:30:52,553 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:30:52,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:30:52,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:30:52,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:30:52,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:30:52,554 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:30:52,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:30:52,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:30:52,555 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:30:52,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:30:52,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:30:52,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:30:52,597 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:30:52,598 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:30:52,598 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c [2019-09-10 01:30:52,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9902e78f4/be07668f45084b92bbaa292304fe4421/FLAGda9b3bc08 [2019-09-10 01:30:53,059 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:30:53,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c [2019-09-10 01:30:53,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9902e78f4/be07668f45084b92bbaa292304fe4421/FLAGda9b3bc08 [2019-09-10 01:30:53,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9902e78f4/be07668f45084b92bbaa292304fe4421 [2019-09-10 01:30:53,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:30:53,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:30:53,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:30:53,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:30:53,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:30:53,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:30:53" (1/1) ... [2019-09-10 01:30:53,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671ed55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:53, skipping insertion in model container [2019-09-10 01:30:53,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:30:53" (1/1) ... [2019-09-10 01:30:53,459 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:30:53,476 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:30:53,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:30:53,682 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:30:53,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:30:53,717 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:30:53,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:53 WrapperNode [2019-09-10 01:30:53,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:30:53,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:30:53,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:30:53,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:30:53,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:53" (1/1) ... [2019-09-10 01:30:53,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:53" (1/1) ... [2019-09-10 01:30:53,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:53" (1/1) ... [2019-09-10 01:30:53,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:53" (1/1) ... [2019-09-10 01:30:53,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:53" (1/1) ... [2019-09-10 01:30:53,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:53" (1/1) ... [2019-09-10 01:30:53,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:53" (1/1) ... [2019-09-10 01:30:53,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:30:53,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:30:53,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:30:53,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:30:53,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:53" (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 01:30:53,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:30:53,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:30:53,886 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:30:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:30:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:30:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:30:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:30:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:30:54,056 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:30:54,056 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 01:30:54,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:30:54 BoogieIcfgContainer [2019-09-10 01:30:54,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:30:54,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:30:54,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:30:54,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:30:54,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:30:53" (1/3) ... [2019-09-10 01:30:54,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66551ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:30:54, skipping insertion in model container [2019-09-10 01:30:54,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:53" (2/3) ... [2019-09-10 01:30:54,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66551ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:30:54, skipping insertion in model container [2019-09-10 01:30:54,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:30:54" (3/3) ... [2019-09-10 01:30:54,074 INFO L109 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2019-09-10 01:30:54,084 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:30:54,105 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:30:54,122 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:30:54,156 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:30:54,156 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:30:54,156 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:30:54,156 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:30:54,157 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:30:54,157 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:30:54,157 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:30:54,157 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:30:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-09-10 01:30:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-09-10 01:30:54,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:54,188 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:54,190 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:54,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2019-09-10 01:30:54,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:54,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:54,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:54,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:54,338 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 01:30:54,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:30:54,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:30:54,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:30:54,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:30:54,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:30:54,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:30:54,364 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-09-10 01:30:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:54,402 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-09-10 01:30:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:30:54,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-09-10 01:30:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:54,419 INFO L225 Difference]: With dead ends: 15 [2019-09-10 01:30:54,419 INFO L226 Difference]: Without dead ends: 11 [2019-09-10 01:30:54,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:30:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-09-10 01:30:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-09-10 01:30:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-09-10 01:30:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-09-10 01:30:54,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-09-10 01:30:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:54,459 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-09-10 01:30:54,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:30:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-09-10 01:30:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:30:54,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:54,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:54,461 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2019-09-10 01:30:54,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:54,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:54,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:54,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:54,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:54,527 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-09-10 01:30:54,529 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [14], [15], [19], [20], [21] [2019-09-10 01:30:54,574 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:30:54,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:30:54,678 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:30:54,679 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:30:54,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:30:54,697 INFO L272 AbstractInterpreter]: Visited 10 different actions 28 times. Merged at 4 different actions 13 times. Widened at 1 different actions 3 times. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 7 variables. [2019-09-10 01:30:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:54,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:30:54,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:54,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:30:54,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:54,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:54,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 01:30:54,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:54,817 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:54,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:54,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-10 01:30:54,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:54,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:30:54,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:30:54,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:30:54,882 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 4 states. [2019-09-10 01:30:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:54,910 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-09-10 01:30:54,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:30:54,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-09-10 01:30:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:54,912 INFO L225 Difference]: With dead ends: 12 [2019-09-10 01:30:54,912 INFO L226 Difference]: Without dead ends: 12 [2019-09-10 01:30:54,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:30:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-10 01:30:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-10 01:30:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-10 01:30:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-10 01:30:54,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-10 01:30:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:54,917 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-10 01:30:54,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:30:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-10 01:30:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-10 01:30:54,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:54,918 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:54,919 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:54,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:54,919 INFO L82 PathProgramCache]: Analyzing trace with hash 645203835, now seen corresponding path program 2 times [2019-09-10 01:30:54,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:54,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:54,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:54,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:55,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:55,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:55,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:55,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:30:55,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:30:55,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 01:30:55,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:55,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 01:30:55,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:55,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-09-10 01:30:55,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:55,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:30:55,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:30:55,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:30:55,118 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-10 01:30:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:55,135 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-09-10 01:30:55,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:30:55,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-10 01:30:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:55,137 INFO L225 Difference]: With dead ends: 13 [2019-09-10 01:30:55,137 INFO L226 Difference]: Without dead ends: 13 [2019-09-10 01:30:55,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:30:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-10 01:30:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-10 01:30:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-10 01:30:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-10 01:30:55,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-10 01:30:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:55,141 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-10 01:30:55,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:30:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-10 01:30:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 01:30:55,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:55,142 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:55,142 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 3 times [2019-09-10 01:30:55,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:55,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:55,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:55,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:55,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:30:55,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:30:55,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:30:55,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:55,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 01:30:55,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:55,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-10 01:30:55,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:55,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:30:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:30:55,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:30:55,299 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-10 01:30:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:55,323 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-10 01:30:55,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:30:55,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-10 01:30:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:55,325 INFO L225 Difference]: With dead ends: 14 [2019-09-10 01:30:55,325 INFO L226 Difference]: Without dead ends: 14 [2019-09-10 01:30:55,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:30:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-10 01:30:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-10 01:30:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 01:30:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-10 01:30:55,331 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-10 01:30:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:55,332 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-10 01:30:55,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:30:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-10 01:30:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:30:55,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:55,333 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:55,333 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:55,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:55,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1563595419, now seen corresponding path program 4 times [2019-09-10 01:30:55,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:55,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:55,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:55,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:55,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:55,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:30:55,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:55,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:55,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 01:30:55,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:55,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-10 01:30:55,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:55,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:30:55,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:30:55,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:55,631 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-10 01:30:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:55,659 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-09-10 01:30:55,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:30:55,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-10 01:30:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:55,661 INFO L225 Difference]: With dead ends: 15 [2019-09-10 01:30:55,661 INFO L226 Difference]: Without dead ends: 15 [2019-09-10 01:30:55,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-10 01:30:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-10 01:30:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 01:30:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-10 01:30:55,670 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-10 01:30:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:55,670 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-10 01:30:55,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:30:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-10 01:30:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 01:30:55,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:55,671 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:55,672 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1226755252, now seen corresponding path program 5 times [2019-09-10 01:30:55,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:55,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:55,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:55,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:55,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:55,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:55,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:30:55,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:30:55,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 01:30:55,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:55,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 01:30:55,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,789 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:55,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2019-09-10 01:30:55,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:55,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:30:55,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:30:55,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:55,867 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-10 01:30:55,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:55,889 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-10 01:30:55,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:30:55,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-10 01:30:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:55,891 INFO L225 Difference]: With dead ends: 16 [2019-09-10 01:30:55,891 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 01:30:55,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 01:30:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-10 01:30:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-10 01:30:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-10 01:30:55,894 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-10 01:30:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:55,895 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-10 01:30:55,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:30:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-10 01:30:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 01:30:55,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:55,896 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:55,896 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:55,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:55,897 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 6 times [2019-09-10 01:30:55,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:55,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:55,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:55,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:55,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:55,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:30:55,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:30:55,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:56,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:30:56,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:56,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 01:30:56,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:56,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2019-09-10 01:30:56,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:56,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:30:56,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:30:56,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:56,102 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-10 01:30:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:56,132 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-09-10 01:30:56,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:30:56,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-10 01:30:56,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:56,134 INFO L225 Difference]: With dead ends: 17 [2019-09-10 01:30:56,134 INFO L226 Difference]: Without dead ends: 17 [2019-09-10 01:30:56,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:56,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-10 01:30:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-10 01:30:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 01:30:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-10 01:30:56,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-10 01:30:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:56,140 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-10 01:30:56,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:30:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-10 01:30:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 01:30:56,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:56,144 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:56,144 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2088758676, now seen corresponding path program 7 times [2019-09-10 01:30:56,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:56,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:56,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:56,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:56,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:56,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:56,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:56,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:30:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:56,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:30:56,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:30:56,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:56,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2019-09-10 01:30:56,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:56,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:30:56,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:30:56,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:56,399 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-10 01:30:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:56,418 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 01:30:56,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:30:56,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-10 01:30:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:56,419 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:30:56,420 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 01:30:56,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 01:30:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 01:30:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 01:30:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-10 01:30:56,424 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-10 01:30:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:56,424 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-10 01:30:56,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:30:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-10 01:30:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:30:56,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:56,425 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:56,425 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:56,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:56,426 INFO L82 PathProgramCache]: Analyzing trace with hash 326947035, now seen corresponding path program 8 times [2019-09-10 01:30:56,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:56,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:56,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:56,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:56,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:56,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:56,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:30:56,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:30:56,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-10 01:30:56,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:56,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 01:30:56,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:56,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 12 [2019-09-10 01:30:56,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:56,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:30:56,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:30:56,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:56,681 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-10 01:30:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:56,704 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-10 01:30:56,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:30:56,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-10 01:30:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:56,705 INFO L225 Difference]: With dead ends: 19 [2019-09-10 01:30:56,705 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 01:30:56,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 01:30:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 01:30:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 01:30:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-10 01:30:56,709 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-10 01:30:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:56,709 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-10 01:30:56,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:30:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-10 01:30:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:30:56,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:56,710 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:56,710 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:56,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1545361012, now seen corresponding path program 9 times [2019-09-10 01:30:56,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:56,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:56,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:56,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:56,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:30:56,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:30:56,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:30:56,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:56,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 01:30:56,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:56,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-09-10 01:30:56,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:56,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:30:56,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:30:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:56,943 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-10 01:30:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:56,974 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-10 01:30:56,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 01:30:56,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-10 01:30:56,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:56,975 INFO L225 Difference]: With dead ends: 20 [2019-09-10 01:30:56,975 INFO L226 Difference]: Without dead ends: 20 [2019-09-10 01:30:56,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-10 01:30:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-10 01:30:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 01:30:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-10 01:30:56,978 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-10 01:30:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:56,979 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-10 01:30:56,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:30:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-10 01:30:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 01:30:56,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:56,980 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:56,980 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:56,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:56,980 INFO L82 PathProgramCache]: Analyzing trace with hash 661488635, now seen corresponding path program 10 times [2019-09-10 01:30:56,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:56,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:56,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:57,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:57,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:57,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:57,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:57,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:57,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:57,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:30:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:57,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 01:30:57,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:57,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:30:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 45 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,562 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:57,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2019-09-10 01:30:57,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:57,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 01:30:57,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 01:30:57,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 01:30:57,824 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 25 states. [2019-09-10 01:30:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:57,927 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 01:30:57,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 01:30:57,927 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 19 [2019-09-10 01:30:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:57,928 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:30:57,928 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:30:57,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 01:30:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:30:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:30:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:30:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:30:57,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-09-10 01:30:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:57,930 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:30:57,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 01:30:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:30:57,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:30:57,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:30:57 BoogieIcfgContainer [2019-09-10 01:30:57,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:30:57,937 INFO L168 Benchmark]: Toolchain (without parser) took 4493.25 ms. Allocated memory was 136.3 MB in the beginning and 251.1 MB in the end (delta: 114.8 MB). Free memory was 91.3 MB in the beginning and 164.3 MB in the end (delta: -73.0 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2019-09-10 01:30:57,938 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.3 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-10 01:30:57,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.91 ms. Allocated memory is still 136.3 MB. Free memory was 91.1 MB in the beginning and 82.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-10 01:30:57,940 INFO L168 Benchmark]: Boogie Preprocessor took 114.33 ms. Allocated memory was 136.3 MB in the beginning and 201.9 MB in the end (delta: 65.5 MB). Free memory was 82.1 MB in the beginning and 178.7 MB in the end (delta: -96.6 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:30:57,941 INFO L168 Benchmark]: RCFGBuilder took 226.92 ms. Allocated memory is still 201.9 MB. Free memory was 178.7 MB in the beginning and 168.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:30:57,942 INFO L168 Benchmark]: TraceAbstraction took 3873.87 ms. Allocated memory was 201.9 MB in the beginning and 251.1 MB in the end (delta: 49.3 MB). Free memory was 168.5 MB in the beginning and 164.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:30:57,945 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 136.3 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.91 ms. Allocated memory is still 136.3 MB. Free memory was 91.1 MB in the beginning and 82.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.33 ms. Allocated memory was 136.3 MB in the beginning and 201.9 MB in the end (delta: 65.5 MB). Free memory was 82.1 MB in the beginning and 178.7 MB in the end (delta: -96.6 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 226.92 ms. Allocated memory is still 201.9 MB. Free memory was 178.7 MB in the beginning and 168.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3873.87 ms. Allocated memory was 201.9 MB in the beginning and 251.1 MB in the end (delta: 49.3 MB). Free memory was 168.5 MB in the beginning and 164.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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 3 procedures, 14 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 SDtfs, 4 SDslu, 396 SDs, 0 SdLazy, 208 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 225 SyntacticMatches, 31 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 413 ConstructedInterpolants, 0 QuantifiedInterpolants, 14093 SizeOfPredicates, 13 NumberOfNonLiveVariables, 555 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 45/660 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...