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/loops/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:35:12,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:35:12,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:35:12,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:35:12,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:35:12,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:35:12,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:35:12,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:35:12,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:35:12,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:35:12,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:35:12,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:35:12,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:35:12,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:35:12,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:35:12,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:35:12,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:35:12,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:35:12,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:35:12,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:35:12,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:35:12,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:35:12,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:35:12,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:35:12,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:35:12,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:35:12,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:35:12,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:35:12,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:35:12,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:35:12,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:35:12,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:35:12,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:35:12,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:35:12,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:35:12,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:35:12,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:35:12,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:35:12,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:35:12,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:35:12,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:35:12,427 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-10-03 02:35:12,442 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:35:12,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:35:12,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:35:12,443 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:35:12,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:35:12,444 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:35:12,444 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:35:12,445 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:35:12,445 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:35:12,445 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:35:12,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:35:12,446 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:35:12,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:35:12,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:35:12,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:35:12,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:35:12,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:35:12,447 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:35:12,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:35:12,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:35:12,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:35:12,448 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:35:12,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:35:12,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:35:12,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:35:12,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:35:12,449 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:35:12,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:35:12,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:35:12,450 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:35:12,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:35:12,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:35:12,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:35:12,502 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:35:12,503 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:35:12,504 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2019-10-03 02:35:12,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe5d29950/79e9491483ce4dc2ac54cbd83ff286f3/FLAG41ae536c0 [2019-10-03 02:35:13,097 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:35:13,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2019-10-03 02:35:13,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe5d29950/79e9491483ce4dc2ac54cbd83ff286f3/FLAG41ae536c0 [2019-10-03 02:35:13,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe5d29950/79e9491483ce4dc2ac54cbd83ff286f3 [2019-10-03 02:35:13,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:35:13,448 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:35:13,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:35:13,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:35:13,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:35:13,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:35:13" (1/1) ... [2019-10-03 02:35:13,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b6e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:13, skipping insertion in model container [2019-10-03 02:35:13,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:35:13" (1/1) ... [2019-10-03 02:35:13,468 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:35:13,493 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:35:13,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:35:13,750 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:35:13,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:35:13,782 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:35:13,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:13 WrapperNode [2019-10-03 02:35:13,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:35:13,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:35:13,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:35:13,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:35:13,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:13" (1/1) ... [2019-10-03 02:35:13,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:13" (1/1) ... [2019-10-03 02:35:13,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:13" (1/1) ... [2019-10-03 02:35:13,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:13" (1/1) ... [2019-10-03 02:35:13,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:13" (1/1) ... [2019-10-03 02:35:13,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:13" (1/1) ... [2019-10-03 02:35:13,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:13" (1/1) ... [2019-10-03 02:35:13,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:35:13,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:35:13,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:35:13,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:35:13,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:13" (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-10-03 02:35:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:35:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:35:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-03 02:35:13,993 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:35:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:35:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:35:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-03 02:35:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:35:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:35:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:35:14,192 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:35:14,193 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:35:14,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:35:14 BoogieIcfgContainer [2019-10-03 02:35:14,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:35:14,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:35:14,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:35:14,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:35:14,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:35:13" (1/3) ... [2019-10-03 02:35:14,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a72befe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:35:14, skipping insertion in model container [2019-10-03 02:35:14,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:13" (2/3) ... [2019-10-03 02:35:14,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a72befe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:35:14, skipping insertion in model container [2019-10-03 02:35:14,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:35:14" (3/3) ... [2019-10-03 02:35:14,205 INFO L109 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2019-10-03 02:35:14,219 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:35:14,229 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:35:14,277 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:35:14,337 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:35:14,337 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:35:14,338 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:35:14,338 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:35:14,338 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:35:14,339 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:35:14,339 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:35:14,339 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:35:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-03 02:35:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:35:14,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:14,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:14,377 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:14,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:14,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1345568573, now seen corresponding path program 1 times [2019-10-03 02:35:14,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:14,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:14,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:14,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:14,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:14,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:35:14,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:35:14,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:35:14,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:35:14,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:35:14,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:35:14,871 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2019-10-03 02:35:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:15,030 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-10-03 02:35:15,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:35:15,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-10-03 02:35:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:15,046 INFO L225 Difference]: With dead ends: 24 [2019-10-03 02:35:15,047 INFO L226 Difference]: Without dead ends: 24 [2019-10-03 02:35:15,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:35:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-03 02:35:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-03 02:35:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-03 02:35:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-03 02:35:15,089 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 12 [2019-10-03 02:35:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:15,090 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-03 02:35:15,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:35:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-03 02:35:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:35:15,092 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:15,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:15,092 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:15,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:15,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1402826875, now seen corresponding path program 1 times [2019-10-03 02:35:15,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:15,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:15,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:15,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:15,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:15,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:35:15,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:35:15,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:35:15,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:35:15,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:35:15,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:35:15,182 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2019-10-03 02:35:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:15,241 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-10-03 02:35:15,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:35:15,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-03 02:35:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:15,246 INFO L225 Difference]: With dead ends: 33 [2019-10-03 02:35:15,246 INFO L226 Difference]: Without dead ends: 33 [2019-10-03 02:35:15,248 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:35:15,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-03 02:35:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-03 02:35:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-03 02:35:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-03 02:35:15,269 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 12 [2019-10-03 02:35:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:15,270 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-03 02:35:15,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:35:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-03 02:35:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:35:15,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:15,274 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:15,274 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:15,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1436486517, now seen corresponding path program 1 times [2019-10-03 02:35:15,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:15,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:15,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:15,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:15,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:15,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:15,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:15,434 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-10-03 02:35:15,436 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [20], [26], [29], [31], [34], [36], [37], [38], [39], [41], [42] [2019-10-03 02:35:15,479 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:35:15,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:35:15,560 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:35:16,301 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:35:16,305 INFO L272 AbstractInterpreter]: Visited 16 different actions 133 times. Merged at 5 different actions 38 times. Widened at 1 different actions 3 times. Performed 201 root evaluator evaluations with a maximum evaluation depth of 8. Performed 201 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 9 fixpoints after 3 different actions. Largest state had 7 variables. [2019-10-03 02:35:16,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:16,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:35:16,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:16,313 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-10-03 02:35:16,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:16,351 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-10-03 02:35:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:16,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 02:35:16,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:16,469 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:16,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:16,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-10-03 02:35:16,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:16,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:35:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:35:16,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:35:16,540 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-10-03 02:35:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:16,590 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-10-03 02:35:16,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:35:16,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-03 02:35:16,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:16,594 INFO L225 Difference]: With dead ends: 30 [2019-10-03 02:35:16,595 INFO L226 Difference]: Without dead ends: 30 [2019-10-03 02:35:16,596 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:35:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-03 02:35:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-03 02:35:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-03 02:35:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-03 02:35:16,621 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-10-03 02:35:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:16,624 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-03 02:35:16,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:35:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-03 02:35:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:35:16,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:16,631 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:16,632 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:16,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1136980881, now seen corresponding path program 2 times [2019-10-03 02:35:16,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:16,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:16,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:16,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:16,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:35:16,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:16,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:16,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:16,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:16,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:16,813 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-10-03 02:35:16,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:16,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:35:29,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:35:29,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:29,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-03 02:35:29,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:35:29,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:35:29,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:29,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-10-03 02:35:29,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:29,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:35:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:35:29,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:35:29,196 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2019-10-03 02:35:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:29,260 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-03 02:35:29,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:35:29,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-03 02:35:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:29,266 INFO L225 Difference]: With dead ends: 34 [2019-10-03 02:35:29,267 INFO L226 Difference]: Without dead ends: 34 [2019-10-03 02:35:29,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:35:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-03 02:35:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-03 02:35:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-03 02:35:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-03 02:35:29,279 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2019-10-03 02:35:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:29,280 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-03 02:35:29,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:35:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-03 02:35:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-03 02:35:29,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:29,284 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:29,284 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:29,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1851034775, now seen corresponding path program 3 times [2019-10-03 02:35:29,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:29,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:29,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:29,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:29,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-03 02:35:29,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:29,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:29,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:29,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:29,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:29,484 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-10-03 02:35:29,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:35:29,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:35:29,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:35:29,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:29,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-03 02:35:29,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-03 02:35:29,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-03 02:35:29,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:29,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-10-03 02:35:29,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:29,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:35:29,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:35:29,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:35:29,742 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-10-03 02:35:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:29,845 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-10-03 02:35:29,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:35:29,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-10-03 02:35:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:29,850 INFO L225 Difference]: With dead ends: 38 [2019-10-03 02:35:29,851 INFO L226 Difference]: Without dead ends: 38 [2019-10-03 02:35:29,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:35:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-03 02:35:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-03 02:35:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-03 02:35:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-10-03 02:35:29,866 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2019-10-03 02:35:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:29,867 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-10-03 02:35:29,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:35:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-10-03 02:35:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-03 02:35:29,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:29,869 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:29,870 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:29,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:29,875 INFO L82 PathProgramCache]: Analyzing trace with hash 103432291, now seen corresponding path program 4 times [2019-10-03 02:35:29,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:29,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:29,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:29,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:29,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 02:35:30,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:30,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:30,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:30,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:30,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:30,030 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:30,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:30,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:30,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-03 02:35:30,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 02:35:30,121 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 02:35:30,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:30,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-10-03 02:35:30,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:30,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:35:30,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:35:30,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:35:30,291 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 8 states. [2019-10-03 02:35:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:30,391 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-03 02:35:30,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:35:30,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-03 02:35:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:30,393 INFO L225 Difference]: With dead ends: 42 [2019-10-03 02:35:30,393 INFO L226 Difference]: Without dead ends: 42 [2019-10-03 02:35:30,394 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:35:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-03 02:35:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-10-03 02:35:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-03 02:35:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-10-03 02:35:30,401 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 44 [2019-10-03 02:35:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:30,401 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-10-03 02:35:30,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:35:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-10-03 02:35:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 02:35:30,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:30,403 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:30,404 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:30,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1878094685, now seen corresponding path program 5 times [2019-10-03 02:35:30,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:30,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:30,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:30,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:35:30,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:30,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:30,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:30,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:30,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:30,576 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-10-03 02:35:30,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:30,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:36:20,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-03 02:36:20,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:36:20,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-03 02:36:20,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:36:20,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:36:20,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:20,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-10-03 02:36:20,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:20,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:36:20,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:36:20,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:36:20,698 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 9 states. [2019-10-03 02:36:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:20,820 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-03 02:36:20,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:36:20,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-10-03 02:36:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:20,822 INFO L225 Difference]: With dead ends: 46 [2019-10-03 02:36:20,822 INFO L226 Difference]: Without dead ends: 46 [2019-10-03 02:36:20,822 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:36:20,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-03 02:36:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-10-03 02:36:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-03 02:36:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-10-03 02:36:20,834 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 52 [2019-10-03 02:36:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:20,835 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-10-03 02:36:20,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:36:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-10-03 02:36:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 02:36:20,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:20,840 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:20,840 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:20,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:20,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1262160983, now seen corresponding path program 6 times [2019-10-03 02:36:20,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:20,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:36:20,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:20,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-03 02:36:20,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:20,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:20,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:20,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:20,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:20,994 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-10-03 02:36:21,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:36:21,026 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-10-03 02:36:21,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:36:21,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:36:21,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-03 02:36:21,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-03 02:36:21,125 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream Closed [2019-10-03 02:36:21,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:21,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-10-03 02:36:21,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:21,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:36:21,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:36:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:36:21,288 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 10 states. [2019-10-03 02:36:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:21,450 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-10-03 02:36:21,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:36:21,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-10-03 02:36:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:21,452 INFO L225 Difference]: With dead ends: 50 [2019-10-03 02:36:21,454 INFO L226 Difference]: Without dead ends: 50 [2019-10-03 02:36:21,455 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:36:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-03 02:36:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-03 02:36:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-03 02:36:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-10-03 02:36:21,463 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 60 [2019-10-03 02:36:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:21,463 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-10-03 02:36:21,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:36:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-10-03 02:36:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 02:36:21,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:21,467 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:21,467 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:21,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash 977341265, now seen corresponding path program 7 times [2019-10-03 02:36:21,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:21,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:21,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:36:21,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:21,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-03 02:36:21,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:21,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:21,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:21,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:21,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:21,639 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) [2019-10-03 02:36:21,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:21,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:36:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:21,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 02:36:21,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-03 02:36:21,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 02:36:21,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:21,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-10-03 02:36:21,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:21,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:36:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:36:21,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:36:21,932 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 11 states. [2019-10-03 02:36:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:22,082 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-10-03 02:36:22,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:36:22,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-03 02:36:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:22,083 INFO L225 Difference]: With dead ends: 54 [2019-10-03 02:36:22,084 INFO L226 Difference]: Without dead ends: 54 [2019-10-03 02:36:22,085 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:36:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-03 02:36:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-10-03 02:36:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-03 02:36:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-10-03 02:36:22,098 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 68 [2019-10-03 02:36:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:22,099 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-10-03 02:36:22,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:36:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-10-03 02:36:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 02:36:22,100 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:22,101 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:22,101 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:22,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash 87912523, now seen corresponding path program 8 times [2019-10-03 02:36:22,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:22,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:22,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:22,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:22,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-03 02:36:22,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:22,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:22,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:22,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:22,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:22,293 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) [2019-10-03 02:36:22,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:36:22,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:49,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-03 02:37:49,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:49,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-03 02:37:49,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 41 proven. 140 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-03 02:37:49,557 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:49,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:37:50,429 WARN L191 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-10-03 02:37:50,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:37:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 41 proven. 140 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-03 02:37:53,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:53,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 18] total 38 [2019-10-03 02:37:53,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:53,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-03 02:37:53,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-03 02:37:53,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1110, Unknown=1, NotChecked=0, Total=1406 [2019-10-03 02:37:53,658 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 23 states. [2019-10-03 02:37:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:54,111 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-10-03 02:37:54,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 02:37:54,112 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 76 [2019-10-03 02:37:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:54,113 INFO L225 Difference]: With dead ends: 60 [2019-10-03 02:37:54,113 INFO L226 Difference]: Without dead ends: 60 [2019-10-03 02:37:54,115 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=300, Invalid=1181, Unknown=1, NotChecked=0, Total=1482 [2019-10-03 02:37:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-03 02:37:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-10-03 02:37:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-03 02:37:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2019-10-03 02:37:54,120 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 76 [2019-10-03 02:37:54,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:54,121 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2019-10-03 02:37:54,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-03 02:37:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2019-10-03 02:37:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-03 02:37:54,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:54,123 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:54,123 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:54,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:54,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1704314043, now seen corresponding path program 9 times [2019-10-03 02:37:54,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:54,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:54,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:37:54,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:54,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-03 02:37:54,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:54,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:54,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:54,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:54,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:54,327 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-10-03 02:37:54,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:37:54,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:37:54,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:37:54,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:54,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 02:37:54,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-03 02:37:54,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-03 02:37:54,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:54,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-10-03 02:37:54,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:54,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:37:54,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:37:54,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:37:54,637 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 13 states. [2019-10-03 02:37:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:54,951 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-10-03 02:37:54,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:37:54,954 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2019-10-03 02:37:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:54,955 INFO L225 Difference]: With dead ends: 62 [2019-10-03 02:37:54,955 INFO L226 Difference]: Without dead ends: 62 [2019-10-03 02:37:54,956 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:37:54,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-03 02:37:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-10-03 02:37:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-03 02:37:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-10-03 02:37:54,962 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 84 [2019-10-03 02:37:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:54,962 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-10-03 02:37:54,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:37:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-10-03 02:37:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:37:54,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:54,964 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:54,964 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash 234974271, now seen corresponding path program 10 times [2019-10-03 02:37:54,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:54,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:37:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:54,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 02:37:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 02:37:55,126 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-03 02:37:55,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:37:55 BoogieIcfgContainer [2019-10-03 02:37:55,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:37:55,188 INFO L168 Benchmark]: Toolchain (without parser) took 161739.87 ms. Allocated memory was 139.5 MB in the beginning and 339.7 MB in the end (delta: 200.3 MB). Free memory was 87.2 MB in the beginning and 268.9 MB in the end (delta: -181.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:37:55,189 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:37:55,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.30 ms. Allocated memory is still 139.5 MB. Free memory was 87.0 MB in the beginning and 77.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:37:55,190 INFO L168 Benchmark]: Boogie Preprocessor took 129.70 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 77.7 MB in the beginning and 177.8 MB in the end (delta: -100.1 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:37:55,191 INFO L168 Benchmark]: RCFGBuilder took 278.04 ms. Allocated memory is still 199.2 MB. Free memory was 177.2 MB in the beginning and 165.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:37:55,192 INFO L168 Benchmark]: TraceAbstraction took 160989.79 ms. Allocated memory was 199.2 MB in the beginning and 339.7 MB in the end (delta: 140.5 MB). Free memory was 165.0 MB in the beginning and 268.9 MB in the end (delta: -103.9 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:37:55,196 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.28 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 337.30 ms. Allocated memory is still 139.5 MB. Free memory was 87.0 MB in the beginning and 77.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.70 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 77.7 MB in the beginning and 177.8 MB in the end (delta: -100.1 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 278.04 ms. Allocated memory is still 199.2 MB. Free memory was 177.2 MB in the beginning and 165.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 160989.79 ms. Allocated memory was 199.2 MB in the beginning and 339.7 MB in the end (delta: 140.5 MB). Free memory was 165.0 MB in the beginning and 268.9 MB in the end (delta: -103.9 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; VAL [loop1=2, n1=3, sn=0, x=0] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=0, x=0] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=2, x=0] [L17] x++ VAL [loop1=2, n1=3, sn=2, x=1] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=2, x=1] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=2, x=1] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=4, x=1] [L17] x++ VAL [loop1=2, n1=3, sn=4, x=2] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=4, x=2] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=4, x=2] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=6, x=2] [L17] x++ VAL [loop1=2, n1=3, sn=6, x=3] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=6, x=3] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=6, x=3] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=8, x=3] [L17] x++ VAL [loop1=2, n1=3, sn=8, x=4] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=8, x=4] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=8, x=4] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=10, x=4] [L17] x++ VAL [loop1=2, n1=3, sn=10, x=5] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=10, x=5] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=10, x=5] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=12, x=5] [L17] x++ VAL [loop1=2, n1=3, sn=12, x=6] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=12, x=6] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=12, x=6] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=14, x=6] [L17] x++ VAL [loop1=2, n1=3, sn=14, x=7] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=14, x=7] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=14, x=7] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=16, x=7] [L17] x++ VAL [loop1=2, n1=3, sn=16, x=8] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=16, x=8] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=16, x=8] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=18, x=8] [L17] x++ VAL [loop1=2, n1=3, sn=18, x=9] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=18, x=9] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=18, x=9] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=20, x=9] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=10] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=20, x=10] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=20, x=10] [L14] COND FALSE !(x<10) VAL [loop1=2, n1=3, sn=20, x=10] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=11] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 160.8s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 75 SDslu, 1174 SDs, 0 SdLazy, 1462 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1023 GetRequests, 858 SyntacticMatches, 19 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 12 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 149.0s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1399 ConstructedInterpolants, 0 QuantifiedInterpolants, 336408 SizeOfPredicates, 11 NumberOfNonLiveVariables, 954 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 1956/3690 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...