java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/float-benchs/drift_tenth.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:30:53,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:30:53,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:30:53,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:30:53,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:30:53,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:30:53,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:30:53,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:30:53,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:30:53,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:30:53,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:30:53,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:30:53,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:30:53,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:30:53,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:30:53,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:30:53,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:30:53,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:30:53,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:30:53,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:30:53,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:30:53,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:30:53,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:30:53,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:30:53,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:30:53,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:30:53,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:30:53,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:30:53,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:30:53,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:30:53,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:30:53,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:30:53,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:30:53,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:30:53,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:30:53,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:30:53,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:30:53,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:30:53,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:30:53,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:30:53,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:30:53,400 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:30:53,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:30:53,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:30:53,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:30:53,420 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:30:53,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:30:53,421 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:30:53,422 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:30:53,422 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:30:53,422 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:30:53,422 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:30:53,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:30:53,424 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:30:53,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:30:53,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:30:53,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:30:53,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:30:53,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:30:53,425 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:30:53,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:30:53,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:30:53,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:30:53,426 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:30:53,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:30:53,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:30:53,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:30:53,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:30:53,427 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:30:53,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:30:53,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:30:53,427 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:30:53,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:30:53,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:30:53,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:30:53,486 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:30:53,486 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:30:53,487 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/drift_tenth.c [2019-09-10 01:30:53,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b23ad74e/89adba39f61b43da9edb67b2572a79e3/FLAG5cd43563d [2019-09-10 01:30:54,075 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:30:54,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth.c [2019-09-10 01:30:54,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b23ad74e/89adba39f61b43da9edb67b2572a79e3/FLAG5cd43563d [2019-09-10 01:30:54,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b23ad74e/89adba39f61b43da9edb67b2572a79e3 [2019-09-10 01:30:54,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:30:54,428 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:30:54,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:30:54,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:30:54,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:30:54,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:30:54" (1/1) ... [2019-09-10 01:30:54,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d73ed38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:54, skipping insertion in model container [2019-09-10 01:30:54,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:30:54" (1/1) ... [2019-09-10 01:30:54,444 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:30:54,459 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:30:54,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:30:54,644 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:30:54,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:30:54,684 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:30:54,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:54 WrapperNode [2019-09-10 01:30:54,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:30:54,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:30:54,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:30:54,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:30:54,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:54" (1/1) ... [2019-09-10 01:30:54,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:54" (1/1) ... [2019-09-10 01:30:54,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:54" (1/1) ... [2019-09-10 01:30:54,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:54" (1/1) ... [2019-09-10 01:30:54,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:54" (1/1) ... [2019-09-10 01:30:54,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:54" (1/1) ... [2019-09-10 01:30:54,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:54" (1/1) ... [2019-09-10 01:30:54,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:30:54,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:30:54,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:30:54,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:30:54,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:30:54,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:30:54,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:30:54,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:30:54,954 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:30:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:30:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:30:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:30:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:30:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:30:55,119 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:30:55,119 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 01:30:55,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:30:55 BoogieIcfgContainer [2019-09-10 01:30:55,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:30:55,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:30:55,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:30:55,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:30:55,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:30:54" (1/3) ... [2019-09-10 01:30:55,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f774471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:30:55, skipping insertion in model container [2019-09-10 01:30:55,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:54" (2/3) ... [2019-09-10 01:30:55,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f774471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:30:55, skipping insertion in model container [2019-09-10 01:30:55,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:30:55" (3/3) ... [2019-09-10 01:30:55,129 INFO L109 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2019-09-10 01:30:55,140 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:30:55,147 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:30:55,166 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:30:55,196 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:30:55,197 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:30:55,197 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:30:55,197 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:30:55,197 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:30:55,197 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:30:55,197 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:30:55,198 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:30:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-10 01:30:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:30:55,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:55,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:55,226 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2019-09-10 01:30:55,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:55,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:55,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:30:55,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 01:30:55,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:30:55,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 01:30:55,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 01:30:55,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:30:55,353 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-10 01:30:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:55,367 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-10 01:30:55,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 01:30:55,368 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 01:30:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:55,378 INFO L225 Difference]: With dead ends: 19 [2019-09-10 01:30:55,378 INFO L226 Difference]: Without dead ends: 12 [2019-09-10 01:30:55,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:30:55,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-10 01:30:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-10 01:30:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-10 01:30:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-10 01:30:55,415 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-10 01:30:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:55,416 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-10 01:30:55,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 01:30:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-10 01:30:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:30:55,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:55,418 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:55,419 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:55,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:55,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1877050693, now seen corresponding path program 1 times [2019-09-10 01:30:55,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:30:55,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:30:55,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:30:55,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:30:55,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:30:55,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:30:55,482 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-10 01:30:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:55,504 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-10 01:30:55,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:30:55,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 01:30:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:55,506 INFO L225 Difference]: With dead ends: 14 [2019-09-10 01:30:55,506 INFO L226 Difference]: Without dead ends: 14 [2019-09-10 01:30:55,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:30:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-10 01:30:55,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-10 01:30:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-10 01:30:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-10 01:30:55,523 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-10 01:30:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:55,523 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-10 01:30:55,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:30:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-10 01:30:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 01:30:55,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:55,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:55,531 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:55,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1175909113, now seen corresponding path program 1 times [2019-09-10 01:30:55,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:55,610 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-10 01:30:55,612 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [14], [21], [24], [26], [32], [33], [34], [36] [2019-09-10 01:30:55,644 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:30:55,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:30:55,741 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:30:55,742 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:30:55,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:30:55,762 INFO L272 AbstractInterpreter]: Visited 12 different actions 41 times. Merged at 3 different actions 16 times. Widened at 1 different actions 3 times. Performed 81 root evaluator evaluations with a maximum evaluation depth of 4. Performed 81 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-10 01:30:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:55,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:30:55,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:55,766 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:55,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:55,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:30:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:55,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 01:30:55,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:55,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:55,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-10 01:30:55,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:55,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:30:55,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:30:55,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:30:55,908 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-10 01:30:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:55,945 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-10 01:30:55,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:30:55,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-10 01:30:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:55,948 INFO L225 Difference]: With dead ends: 16 [2019-09-10 01:30:55,948 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 01:30:55,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:30:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 01:30:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-10 01:30:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 01:30:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-10 01:30:55,953 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-10 01:30:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:55,954 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-10 01:30:55,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:30:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-10 01:30:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 01:30:55,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:55,956 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:55,956 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1607619511, now seen corresponding path program 2 times [2019-09-10 01:30:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:55,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:55,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:56,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:56,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:56,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:56,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:30:56,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:30:56,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 01:30:56,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:56,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 01:30:56,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,059 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:56,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-09-10 01:30:56,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:56,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:30:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:30:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:30:56,133 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-10 01:30:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:56,165 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 01:30:56,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:30:56,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-10 01:30:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:56,167 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:30:56,168 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 01:30:56,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:30:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 01:30:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-10 01:30:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 01:30:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-10 01:30:56,176 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-10 01:30:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:56,176 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-10 01:30:56,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:30:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-10 01:30:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 01:30:56,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:56,178 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:56,178 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:56,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:56,179 INFO L82 PathProgramCache]: Analyzing trace with hash -130515723, now seen corresponding path program 3 times [2019-09-10 01:30:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:56,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:56,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:56,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:56,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:56,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:56,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:30:56,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:30:56,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:30:56,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:56,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 01:30:56,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,301 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:56,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-10 01:30:56,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:56,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:30:56,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:30:56,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:30:56,375 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-10 01:30:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:56,408 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-10 01:30:56,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:30:56,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-10 01:30:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:56,409 INFO L225 Difference]: With dead ends: 20 [2019-09-10 01:30:56,410 INFO L226 Difference]: Without dead ends: 20 [2019-09-10 01:30:56,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:30:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-10 01:30:56,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-10 01:30:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 01:30:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-10 01:30:56,414 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-10 01:30:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:56,415 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-10 01:30:56,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:30:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-10 01:30:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:30:56,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:56,416 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:56,416 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:56,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:56,417 INFO L82 PathProgramCache]: Analyzing trace with hash 263802547, now seen corresponding path program 4 times [2019-09-10 01:30:56,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:56,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:56,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:56,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:56,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:56,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:30:56,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:56,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:56,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 01:30:56,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,598 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:56,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-10 01:30:56,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:56,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:30:56,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:30:56,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:56,691 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-10 01:30:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:56,716 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-10 01:30:56,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:30:56,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-10 01:30:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:56,717 INFO L225 Difference]: With dead ends: 22 [2019-09-10 01:30:56,717 INFO L226 Difference]: Without dead ends: 22 [2019-09-10 01:30:56,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-10 01:30:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-10 01:30:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 01:30:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-10 01:30:56,722 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-10 01:30:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:56,722 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-10 01:30:56,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:30:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-10 01:30:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:30:56,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:56,723 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:56,724 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:56,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:56,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1246537969, now seen corresponding path program 5 times [2019-09-10 01:30:56,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:56,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:56,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:56,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:56,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:56,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:56,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:30:56,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:30:56,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 01:30:56,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:56,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 01:30:56,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,858 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:56,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:56,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2019-09-10 01:30:56,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:56,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:30:56,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:30:56,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:56,959 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-10 01:30:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:57,002 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-10 01:30:57,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:30:57,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-10 01:30:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:57,004 INFO L225 Difference]: With dead ends: 24 [2019-09-10 01:30:57,004 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 01:30:57,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 01:30:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-10 01:30:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 01:30:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-10 01:30:57,010 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-10 01:30:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:57,011 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-10 01:30:57,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:30:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-10 01:30:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:30:57,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:57,013 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:57,014 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:57,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:57,014 INFO L82 PathProgramCache]: Analyzing trace with hash 762473391, now seen corresponding path program 6 times [2019-09-10 01:30:57,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:57,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:57,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:57,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:57,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:57,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:57,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:57,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:57,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:57,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:30:57,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:30:57,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:57,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:30:57,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:57,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 01:30:57,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,173 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:57,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2019-09-10 01:30:57,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:57,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:30:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:30:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:57,275 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-10 01:30:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:57,315 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-10 01:30:57,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:30:57,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-10 01:30:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:57,317 INFO L225 Difference]: With dead ends: 26 [2019-09-10 01:30:57,318 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 01:30:57,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 01:30:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-10 01:30:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 01:30:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-10 01:30:57,324 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-10 01:30:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:57,324 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-10 01:30:57,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:30:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-10 01:30:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:30:57,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:57,326 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:57,326 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:57,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:57,326 INFO L82 PathProgramCache]: Analyzing trace with hash -567118099, now seen corresponding path program 7 times [2019-09-10 01:30:57,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:57,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:57,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:57,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:57,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:57,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:57,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:57,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:57,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:57,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:57,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:57,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:30:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:57,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:30:57,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,513 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:57,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2019-09-10 01:30:57,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:57,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:30:57,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:30:57,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:57,616 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-10 01:30:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:57,655 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-10 01:30:57,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:30:57,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-10 01:30:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:57,657 INFO L225 Difference]: With dead ends: 28 [2019-09-10 01:30:57,657 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 01:30:57,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 01:30:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-10 01:30:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 01:30:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-10 01:30:57,661 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-10 01:30:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:57,662 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-10 01:30:57,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:30:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-10 01:30:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:30:57,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:57,663 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:57,664 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1595714219, now seen corresponding path program 8 times [2019-09-10 01:30:57,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:57,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:57,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:57,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:57,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:57,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:57,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:57,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:57,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:57,755 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-09-10 01:30:57,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:30:57,774 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-09-10 01:30:57,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 01:30:57,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:57,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 01:30:57,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,804 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:57,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:57,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 12 [2019-09-10 01:30:57,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:57,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:30:57,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:30:57,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:57,910 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2019-09-10 01:30:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:57,945 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-10 01:30:57,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:30:57,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-09-10 01:30:57,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:57,948 INFO L225 Difference]: With dead ends: 30 [2019-09-10 01:30:57,948 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 01:30:57,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:57,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 01:30:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-10 01:30:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:30:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-10 01:30:57,952 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-10 01:30:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:57,953 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-10 01:30:57,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:30:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-10 01:30:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:30:57,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:57,954 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:57,954 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:57,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:57,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1313400553, now seen corresponding path program 9 times [2019-09-10 01:30:57,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:57,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:57,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:57,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:57,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:58,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:58,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:30:58,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:58,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:58,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:58,065 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) [2019-09-10 01:30:58,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:30:58,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:58,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:30:58,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:58,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 01:30:58,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:58,103 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:58,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:30:58,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-09-10 01:30:58,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:58,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:30:58,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:30:58,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:58,184 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2019-09-10 01:30:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:58,234 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-10 01:30:58,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 01:30:58,235 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-10 01:30:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:58,236 INFO L225 Difference]: With dead ends: 31 [2019-09-10 01:30:58,236 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 01:30:58,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:30:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 01:30:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-10 01:30:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 01:30:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-10 01:30:58,240 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-10 01:30:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:58,240 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-10 01:30:58,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:30:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-10 01:30:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 01:30:58,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:58,242 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:58,242 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:58,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:58,242 INFO L82 PathProgramCache]: Analyzing trace with hash 592907175, now seen corresponding path program 10 times [2019-09-10 01:30:58,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:58,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:58,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:58,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:58,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 01:30:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 01:30:58,286 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 01:30:58,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:30:58 BoogieIcfgContainer [2019-09-10 01:30:58,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:30:58,326 INFO L168 Benchmark]: Toolchain (without parser) took 3896.24 ms. Allocated memory was 131.6 MB in the beginning and 263.2 MB in the end (delta: 131.6 MB). Free memory was 88.1 MB in the beginning and 153.2 MB in the end (delta: -65.1 MB). Peak memory consumption was 66.5 MB. Max. memory is 7.1 GB. [2019-09-10 01:30:58,327 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 131.6 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 01:30:58,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.37 ms. Allocated memory is still 131.6 MB. Free memory was 87.7 MB in the beginning and 78.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-09-10 01:30:58,329 INFO L168 Benchmark]: Boogie Preprocessor took 206.44 ms. Allocated memory was 131.6 MB in the beginning and 199.8 MB in the end (delta: 68.2 MB). Free memory was 78.2 MB in the beginning and 176.1 MB in the end (delta: -98.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2019-09-10 01:30:58,332 INFO L168 Benchmark]: RCFGBuilder took 227.91 ms. Allocated memory is still 199.8 MB. Free memory was 176.1 MB in the beginning and 165.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-09-10 01:30:58,333 INFO L168 Benchmark]: TraceAbstraction took 3201.37 ms. Allocated memory was 199.8 MB in the beginning and 263.2 MB in the end (delta: 63.4 MB). Free memory was 164.6 MB in the beginning and 153.2 MB in the end (delta: 11.4 MB). Peak memory consumption was 74.8 MB. Max. memory is 7.1 GB. [2019-09-10 01:30:58,336 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.24 ms. Allocated memory is still 131.6 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 256.37 ms. Allocated memory is still 131.6 MB. Free memory was 87.7 MB in the beginning and 78.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 206.44 ms. Allocated memory was 131.6 MB in the beginning and 199.8 MB in the end (delta: 68.2 MB). Free memory was 78.2 MB in the beginning and 176.1 MB in the end (delta: -98.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 227.91 ms. Allocated memory is still 199.8 MB. Free memory was 176.1 MB in the beginning and 165.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3201.37 ms. Allocated memory was 199.8 MB in the beginning and 263.2 MB in the end (delta: 63.4 MB). Free memory was 164.6 MB in the beginning and 153.2 MB in the end (delta: 11.4 MB). Peak memory consumption was 74.8 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: [L8] float tick = 1.f / 10.f; [L9] float time = 0.f; [L10] int i; [L12] i = 0 VAL [i=0, tick=1/10, time=0] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=0, tick=1/10, time=1/10] [L12] i++ VAL [i=1, tick=1/10, time=1/10] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=1, tick=1/10, time=1/5] [L12] i++ VAL [i=2, tick=1/10, time=1/5] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=2, tick=1/10, time=3/10] [L12] i++ VAL [i=3, tick=1/10, time=3/10] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=3, tick=1/10, time=2/5] [L12] i++ VAL [i=4, tick=1/10, time=2/5] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=4, tick=1/10, time=1/2] [L12] i++ VAL [i=5, tick=1/10, time=1/2] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=5, tick=1/10, time=3/5] [L12] i++ VAL [i=6, tick=1/10, time=3/5] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=6, tick=1/10, time=7/10] [L12] i++ VAL [i=7, tick=1/10, time=7/10] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=7, tick=1/10, time=4/5] [L12] i++ VAL [i=8, tick=1/10, time=4/5] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=8, tick=1/10, time=9/10] [L12] i++ VAL [i=9, tick=1/10, time=9/10] [L12] COND TRUE i < 10 [L13] time += tick VAL [i=9, tick=1/10, time=1] [L12] i++ VAL [i=10, tick=1/10, time=1] [L12] COND FALSE !(i < 10) VAL [i=10, tick=1/10, time=1] [L15] CALL __VERIFIER_assert(time != 1.0) VAL [\old(cond)=0] [L4] 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, 3.1s OverallTime, 12 OverallIterations, 10 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 119 SDtfs, 55 SDslu, 216 SDs, 0 SdLazy, 156 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 319 SyntacticMatches, 30 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 531 ConstructedInterpolants, 0 QuantifiedInterpolants, 23373 SizeOfPredicates, 9 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 0/855 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...